Q1: Addition of new items in stack makes the pointer by 2:
(A) Increment, bits
(B) Increment, bytes
(C) Decrement, bits
(D) Decrement, bytes
Answer: (B) Increment, bytes
Q2: Next item in a linked list is known as:
(A) Index
(B) Item
(C) Node
(D) Child
Answer: (C) Node
Q3: What will be the postfix notation of 5 + 6 / 2?
(A) 56 + / 2
(B) 562 + /
(C) 562 / +
(D) 5 + 62 /
Answer: (C) 562 / +
Q4: In an AVL tree to delete a parent with two children in a straight line, following rotations will be required:
(A) Single
(B) Double
(C) Triple
(D) None
Answer: (A) Single
Q5: To check the depth of an AVL tree, the following time will be taken:
(A) 1.66 log₂ n
(B) 1.44 log₂ n
(C) log₂ (n + 1) – 1
(D) 1.66 log₂ n (n + 1)
Answer: (B) 1.44 log₂ n
Q6: BST is a _____ structure:
(A) Linear
(B) Non Linear
(C) Circular
(D) None of Above
Answer: (B) Non Linear
Q7: After creation of an array:
(A) Size can be increased but cannot be decreased
(B) Size can be decreased but cannot be increased
(C) Size can neither be increased nor decreased
(D) Size can be increased and can also be decreased
Answer: (C) Size can neither be increased nor decreased
Q8: Each node in a BST has _____ pointers:
(A) 1
(B) 2
(C) 3
(D) 4
Answer: (B) 2
Q9: Highest operator precedence is of the following operator:
(A) Plus (+)
(B) Minus (-)
(C) Multiply (*)
(D) Exponentiation (^)
Answer: (D) Exponentiation
Q10: Following are linear data structures:
(A) Stacks
(B) Queues
(C) Both A & B
(D) None of the above
Answer: (C) Both A & B
Q11: Each entry which points to a null value in a singly linked list is known as:
(A) Node
(B) First Node
(C) Last Node
(D) Head Node
Answer: (C) Last Node
Q12: Non-recursive calls are faster than recursive calls.
(A) True
(B) False
Answer: (A) True
Q13: Tree data structure is a:
(A) Linear
(B) Non Linear
(C) Circular
(D) None of Above
Answer: (B) Non Linear
Q14: What will be the valid postfix notation of A + B * C – D?
(A) ABC + * D –
(B) ABC * + D –
(C) ABCD + – *
(D) AB + D * C
Answer: (B) ABC * + D –
Q15: When an operator is used in between two operands, this is which type of notation?
(A) Prefix
(B) Postfix
(C) Infix
(D) None of the Above
Answer: (C) Infix
Q16: Give two uses of Queues (2 Marks)
Answer:
- Task scheduling in operating systems (e.g., printer queue)
- Buffer management (e.g., IO buffers, CPU scheduling)