WorksheetsDSA-Quiz-1
Total questions: 40
Worksheet time: 23mins
Explain the difference between O(n) and O(log n) complexity.
O(n) is linear complexity, while O(log n) is logarithmic complexity.
O(n) is faster than O(log n) for large inputs.
O(n) is logarithmic complexity, while O(log n) is quadratic complexity.
O(n) is constant complexity, while O(log n) is exponential complexity.
What are the main operations of a stack?
Insert, Delete, View, Check
Enqueue, Dequeue, Top, Size
Push, Pop, Peek, IsEmpty
Add, Remove, Display, Clear
How can a stack be used to reverse a string?
Use a stack to push characters of the string and then pop them to form the reversed string.
Replace each character in the string with its ASCII value to reverse it.
Use a queue to enqueue characters and then dequeue them to reverse the string.
Reverse the string by sorting its characters alphabetically.
Describe a real-world application of a queue.
A list of items in a shopping cart.
A stack used for managing browser history.
Customer service systems, such as banks or call centers, where customers are served in the order they arrive.
A database for storing customer information.
List the different methods for traversing a binary tree.
Binary search
Depth-first search
Pre-order, In-order, Post-order
Breadth-first search
What is the role of the stack in the infix to postfix conversion?
The stack is used to evaluate the postfix expression immediately.
The stack holds operators and parentheses to ensure correct order of operations in postfix notation.
The stack stores the final postfix expression directly.
The stack manages memory allocation for the conversion process.
What is the result of the postfix expression: 3 4 + 2 * 7 / ?
1
3
2
4
How do you find the height of a binary tree?
The height of a binary tree is the number of edges on the longest path from the root to a leaf.
The height is the depth of the deepest node from the root.
The height is the number of leaves in the tree.
The height is the total number of nodes in the tree.
What is the significance of the post-order traversal in a binary tree?
It is used to delete the tree.
It retrieves nodes in ascending order.
It visits all nodes in a left-right-root order.
It processes the root node before its children.
What is the result of the postfix expression: 8 2 5 * 7 + - ?
4
6
1
3
What is the primary difference between a stack and a queue?
Both follow the same order of operations.
A stack follows LIFO order, while a queue follows FIFO order.
A stack can only store numbers, while a queue can store any data type.
A stack follows FIFO order, while a queue follows LIFO order.
What is the main characteristic of a priority queue?
It is implemented using a linked list.
It only allows unique elements.
Elements are processed based on their priority.
Elements are processed in the order they are added.
It is a method of solving problems that involves breaking a problem down into smaller and smaller sub problems until you get to a small enough problem that it can be solved trivially.
Recursion
Iteration
Looping
What is a data structure?
A method of arranging data
A way of keeping data without an order?
A "stack" only
There is no formal definition for "Data Structure"
Which of these data structures is FIFO?
Stack
Queue
Binary Tree
Linked List
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Which of the following data structure is non linear type?
Stack
Queue
Tree
Liked list
In linked list each node is divided into ___________parts?
one
two
three
four
In stack insertion and deletion can take place only at one end call the ____________________ of the stack.
Path
Function
Top
Bottom
Algorithm is a __________________ procedure.
shortcut
function
reverse
step by step
In which algorithm takes less time or space is called
Best case
Worst case
Average case
None of the above
The number of edges from the node to the deepest leaf is called ___ of the tree.
Height
Depth
Length
Width
What is a full binary tree?
Each node has exactly zero or two children
Each node has exactly two children
All the leaves are at the same level
Each node has exactly one or two children
What is a complete binary tree?
Each node has exactly zero or two children
A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left
A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
A tree In which all nodes have degree 2
How many number of fields in each node of a doubly linked list is ____
A. 2
B. 3
C. 4
D. 5
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A. Input restricted dequeue
B. Output restricted dequeue
C. Circular queue
D. Priority queue
The operation of visiting each element in the list is known as ……
A. Sorting
B. Traversing
C. Merging
D. Inserting
What is the time complexity of following code:
int a = 0;
for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}
O(N)
O(N*log(N))
O(N * Sqrt(N))
O(N*N)
What is the time complexity of this algorithm?
O(n)
O(2n)
O(log n)
O(n2)
O(1)
Define time complexity and space complexity.
Time complexity is the time taken by an algorithm, while space complexity is the memory used by an algorithm.
Time complexity is the amount of data processed by an algorithm.
Space complexity refers to the number of lines in an algorithm.
Time complexity measures the speed of a computer.
What is infix notation?
Operators are placed before the operands.
Operators are placed after the operands.
Operators are placed randomly.
Operators are placed between the operands.
What happens when a closing parenthesis is encountered during conversion?
Pop operators until an opening parenthesis is found.
Add the closing parenthesis to the postfix expression.
Push the closing parenthesis onto the stack.
Ignore the closing parenthesis.
Which of the following is an example for a postfix expression?
a*b(c+d)
abc*+de-+
+ab
a+b-c
The prefix form of an infix expression (p + q) – (r * t) is?
a) + pq – *rt
b) – +pqr * t
c) – +pq * rt
d) – + * pqrt
Find the postfix expression for: A+B+C+D+E
AB+C+D+E+
AB+C+D++E
ABC++D+E+
AB+C+D+E++
The type of expression in which operator succeeds its operands is?
a) Infix Expression
b) Prefix Expression
c) Postfix Expression
d) Both Prefix and Postfix Expressions
A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
Rear = MAX_SIZE - 1
Front = (rear + 1)mod MAX_SIZE
Front = rear + 1
Rear = front
In a stack, if a user tries to remove an element from an empty stack it is called _________
Underflow
Empty collection
Overflow
Garbage Collection
Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, the no of element present on stack are
1
2
3
4
