CS301- Data Structures

Podcast Beta

Play an AI-generated podcast conversation about this lesson

Questions and Answers

The operation for removing an entry from a stack is traditionally called:

remove

delete

pop (correct)

peek

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists (correct)

Stack is a special kind of list in which all insertions and deletions take place at one end

A list is a sequence of one or more data items

Lists can be implemented by using arrays or linked lists

Parameters in function calls are passed using:

Stack (correct)

Queue

Binary Search Tree

AVL Tree

Consider the following sequence of push operations in a stack: 'stack.push('7'); stack.push('8'); stack.push('9'); stack.push('10'); stack.push('11'); stack.push('12');' What will the stack contain?

7 8 9 10 11 12 Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

A queue where the de-queue operation depends not on FIFO is called a priority queue:

True Signup and view all the answers

The data of the problem is 2GB and the hard disk is 1GB capacity; to solve this problem we should:

Use as much data as we can store on the hard disk Signup and view all the answers

Consider the function int X(int& Value) { return Value; }. Which one of the following is a valid call to the function X?

a = X(b) Signup and view all the answers

In the call by value methodology, a copy of the object is passed to the called function:

True Signup and view all the answers

The tree data structure is:

Non-linear data structure Signup and view all the answers

When should you use a const reference parameter?

Whenever the parameter has huge size, and the function does not change the parameter within its body. Signup and view all the answers

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Only x can alter the private member variables of the object that activates the function. Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

If n is the number of nodes in a complete Binary Tree, then the maximum steps required for a search operation are:

Log2(n + 1) Signup and view all the answers

In the linked list implementation of the stack class, where does the push member function place the new entry on the linked list?

At the head Signup and view all the answers

The expression AB+C* is called:

Postfix expression Signup and view all the answers

___ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater than or equal?

Binary Search Tree Signup and view all the answers

If node A in the BST is deleted, which two nodes are the candidates to take its place?

H and E Signup and view all the answers

What is correct about the insertion cases in an AVL tree?

True Signup and view all the answers

We access elements in AVL Tree in:

Both linear and non-linear ways Signup and view all the answers

AVL Tree is:

Non-linear data structure Signup and view all the answers

Which one of the following is a valid postfix expression?

ab+cd- Signup and view all the answers

A Compound Data Structure is the data structure which can have multiple data items of the same type or of different types. Which of the following can be considered a compound data structure?

All of the given options Signup and view all the answers

Suppose a pointer has been declared in main but has not assigned any variable address, then that pointer contains a NULL value:

True Signup and view all the answers

The operation for removing an entry from a stack is traditionally called:

pop Signup and view all the answers

Each operator in a postfix expression refers to the previous ______ operand(s):

two Signup and view all the answers

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists Signup and view all the answers

Consider the following sequence of push operations in a stack. What will the result be after these operations?

7 8 9 10 11 12 Signup and view all the answers

Non-recursive calls are faster than recursive calls:

True Signup and view all the answers

A tree data structure is linear:

False Signup and view all the answers

Which of the following is a non-linear data structure?

Tree Signup and view all the answers

"+" is a ___ operator:

False Signup and view all the answers

Addition of new items in a stack makes the pointer ______ by 2:

increment, bytes Signup and view all the answers

The operation for removing an entry from a stack is traditionally called:

pop Signup and view all the answers

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists Signup and view all the answers

Parameters in function calls are passed using:

Stack Signup and view all the answers

What will be the order of elements after the given push operations into a stack?

9 10 8 11 12 7 Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

A queue where the de-queue operation depends not on FIFO is called a priority queue.

True Signup and view all the answers

The data of the problem is 2GB and the hard disk is 1GB capacity; to solve this problem we should:

Increase the hard disk space Signup and view all the answers

Consider the function `int X(int& Value) { return Value; }`. Which one of the following is a valid call to the function X?

a = X(b); Signup and view all the answers

In the call by value methodology, a copy of the object is passed to the called function.

True Signup and view all the answers

The tree data structure is:

Non-linear data structure Signup and view all the answers

When should you use a const reference parameter?

