Algorithms Exam Papers – Set 05 :: 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. To represent hierarchical relationship between elements, which data structure is suitable?

(A) Deque
(B) Priority
(C) Tree
(D) Graph

Answer: (C) Tree

Q2. In a queue, the initial values of front pointer f rare pointer r should be and _ respectively.

(A) 0 and 1
(B) 0 and -1
(C) -1 and 0
(D) 1 and 0

Answer: (B) 0 and -1

Q3. In general, the binary search method needs no more than __ comparisons.

(A) [log2n] – 1
(B) [logn] + 1
(C) [log2n]
(D) [log2n] +1

Answer: (D) [log2n] +1

Q4. Which of the following is non-liner data structure?

(A) Stacks
(B) List
(C) Strings
(D) Trees

Answer: (D) Trees

Q5. In a circular queue, the value of r will be __

(A) r = r + 1
(B) r = (r + 1)% [QUEUE_SIZE – 1]
(C) r=( r + 1)% QUEUE_SIZE
(D) r=(r – 1)% QUEUE_SIZE

Answer: (C) r=( r + 1)% QUEUE_SIZE

Q6. In the _ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

(A) Depth First
(B) Breadth First
(C) With First
(D) Depth Limited

Answer: (A) Depth First

Q7. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called __

(A) Underflow
(B) Overflow
(C) Houseful
(D) Saturated

Answer: (B) Overflow

Q8. The number of comparisons done by sequential search is __

(A) (N/2)+1
(B) (N+1)/2
(C) (N-1)/2
(D) (N+2)/2

Answer: (B) (N+1)/2

Q9. Arrays are best data structures _

(A) For relatively permanent collections of data
(B) For the size of the structure and the data in the structure are constantly changing
(C) For both of above situation
(D) For none of the above

Answer: (A) For relatively permanent collections of data

Q10. _ 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

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