Hey Guys Welcome to CSE Study247
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:-
- A) Depth-first order
- B) Breadth-first order
- C) Topological order
- D) Liner order
Q.42 Which of the following traversal techniques lists the nodes of binary search tree in ascending order? :-
- A) Post-order
- B) In-order
- C) Preorder
- D) None of the above
Q.43 Merge short uses:-
- A) Divide and conquer strategy
- B) Backtracking approach
- C) Heuristic search
- D) Greedy approach
Q.44 The goto statement transfers the control to:
- A) A variable
- B) A function
- C) A label
- D) An operator
Q.45 Which of the following known as a finite collection of homogeneous elements?
- A) Structure
- B) Array
- C) Union
- D) None
Q.46 ADT stands for
- A) Abstract Data Technique
- B) Abstract Data Type
- C) Attribute Data Technique
- D) Abstract Data Task
Q.47 The address of which of these nodes will contain the next pointer of the last node of a circular linked list
- A) First node
- B) Second node
- C) The node before the last node
- D) Cannot determined
Q.48 Removing an element from the stack is known as operation
- A) Push
- B) Pull
- C) Pop
- D) None
Q.49 The condition Top=N-1 indicates that (Where N represent size of stack)
- A) Stack is empty
- B) Stack is full
- C) Stack has only one element
- D) None
Q.51 Which data structure is used for implementing recursion
- A) Stack
- B) Queue
- C) Array
- D) List
Q.52 The data structure required for Breadth First Traversal on a graph is ?
- A) Stack
- B) Queue
- C) Array
- D) List
Q.53 What is the complexity of searching for a particular element in a singly linked list ?
- A) 0(n)
- B) 0(1)
- C) log(n)
- D) n Log n
Q.54 What is the worst case complexity of Quick Sort ?
- A) 0(n)
- B) 0(n2)
- C) 0(log n)
- D) None
Q.55 Any node is the path from the root to the node is called
- A) Ancestor node
- B) Successor node
- C) Internal node
- D) None
Q.56 Which of the following data structure store the homogeneous data elements?
- A) Pointers
- B) Arrays
- C) Records
- D) None
Q.57 Operations on a data structure may be ?
- A) Selection
- B) Destruction
- C) Creation
- D) All of these
Q.58 The property of binary tree is ?
- A) The right subtree can be empty
- B) The second subtree is called right subtree
- C) The first subset is called left subtree
- D) All of these
Q.59 A variable P is called pointer if
- A) P contains the address of an element in Data
- B) P contains the DATA and the address of Data
- C) P can store only memory address
- D) None
Q.60 Which data structure is used in breadth first search of a graph to hold nodes?
- A) Queue
- B) Stack
- C) Tree
- D) None
| 1. Official Telegram | Click Here |
| 2. Telegram For CSE MCQs | Click Here |
| 3. You Tube | Click Here |