Hey Guys Welcome to CSE Study247
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.
❤️ TOP 500+ C Programming Question and Answer
Q.21 Which of the following concepts make extensive use of arrays?
- A) Binary tree
- B) Scheduling of processes
- C) Caching
- D) Spatial locality
Q.22 What is the order of a matrix?
- A) number of rows x number of columns
- B) number of columns x number of row
- C) number of rows x number of rows
- D) number of columns x number of columns
Q.23 Process of inserting an element in stack is called
- A) Push
- B) Create
- C) Evaluation
- D) Pop
Q.24 The data structure required to check whether an expression contains balanced parenthesis is?
- A) Stack
- B) Queue
- C) Array
- D) Tree
Q.25 Which data structure is needed to convert infix notation to postfix notation?
- A) Branch
- B) Queue
- C) Stack
- D) Tree
Q.26 A linear collection of data elements where the linear node is given by means of pointer is called?
- A) Linked List
- B) Node List
- C) Primitive list
- D) None of the mentioned
Q.27 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?
- A) Linked List
- B) Stack
- C) Tree
- D) Queue
Q.28 Which of the following is false about a doubly linked list?
- A) We can navigate in both the directions
- B) It require more space than a singly linked list
- C) The insertion and deletion of a node take a bit longer
- D) None of the mentioned
Q.29 What differentiates a circular linked list from normal linked list?
- A) You cannot have the next pointer point to null in a circular linked list
- B) It is faster to traverse the circular linked list
- C) You may or may not have the next pointer point to null in a circular linked list
- D) All of the mentioned
Q.30 What is the complexity of searching for a particular element in a singly linked list?
- A) O(n)
- B) O(1)
- C) log n
- D) n log n
Q.32 Binary trees can have how many children?
- A) 2
- B) Any number of children
- C) 0 or 1 or 2
- D) 0 or 1
Q.33 What is the time complexity of pre-order traversal in the iterative fashion?
- A) O(1)
- B) O(n)
- C) O(log n)
- D) O(n log n)
Q.34 Which of the following is false about a binary search tree?
- A) The left child is always lesser than its parent
- B) The right child is always greater than its parent
- C) The left and right subtree should also be binary search tree
- D) None of the mentioned
Q.35 What is an external sorting algorithm?
- A) Algorithm that uses tape or disk during the sort
- B) Algorithm that uses main memory during the sort
- C) Algorithm that involves swapping
- D) Algorithm that are considered in place
Q.36 Quick sort can be categorized into which of the following?
- A) Brute force technique
- B) Divide and conquer
- C) Greedy algorithm
- D) Dynamics programming
Q.37 What is the number of edges present in a complete graph having n vertices?
- A) (n*(n+1))/2
- B) (n*(n-1))/2
- C) n
- D) Information given is insufficient
Q.38 A connected planar graph having 6 vertices and 7 edges contains -------- regions.
- A) 15
- B) 3
- C) 1
- D) 11
Q.39 Depth first search is equivalent to which of the traversal in the binary tree?
- A) pre-order traversal
- B) post-order traversal
- C) level-order traversal
- D) in-order traversal