Whenever the parameter has huge size, and the function does not change the parameter within its body. Signup and view all the answers

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Two of the functions can alter the private member variables of the object that activates the function. Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

If n is the number of nodes in a complete binary tree, then the maximum steps required for a search operation are:

Log2(n+1) Signup and view all the answers

In the linked list implementation of the stack class, where does the push member function place the new entry on the linked list?

At the head Signup and view all the answers

The expression AB+C* is called:

Postfix expression Signup and view all the answers

___ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater than or equal?

Binary Search Tree Signup and view all the answers

If node A in the BST is deleted, which two nodes are the candidates to take its place?

H and E Signup and view all the answers

What is correct about the insertion cases in an AVL tree?

Single rotation can fix the balance in the cases of left-left or right-right. Signup and view all the answers

We access elements in an AVL Tree in:

Both linear and non-linear ways Signup and view all the answers

AVL Tree is:

Non-linear data structure Signup and view all the answers

Which one of the following is a valid postfix expression?

ab+cd- Signup and view all the answers

A Compound Data Structure is the data structure which can have multiple data items of the same type or of different types. Which of the following can be considered a compound data structure?

All of the given options Signup and view all the answers

Suppose a pointer has been declared in main but has not assigned any variable address, then:

That pointer contains a NULL value Signup and view all the answers

Which one of the following calling methods does not change the original value of the argument in the calling function?

Call by passing the value of the argument Signup and view all the answers

Searching for an element in an AVL tree takes a maximum of:

Log2(n+1) time (where n is the number of nodes) Signup and view all the answers

Each operator in a postfix expression refers to the previous __ operand(s):

Two Signup and view all the answers

Non-recursive calls are faster than recursive calls.

True Signup and view all the answers

Each entry which points to a null value in a singly linked list is known as:

Last Node Signup and view all the answers

The operation for removing an entry from a stack is traditionally called:

pop Signup and view all the answers

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists Signup and view all the answers

Parameters in function calls are passed using:

Stack Signup and view all the answers

Consider the following sequence of push operations in a stack: '7', '8', '9', '10', '11', '12'. What will be the stack's state after these operations?

7 8 9 10 11 12 Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

A queue where the de-queue operation depends not on FIFO is called a priority queue.

True Signup and view all the answers

The data of the problem is 2GB and the hard disk is 1GB capacity; to solve this problem we should:

Increase the hard disk space Signup and view all the answers

Consider the function int X(int& Value) { return Value; }. Which one of the following is a valid call to the function X?

a = X(b); Signup and view all the answers

In the call by value methodology, a copy of the object is passed to the called function.

True Signup and view all the answers

The tree data structure is:

Non-linear data structure Signup and view all the answers

When should you use a const reference parameter?

Whenever the parameter has huge size, and the function does not change the parameter within its body. Signup and view all the answers

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Only x can alter the private member variables of the object that activates the function. Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

If n is the number of nodes in a complete Binary Tree, then the maximum steps required for a search operation are:

Log2(n+1) Signup and view all the answers

In the linked list implementation of the stack class, where does the push member function place the new entry on the linked list?

At the head Signup and view all the answers

What is the correct expression for representing the operation to convert AB+C*?

Postfix expression Signup and view all the answers

___ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater than or equal?

Binary Search Tree Signup and view all the answers

If node A in the BST is deleted, which two nodes are the candidates to take its place?

H and E Signup and view all the answers

What is correct about the insertion cases in an AVL tree?

Single rotation can fix the balance in the cases of left-left or right-right. Signup and view all the answers

We access elements in AVL Tree in:

Both linear and non-linear ways Signup and view all the answers

AVL Tree is:

Non-linear data structure Signup and view all the answers

Which one of the following is a valid postfix expression?

ab+cd- Signup and view all the answers

The tree data structure is a:

Non-linear data structure Signup and view all the answers

A Compound Data Structure is the data structure which can have multiple data items of the same type or of different types. Which of the following can be considered a compound data structure?

All of the given options Signup and view all the answers

Suppose a pointer has been declared in main but has not assigned any variable address, then:

That pointer contains a NULL value Signup and view all the answers

