In this page provide you Data Structure Multiple choice question SET-3 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.41 Preorder is as same as:-
ANSWER= (A) Depth-first order
Q.42 Which of the following traversal techniques lists the nodes of binary search tree in ascending order? :-
ANSWER= (B)In-order
Q.43 Merge short uses:-
ANSWER= (A) Divide and conquer strategy
Q.44 The goto statement transfers the control to:
ANSWER= (C) A label
Q.45 Which of the following known as a finite collection of homogeneous elements?
ANSWER= (B) Array
Q.46 ADT stands for
ANSWER= (B) Abstract Data Type
Q.47 The address of which of these nodes will contain the next pointer of the last node of a circular linked list
ANSWER= (A) First node
Q.48 Removing an element from the stack is known as operation
ANSWER= (C) Pop
Q.49 The condition Top=N-1 indicates that (Where N represent size of stack)
ANSWER= (A) Stack is empty
Q.50 Assuming int is of 4 bytes, what is the size of int arr[15];
ANSWER= (B) 60
Q.51 Which data structure is used for implementing recursion
ANSWER= (A) Stack
Q.52 The data structure required for Breadth First Traversal on a graph is ?
ANSWER= (B) Queue
Q.53 What is the coplexity of searching for a particular element in a singly linked list ?
ANSWER= (B) 0(1)
Q.54 What is the worst case complexity of Quick Sort ?
ANSWER= (B) 0(n2)
Q.55 Any node is the path from the root to the node is called
ANSWER= (A) Ancestor node
Q.56 Which of the following data structure store the homogeneous data elements?
ANSWER= (C) Records
Q.57 Operations on a data structure may be ?
ANSWER= (D) All of these
Q.58 The property of binary tree is ?
ANSWER= (A) The right subtree can be empty
Q.59 A variable P is called pointer if
ANSWER= (A) P contains the address of an element in Data
Q.60 Which data structure is used in breadth first search of a graph to hold nodes?
