In this page provide you Data Structure MCQs SET-2 , Which is very useful of Many Exam Like semester , ISRO, DRDO, Banking , Railway etc.
Data Structure
A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.
Q.22 Which of the following concepts make extensive use use of arrays?
ANSWER= (A) Spatial locality
Q.23 What is the order of a matrix?
ANSWER= (A) number of rows x number of columns
Q.24 Process of inserating an element in stack is called
ANSWER= (A) Push
Q.25 The data structure required to check whether an expression contains balanced parenthesis is ?
ANSWER= (A) Stack
Q.26 Which data structure is needed to convert infix notaion to postfix notation?
ANSWER= (c) Stack
Q.27 A linear collection of data elements where the linear node is given by means of pointer is called ?
ANSWER= (A) Linked List
Q.28 A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
ANSWER= (D) Queue
Q.29 Which of the following is false about a doubly linked list ?
ANSWER= (D) None of the mentioned
Q.30 What differentiates a circular linked list from normal linked list ?
ANSWER= (C) You may or may note have the next pointer point to null in a circular linked list
Q.31 What is the complexity of searching for a particular element in a singly linked list? ?
ANSWER= (A) O(n)
Q.32 Binary trees can have how many children ?
ANSWER= (C) 0 or 1 or 2
Q.33 What is the time complexity of pre-order traversal in the iterative fashion ?
ANSWER= (C) O(n)
Q.34 Which of the following is false about a binary search tree ?
ANSWER= (D) None of the mentioned
35 What is an external sorting algorithm?
ANSWER= (A)Algorithm that uses tape or disk during the sort
Explain:-
36 Quick sort can be categorized into which of the following?
ANSWER= (B)Divide and conquer
37 What is the number of edges present in a complete graph having n vertices?
ANSWER= (B) (n*(n-1))/2
38 A connected planer graph having 6 vertices 7 edge contains ——–regions.
ANSWER= (B) 3
39 Depth first search is equivaent to which of the traversal in the binary tree?
ANSWER= (A) pre-order traversal
Q.40 What would be the number of zero’s in the adjacency matrix of the give graph?