What is the operation for removing an entry from a stack traditionally called?

pop Signup and view all the answers

Non-recursive calls are faster than recursive calls.

True Signup and view all the answers

Which of the following is TRUE about arrays?

We can neither increase nor decrease the array size after their creation. Signup and view all the answers

Searching for an element in an AVL tree takes a maximum of:

Log2(n+1) time (where n is the number of nodes) Signup and view all the answers

Which one of the following statements is NOT correct?

In a linked list, the elements are necessarily contiguous Signup and view all the answers

Each operator in a postfix expression refers to the previous ___ operand(s):

Two Signup and view all the answers

Which of the following calling methods does not change the original value of the argument in the calling function?

Call by passing the value of the argument Signup and view all the answers

A binary search tree should have a minimum of one ___ node(s) at each level:

One Signup and view all the answers

Which of the following statements is NOT correct?

Each entry which points to a null value in a singly linked list is known as Node Signup and view all the answers

Postfix notation for the expression 5 + 6 / 2?

562/+ Signup and view all the answers

Which of the following is a non-linear data structure?

Tree Signup and view all the answers

“+” is a ___ operator:

Binary Signup and view all the answers

What will be the valid postfix notation of A + B * C - D?

ABCD+-* Signup and view all the answers

In what case could the addition of new items in a stack make the pointer increment?

bits Signup and view all the answers

The operation for removing an entry from a stack is traditionally called:

pop Signup and view all the answers

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists Signup and view all the answers

Parameters in function calls are passed using:

Stack Signup and view all the answers

Consider the following sequence of push operations in a stack: stack.push('7'); stack.push('8'); stack.push('9'); stack.push('10'); stack.push('11'); stack.push('12'); What is the resulting order of elements when popped?

9 10 8 12 7 11 Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

A queue where the de-queue operation depends not on FIFO is called a priority queue.

True Signup and view all the answers

The data of the problem is 2GB and the hard disk is 1GB capacity; to solve this problem we should:

Increase the hard disk space Signup and view all the answers

Consider the function int X(int& Value) { return Value; }. Which one of the following is a valid call to the function X?

a = X(b); Signup and view all the answers

In the call by value methodology, a copy of the object is passed to the called function.

True Signup and view all the answers

The tree data structure is:

Non-linear data structure Signup and view all the answers

When should you use a const reference parameter?

Whenever the parameter has huge size, and the function does not change the parameter within its body. Signup and view all the answers

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Only x can alter the private member variables of the object that activates the function. Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

If n is the number of nodes in a complete Binary Tree, then the maximum steps required for a search operation are:

Log2(n+1) Signup and view all the answers

In the linked list implementation of the stack class, where does the push member function place the new entry on the linked list?

At the head Signup and view all the answers

Where does the push member function place the new entry in the circular array implementation of the queue class, with ten items in the queue stored at data and CAPACITY is 42?

data Signup and view all the answers

The expression AB+C* is called:

Postfix expression Signup and view all the answers

___ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater than or equal?

Binary Search Tree Signup and view all the answers

If node A in the BST is deleted, which two nodes are the candidates to take its place?

D and E Signup and view all the answers

What is correct about the insertion cases in an AVL tree?

Single rotation can fix the balance in the cases of left-left or right-right. Signup and view all the answers

We access elements in AVL Tree in:

Both linear and non-linear ways Signup and view all the answers

AVL Tree is:

Non-linear data structure Signup and view all the answers

Which one of the following is a valid postfix expression?

abc+d- Signup and view all the answers

A Compound Data Structure is the data structure which can have multiple data items of the same type or of different types. Which of the following can be considered a compound data structure?

All of the given options Signup and view all the answers

Suppose a pointer has been declared in main but has not assigned any variable address, then:

That pointer contains a NULL value Signup and view all the answers

Which of the three member functions can alter the PRIVATE member variables of the foo object that activates the function?

Only x can alter the private member variables of the object that activates the function. Signup and view all the answers

The operation for removing an entry from a stack is traditionally called:

Pop Signup and view all the answers

Which statement of the following statements is incorrect?

Stacks are easier to implement than lists Signup and view all the answers

