Are you guys looking for computer science MCQ Questions with Answers PDF Free Download as per computer science new exam pattern? You came to the right page. This may assist you to understand and check your knowledge about the Subjects. Students also can take a free test of the Multiple Choice Questions of computer science. Each question has four options followed by the right answer. These computer science MCQ Questions are selected supported by the newest exam pattern.
Q1. The property of binary tree is
(A) The first subset is called left subtree
(B) The second subtree is called right subtree
(C) The root cannot contain NULL
(D) The right subtree can be empty
Answer: (D) The right subtree can be empty
Q2. __ is not an operation performed on linear list
(i) Insertion (ii) Deletion (iii) Retrieval (iv) Traversal
(A) Only i, ii and iii
(B) Only i and ii
(C) All of the above
(D) None of the above
Answer: (D) None of the above
Q3. Any node is the path from the root to the node is called
(A) Successor node
(B) Ancestor node
(C) Internal node
(D) None of the above
Answer: (B) Ancestor node
Q4. Which of the following are the operations applicable a primitive data structures?
(A) Create
(B) Destroy
(C) Update
(D) All of the above
Answer: (D) All of the above
Q5. A __ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
(A) Queue linked list
(B) Stacks linked list
(C) Both of them
(D) Neither of them
Answer: (A) Queue linked list
Q6. Which of the following statement is false?
(A) Arrays are dense lists and static data structure
(B) Data elements in linked list need not be stored in adjacent space in memory
(C) Pointers store the next data element of a list
(D) Linked lists are collection of the nodes that contain information part and next pointer
Answer: (C) Pointers store the next data element of a list
Q7. State True of False.
(i) Network is a graph that has weights or costs associated with it.
(ii) An undirected graph which contains no cycles is called a forest.
(iii) A graph is said to be complete if there is no edge between every pair of vertices.(A) True, False, True
(B) True, True, False
(C) True, True, True
(D) False, True, True
Answer: (B) True, True, False
Q8. __ is not the operation that can be performed on queue.
(A) Insertion
(B) Deletion
(C) Retrieval
(D) Traversal
Answer: (D) Traversal
Q9. A data structure where elements can be added or removed at either end but not in the middle is called __
(A) Linked lists
(B) Stacks
(C) Queues
(D) Dequeue
Answer: (D) Dequeue
Q10. Which of the following data structure store the homogeneous data elements?
(A) Arrays
(B) Records
(C) Pointers
(D) Lists
Answer: (B) Records
Q11. Linear arrays are also called __
(A) Straight line array
(B) One-dimensional array
(C) Vertical array
(D) Horizontal array
Answer: (B) One-dimensional array
Q12. A directed graph is __ if there is a path from each vertex to every other vertex in the digraph.
(A) Weakly connected
(B) Strongly Connected
(C) Tightly Connected
(D) Linearly Connected
Answer: (B) Strongly Connected
Q13. Which of the following is not the part of ADT description?
(A) Data
(B) Operations
(C) Both of the above
(D) None of the above
Answer: (D) None of the above
Q14. Which of the following is not the internal sort?
(A) Insertion Sort
(B) Bubble Sort
(C) Merge Sort
(D) Heap Sort
Answer: (C) Merge Sort
Q15. A graph is said to be _ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 vertices of V2.
(A) Partite
(B) Bipartite
(C) Rooted
(D) Bisects
Answer: (B) Bipartite
Data Structures and Algorithms MCQ – All Set
We hope the given computer science Engineering on Data Structures and Algorithms MCQ Questions with Answers will definitely yield fruitful results. Hope you got enough ideas on the MCQs on Data Structures and Algorithms. If you have any queries related to computer science Engineering on Data Structures and Algorithms MCQs Multiple Choice Questions with Answers, drop your questions below and will get back to you as soon as possible.