just give right option ..no deatils needed.

correct answer for 4 thumbs up

DSA

Note: To the point answers are required. Try to avoid extra details. Please write neatly Illexible answers will be assumed to be incorrect. Do not change the order of the questions in answer sheet. Q. No. 01: Choose the correct answer. (Points: 30) 1. A linear list in which each node has pointers to point to the predecessor and successors nodes is called a A) Singly Linked List C) Doubly Linked List B) Circular Linked List D) Linear Linked List 2. The disadvantage in using a circular linked list is A) It is possible to get into infinite loop. C) Time consuming B) Last node points to first node. D) Requires more memory space 3. The time complexity of Binary Search in aBSTis A) ON) C) O(LON) B) ON) D) None of the above 6. Which of the following statement is true? 1) Using singly linked lists and circular list, it is not possible to traverse the list backwards. 11) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list. A) i-only C) Both i and ii B) ii-only D) None of both 7. To represent hierarchical relationship between elements, which data structure is suitable? A) Dequeue C) Tree B) Priority D) Graph 8. A....... is a data structure that organizas data similar to a line in the supermarket, where the first one in line is the first one out? A) Queue linked list C) Both of them B) Stacks linked list D) Neither of them 9. Recursion is a method in which the solution of a problem depends on A) Larger instances of different problems C) Smaller instances of the same problem B) Lager instances of the same problem D) Smaller instances of different problems 10. Recursion is similar to which of the following? A) Switch Case C) If-else B) Loop D) if else if 11. Which of the following is true of stacks and queues? A) A stack is a last-in, first-out structure, and a queue is a first-in, first-out structure B) A stack is a first-in, first-out structure, and both structures are random access structures C) A stack is a last-in, first-out structure, and a queue is a random access structure. D) A queue is a last-in, first-out structure, and a stack is a first-in, first-out structure. E) A queue is a first-in, first-out structure, and a stack is a random access structure. 4. State true or false. i) An empty tree is also a binary tree. i) In strictly binary tree, the out-degree of every node is either 0 or 2. A) True False C) True True B) False, True D) False, False 5. State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True True B) True False C) False, True D) False, False