Parameters in function calls are passed using:

Stack Signup and view all the answers

Consider the following sequence of push operations in a stack:

7 8 9 10 11 12 Signup and view all the answers

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum Signup and view all the answers

Each operator in a postfix expression refers to the previous __ operand(s):

Two Signup and view all the answers

Which one of the following calling methods does not change the original value of the argument in the calling function?

Call by passing the value of the argument Signup and view all the answers

A binary search tree should have a minimum of one __ node/s at each level:

One Signup and view all the answers

Which of the following is TRUE about arrays?

We can neither increase nor decrease the array size after their creation. Signup and view all the answers

Searching for an element in an AVL tree takes a maximum of:

Log2(n+1) time (where n is the number of nodes) Signup and view all the answers

Consider the following statements regarding binary trees:

(i), (ii) and (iii) only Signup and view all the answers

Consider the following infix expression: 5 + 6/2. If one converts the above expression into postfix, what would be the resultant expression?

56/2+ Signup and view all the answers

Which of the following is a non-linear data structure?

Tree Signup and view all the answers

'+' is a ___ operator:

Binary Signup and view all the answers

Addition of new items in a stack makes the pointer ______________ by 2:

Increment, bytes Signup and view all the answers

The next item in a linked list is known as:

Node Signup and view all the answers

What will be the postfix notation of 5 + 6 / 2?

562/+ Signup and view all the answers

In an AVL tree, to delete a parent with two children in a straight line, the following rotations will be required:

Double Signup and view all the answers

To check the depth of an AVL tree, the following time will be taken:

1.66 Log2(n + 1) Signup and view all the answers

BST is a structure:

Non-linear Signup and view all the answers

After the creation of an array:

Size can neither be increased nor decreased. Signup and view all the answers

Each node in a BST has:

2 pointers Signup and view all the answers

The highest operator precedence is of the following operator:

Exponentiation Signup and view all the answers

Following are the linear data structures:

Both a & b Signup and view all the answers

Each entry which points to a null value in a singly linked list is known as:

Last Node Signup and view all the answers

Non-recursive calls are faster than recursive calls.

True Signup and view all the answers

A tree data structure is:

Non-linear Signup and view all the answers

What will be the valid postfix notation of A + B * C - D?

ABCD+-* Signup and view all the answers

When an operator is used between two operands, this is which type of notation?

Infix Signup and view all the answers

Study Notes

Data Structures Concepts

A priority queue is a queue where de-queue operation doesn't follow FIFO (First In First Out).
When hard disk capacity is less than input data size, consider using better data structures and algorithms for efficient memory usage.
In call by value method, function receives a copy of the argument, so changes within the function do not affect the original value.
A tree data structure is a non-linear data structure that uses hierarchical relationships.
Using a const reference parameter prevents accidental modification of the original data.
When a class method is declared const, it cannot modify the private member variables of the object.
A function's recursive call depth can be unspecified because it might depend on various factors.
The maximum depth of a complete binary tree search is log2(n+1) - 1, where n is the number of nodes.
In a linked list implementation of a stack, push operations add new entries at the head.
In a circular array implementation of a queue, the push operation appends the new entry to the next available slot in the array, considering the circular nature.
AB+C* is an infix expression because operators are placed between operands.
A Binary Search Tree (BST) is a binary tree where left subtree values are less than or equal to the node's value, and right subtree values are greater than or equal.
In an AVL tree, a single rotation can fix the balance in the case of left-left and right-right insertion scenarios only.
AVL tree is a non-linear data structure due to its hierarchical nature.

Postfix Expressions

ab+cd- is a valid postfix expression.
A compound data structure can hold multiple data items of different types or the same type.
Arrays, Linked Lists, and Binary Search Trees are all examples of compound data structures.

Pointers and Memory

If a pointer in the main function is not assigned an address, it's considered a NULL pointer, not necessarily pointing to the first byte in the main function or any memory address.

Class Member Functions

Member functions in a class like foo can alter private member variables dependent on their declaration.
The function x(foo f) can alter the private member variables since it is not declared const.
The functions y(const foo f) and z(foo f) const cannot alter private member variables because they are declared const.

