Computer Algorithms MCQs – Set 04 :: Computer Science Engineering

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 advantage of ________is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

(A) Lists
(B) Linked Lists
(C) Trees
(D) Queues

Answer: (B) Linked Lists

Q2. Which if the following is/are the levels of implementation of data structure

(A) Abstract level
(B) Application level
(C) Implementation level
(D) All of the above

Answer: (D) All of the above

Q3. _ level is where the model becomes compatible executable code

(A) Abstract level
(B) Application level
(C) Implementation level
(D) All of the above

Answer: (C) Implementation level

Q4. Herder node is used as sentinel in __

(A) Graphs
(B) Stacks
(C) Binary tree
(D) Queues

Answer: (C) Binary tree

Q5. The simplest type of data structure is __

(A) Multidimensional array
(B) Linear array
(C) Two dimensional array
(D) Three dimensional array

Answer: (B) Linear array

Q6. The way in which the data item or items are logically related defines __

(A) Storage structure
(B) Data structure
(C) Data relationship
(D) Data operation

Answer: (B) Data structure

Q7. State true or false.
(i) An empty tree is also a binary tree.

(ii) In strictly binary tree, the out-degree of every node is either 0 or 2.

(A) True, False
(B) False, True
(C) True, True
(D) False, False

Answer: (C) True, True

Q8. _ is not the component of data structure.

(A) Operations
(B) Storage Structures
(C) Algorithms
(D) None of above

Answer: (D) None of above

Q9. _ is very useful in situation when data have to stored and then retrieved in reverse order.

(A) Stack
(B) Queue
(C) List
(D) Link list

Answer: (B) Queue

Q10. State True or False.
(i) Binary search is used for searching in a sorted array.

(ii) The time complexity of binary search is O(logn).

(A) True, False
(B) False, True
(C) False, False
(D) True, True

Answer: (D) True, True

Q11. Which of the following is true about the characteristics of abstract data types?
(i) It exports a type

(ii) It exports a set of operations

(A) True, False
(B) False, True
(C) True, True
(D) False, False

Answer: (C) True, True

Q12. Which data structure allows deleting data elements from and inserting at rear?

(A) Stacks
(B) Queues
(C) Dequeues
(D) Binary search tree

Answer: (B) Queues

Q13. The use of pointers to refer elements of a data structure in which elements are logically adjacent is _.

(A) Pointers
(B) Linked allocation
(C) Stack
(D) Queue

Answer: (B) Linked allocation

Q14. Which of the following data structure can’t store the non-homogeneous data elements?

(A) Arrays
(B) Records
(C) Pointers
(D) Stacks

Answer: (A) Arrays

Q15. Which of the following data structure is linear type?

(A) Graph
(B) Trees
(C) Binary tree
(D) Stack

Answer: (D) Stack

Data Structures and Algorithms MCQ – All Set

Computer Science Degree Algorithms Exam Papers – Set 05
Computer Algorithms Questions & Answers – Set 04
Data Structures Multiple Choice Questions – Set 03
Computer Algorithms & Data Structures MCQ – Set 02
Data Structures and Algorithms Practice Tests – Set 01

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.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top