# Data Structures Multiple Choice Questions – Set 03 :: 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. In the _ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

(A) Depth First
(C) Width First
(D) Depth Limited

## Q2. When does top value of the stack changes?

(A) Before deletion
(B) While checking underflow
(C) At the time of deletion
(D) After deletion

(A) Array
(B) Tree
(C) Graphs
(D) Hierarchy

## Q4. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called __

(A) AVL tree
(B) Redblack tree
(C) Lemma tree
(D) None of the above

## Q5. Which of the following statement is true?(i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

``(ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.``

(A) i-only
(B) ii-only
(C) Both i and ii
(D) None of both

Answer: (C) Both i and ii

(A) Strings
(B) Lists
(C) Stacks
(D) Graph

## Q7. State true or false.(i) The degree of root node is always zero.

``(ii) Nodes that are not root and not leaf are called as internal nodes.``

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

(A) Stack
(B) Queue
(C) Tree
(D) Array

(A) Stack
(B) String
(C) Linear array
(D) Queue

## Q10. Each node in a linked list has two pairs of and

(A) Link field and information field
(B) Link field and avail field
(C) Avail field and information field

## Q11. _ is a pile in which items are added at one end and removed from the other.

(A) Stack
(B) Queue
(C) List
(D) None of the above

## Q12. Which of the following data structures are indexed structures?

(A) Linear arrays
(C) Queue
(D) Stack

## Q13. A graph is a collection of nodes, called And line segments called arcs or that connect pair of nodes.

(A) Vertices, edges
(B) Edges, vertices
(C) Vertices, paths
(D) Graph node, edges

## Q14. 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

## Q15. In _, search start at the beginning of the list and check every element in the list.

(A) Linear search
(B) Binary search
(C) Hash Search
(D) Binary Tree search