Stacks and Operations

Removing an entry from a stack is called popping.
Stacks are a type of list where insertions and deletions happen at one end.
Lists are a sequence of data items and can use either arrays or linked lists for implementation.

Parameter Passing

Parameters in function calls are typically passed using the stack.
A sequence of push operations in a stack follows the Last In, First Out (LIFO) principle.
The maximum depth of recursive calls a function can make is not fixed and depends on factors like program complexity and available memory.

Linked Lists

The next item in a linked list is referred to as the node.
In a linked list, elements don't have to be contiguous in memory.
In a linked list, each element contains a pointer to the next element.
Unlike linked lists, array elements are contiguous in memory.

Postfix Expressions

Each operator in a postfix expression refers to the preceding two operands.
Call by value is a calling method where a copy of the argument is passed, preserving the original value in the calling function.

Binary Search Trees (BST)

Each level in a binary search tree should have at least one node.
arrays cannot be resized after creation; their size remains fixed.
Searching for an element in an AVL tree takes at most log2(n+1) time.

AVL Trees

AVL trees can have four cases for rotation.
The statements about binary trees regarding nodes at a specific level are not entirely correct.

Infix to Postfix Conversion

The postfix conversion of 5 + 6/2 is 562/+
Trees are non-linear data structures.
The "+" operator is a binary operator.
Incrementing a stack pointer by 2 bits or bytes is not relevant to stack operations.
Non-recursive calls are usually faster than recursive calls.

General Data Structure Properties

An AVL tree is a self-balancing binary search tree and its depth can be determined in log2(n+1)-1 time (where n is number of nodes).
BST is a non-linear data structure.

Stack Operations

Each node in a BST has two pointers.
The highest operator precedence is of exponentiation operator.
Stacks and queues are both linear data structures.
The last node in singly linked list, which points to null, is known as the last node.
The postfix notation of A + B * C - D is ABC+*D-.
Infix notation refers to an operator placed between two operands.
Each operator in a postfix expression refers to the preceding two operands.
A valid postfix expression requires a specific order and structure.
Tree data structure is a non-linear data structure.
A compound data structure is a data structure that can hold multiple data items of similar or different types.
When a pointer is declared in main but no address is assigned it points to NULL.
The operation to remove an entry from a stack is traditionally called pop.
In function calls, parameters are typically passed using the stack.
Stacks follow the LIFO principle where the last inserted element is removed first.
The depth of recursive calls can be unlimited (and is bounded by the available memory).

Data Structures and Their Properties

Queue: A queue where the de-queue operation does not depend on FIFO (First-In, First-Out) is called a priority queue.
Tree: A tree data structure is a non-linear data structure.
Compound Data Structure: A compound data structure can hold multiple data items of the same or different types.
- Examples of compound data structures include arrays, linked lists, and binary search trees.
Pointer: If a pointer is declared but not assigned a variable address, it contains a NULL value.
Class Declaration: When a const reference is used in a class function, it ensures that the function does not alter the actual argument while allowing the function to access the parameter.
Stack: The operation for removing an entry from a stack is called pop.
Lists: Lists can be implemented using either arrays or linked lists.
Call-by-Value: When using call-by-value, a copy of the object is passed to the called function.
Parameter Passing: Parameters in function calls are passed using a stack.
Recursive Calls: There is no fixed maximum depth of recursive calls a function may make.
Linked List: In a singly linked list, each entry that points to a null value is known as the last node.
Binary Tree: A complete binary tree of depth d contains 2^L nodes at each level L between 0 and d, both inclusive.
Postfix Expressions: In a postfix expression, each operator refers to the previous two operands.
AVL Tree: AVL trees are non-linear data structures.

Algorithms and Operations

Search Operation: The maximum steps required for a search operation in a complete binary tree with n nodes is log2(n+1) - 1.
Insertion: Single rotation can fix the balance in an AVL tree in the cases of left-left or right-right.
AVL Tree Access: Elements in an AVL tree can be accessed in both linear and non-linear ways.
Deleting a Parent Node: Deleting a parent node with two children in a straight line in an AVL tree requires double rotations.

Data Structures and Their Implementations

Stack: In the linked list implementation of a stack, the push member function places the new entry at the head of the list.
Queue: In the circular array implementation of a queue, the push member function places the new entry at the data location.
Arrays: Arrays in C++ allow you to neither increase nor decrease their size after creation.
Binary Search Tree: In a binary search tree, each node has two pointers.

Miscellaneous Concepts

Operators: The operator "+" is a binary operator.
Non-Recursive Calls: Non-recursive calls are generally faster than recursive calls.
Infix Expression: An operator placed between two operands signifies an infix expression.
Pointer Increment: Adding a new item to a stack causes the pointer to increment by 2 bytes.
Linked List: the next item in a linked list is known as a node.

Data Structures MCQs

A queue where the de-queue operation does not depend on FIFO is called a priority queue.
A priority queue prioritizes the order of elements based on their value.
A priority queue can be implemented using heap data structures.
Call by value passes a copy of the object to the called function, changes made to the copy do not affect the original object.
Tree data structures are non-linear data structures, meaning they have a hierarchical structure instead of a sequential one.
A constant reference parameter is used when the parameter has a large size and the function does not need to modify the actual argument.
Private member variables of an object can only be altered by member functions within the same class.
The maximum depth of recursive calls a function may make is not fixed.
The maximum steps required for a search operation in a complete binary tree is Log2(n+1) - 1, where n is the number of nodes.
The push member function in a linked list implementation of a stack places the new entry at the head of the linked list.
In a circular array implementation of a queue with 10 items stored at data through data and CAPACITY is 42, the push member function places the new entry at data.
An expression with the format operand1 operand2 operator is called an infix expression.
A binary search tree is a binary tree where every node's left subtree contains values less than or equal to the node's value, and every node's right subtree contains values greater than or equal to the node's value.
If the node A in a BST is deleted, the candidate nodes to take its place are H and E.
Single rotation can fix the balance in an AVL tree for cases of left-left or right-right.
AVL Tree is a non-linear data structure.
A valid postfix expression follows the format: operand1 operand2 operator.
A compound data structure can have multiple data items of different types.
An uninitialized pointer in a C++ program points to a NULL value.
The operation for removing an entry from a stack is traditionally called pop.
A stack is a special kind of list in which insertions and deletions occur at one end.
Parameters in function calls can be passed using the call-by-value method, call-by-reference, or call-by-address.
The order of elements in the stack after a sequence of push operations is the order in which the elements were pushed.
The maximum depth of recursive calls a function may make is not fixed.
A linked list is a sequence of data items, while each element can be scattered in memory but still points to the next element.
Arrays have contiguous elements in memory, meaning they are stored next to each other.
Each operator in a postfix expression refers to the previous two operands.
Call by value passes a copy of the argument to the function, so the original argument is not modified.
Each level in a binary search tree should have at least one node.
An AVL tree is a self-balancing binary search tree, which means that the tree undergoes rotations to maintain a balanced structure.
The size of an array cannot be increased or decreased after its creation.
Each node in a BST has two pointers, one for the left child and one for the right child.
The highest operator precedence is for exponentiation, followed by multiplication and division, and then addition and subtraction.
Stacks and Queues are examples of linear data structures.
Each entry which points to a null value in a singly linked list is known as the last node.
Non-recursive calls can be faster than recursive calls due to the overhead associated with function calls in recursion.
Each node in a tree data structure has a parent node, except for the root node which has no parent.
When an operator is used between two operands, this is called infix notation.
A tree data structure is a non-linear data structure.
The valid postfix notation of A + B * C - D is ABC*+D-.

Data Structures: Solved MCQs

A queue where the de-queue operation does not follow FIFO is called a priority queue.
We should use better algorithms to solve problems with data size greater than hard disk capacity.
A valid call to the function "int X(int& Value) { return Value; }" is "a = X(&b);".
In call by value, a copy of the object is passed to the called function.
A tree data structure is a non-linear data structure.
A const reference parameter should be used when the parameter is large and the function does not modify the parameter within its body.
Only the member function "x" can alter the private member variables of the foo object that activates the function.
There is no fixed maximum depth for recursive calls a function can make.
The maximum steps for a search operation in a complete Binary Tree with n nodes is Log2(n+1) - 1.
In the linked list implementation of the stack class, the push member function places the new entry at the head.
The push member function places the new entry in the circular array implementation of the queue class at the "data" index, when there are 10 items stored in the queue and CAPACITY is 42.
The expression "AB+C*" is called an Infix expression.
A binary search tree where all nodes have a value, the left subtree has values less than or equal to the node's value and the right subtree has values greater than or equal is a Binary Search Tree.
After deletion of node A in a BST, the candidates to take its place are D and E.
A single rotation can fix the balance in the cases of left-left or right-right for insertions in an AVL tree.
Elements in an AVL Tree can be accessed in both linear and non-linear ways.
AVL Trees are non-linear data structures.
ab+cd- is a valid postfix expression.
Arrays, LinkedLists and Binary Search Trees are compound data structures.
If a pointer is declared in main but not assigned a variable address, it contains a NULL value.
Only the member function "x" can alter the private member variables of the foo object that activates the function.
The operation for removing an entry from a stack is traditionally called pop.
There are no restrictions on the ease of implementing stacks compared to lists.
Parameters in function calls are passed using a Stack.
The sequence of push operations "stack.push('7'); stack.push('8'); stack.push('9'); stack.push('10'); stack.push('11'); stack.push('12');" will result in the following order in the stack: 7 8 9 10 11 12
The maximum depth of recursive calls a function may make is "There is no fixed maximum".
In a linked list, the elements are not necessarily contiguous, they may be located at far positions in memory, and each element has the address of the element next to it.
The elements in an array are contiguous.
Each operator in a postfix expression refers to the previous two operands.
Call by passing the value of the argument does not change the original value of the argument in the calling function.
A binary search tree should have a minimum of one node at each level.
Arrays can neither increase nor decrease the array size after their creation.
Searching for an element in an AVL tree takes a maximum of 1.44 Log2(n) time.
There are 4 cases for rotation in an AVL tree.
The correct statements regarding binary trees are: (ii), (iii) and (iv) only.
The resultant postfix expression for the infix expression 5 + 6/2 is 562/+.
A tree is a non-linear data structure.
"+" is a binary operator.
Addition of new items in a stack makes the pointer increment by 2 bytes.
The next item in a linked list is known as a node.
The postfix notation of 5 + 6 / 2 is 562/+.
To delete a parent with two children in a straight line in an AVL tree, a double rotation will be required.
To check the depth of an AVL tree, Log2(n + 1) - 1 time will be taken.
BST is a non-linear structure.
After the creation of an array, the size can neither be increased nor decreased.
Each node in a BST has two pointers.
The highest operator precedence is of the exponentiation operator.
Stacks and Queues are both linear data structures.
Each entry which points to a null value in a singly linked list is known as the Last Node.
Non-recursive calls are faster than recursive calls.
A tree data structure is non-linear.
The valid postfix notation of A + B * C - D is ABC*+D-.
When an operator is used between two operands, this is infix notation.
ab+cd- is a valid postfix expression.
The tree data structure is a non-linear data structure.
Arrays, LinkedLists and Binary Search Trees are compound data structures.
If a pointer is declared in main but not assigned a variable address, it contains a NULL value.
Only the member function "x" can alter the private member variable of the foo object that activates the function.
The operation for removing an entry from a stack is traditionally called pop.
There are no restrictions on the ease of implementing stacks compared to lists.
Parameters in function calls are passed using a Stack.
The sequence of push operations "stack.push('7'); stack.push('8'); stack.push('9'); stack.push('10'); stack.push('11'); stack.push('12');" will result in the following order in the stack: 7 8 9 10 11 12.
The maximum depth of recursive calls a function may make is "There is no fixed maximum".

Studying That Suits You

Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

Description

Test your knowledge on key data structures concepts such as priority queues, trees, and linked lists. This quiz covers important fundamentals and operations in data structures that are crucial for efficient programming. Challenge your understanding of recursion, memory usage, and const references in data management.