# Data Structure Multiple Choice Questions and Answers

2
5265

In this article we have provided 22317 Data Structure Multiple Choice Questions and Answers with this data structure mcq pdf you will get a rough idea about Msbte I scheme paper pattern, with the help of data structure mcq with answers pdf download we have also provided msbte I scheme 22317 Previous Year answer paper.

with this 22317 Data Structure using C Mcq Questions Students will get to know what exactly you have to write in the msbte final exams. In Below Provided Mcq Question Bank Candidates will get answers solved by msbte board so the answers in msbte I scheme model answer paper is 100% accurate.

This is a Data Structure Online Mcq Exam of 30 Questions apparently choosen from last 2 years papers. This data structure using c mcq pdf will help you understand the basic rules of Online Mcq Exam and paper pattern of Data structure Exam.

## Students Also Search For

Data Structure using C MCQ Questions ( View Here)

Data Structure using C MCQ Question Part 2 ( View Here)

## Data Structures Objective Questions and Answers Pdf

1) How can we describe an array in the best possible way?
A. The Array shows a hierarchical structure.
B. Arrays are immutable.
C. Container that stores the elements of similar types
D. The Array is not a data structure

### Wrong!

2) Which of the following is the correct way of declaring an array?
A. int javatpoint;
B. int javatpoint;
C. javatpoint{20};
D. array javatpoint;

### Wrong!

3) How can we initialize an array in C language?
A. int arr=(10, 20)
B. int arr(2)={10, 20}
C. int arr = {10, 20}
D. int arr(2) = (10, 20)

### Wrong!

4) Which of the following is the advantage of the array data structure?
A. Elements of mixed data types can be stored.
B. Easier to access the elements in an array
C. Index of the first element starts from 1.
D. Elements of an array cannot be sorted

### Wrong!

5) Which of the following highly uses the concept of an array?
A. Binary Search tree
B. Caching
C. Spatial locality
D. Scheduling of Processes

### Wrong!

6) Which of the following is the disadvantage of the array?
A. Stack and Queue data structures can be implemented through an array.
B. Index of the first element in an array can be negative
C. Wastage of memory if the elements inserted in an array are lesser than the allocated size
D. Elements can be accessed sequentially.

### Wrong!

8) Which one of the following is the size of int arr assuming that int is 4 bytes?
A. 9
B. 36
C. 35
D. None of the above

### Wrong!

9) Which one of the following is the process of inserting an element in the stack?
A. Insert
C. Push
D. None of the above

### Wrong!

10) When the user tries to delete the element from the empty stack then the condition is said to be a ____
A. Underflow
B. Garbage collection
C. Overflow
D. None of the above

### Wrong!

11) If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as___
A. Underflow
B. Garbage collection
C. Overflow
D. None of the above

### Wrong!

12) Which one of the following is not the application of the stack data structure
A. String reversal
B. Recursion
C. Backtracking
D. Asynchronous data transfer

### Wrong!

13) Which one of the following nodes is considered the top of the stack if the stack is implemented using the linked list?
A. First node
B. Second node
C. Last node
D. None of the above

### Wrong!

14) What would be the maximum value of the top that does not cause the overflow of the stack?
A. 8
B. 9
C. 11
D. 10

### Wrong!

15) State operations that can be performed on data structure
A. (a) Inserting:
B. (b) Deleting
C. (c) Searching
D. (d) Sorting
(e) all of the above

### Wrong!

16) Different types of trees?
A. AVL tree
B. Binary Tree
C. Binary Search Tree
D. all of the above

### Wrong!

17) Different types of graphs are?
A. Heaps
B. Directed graphs
C. Undirected graphs
D. Both (b) & (c)

### Wrong!

18) Enlist queue operation condition
A. Queue Empty
B. Queue Full
C. Queue moderate
D. Both (a) & (b)

### Wrong!

19) Applications of queue.
A. Used for CPU scheduling in multiprogramming and time sharing systems.
B. It is used as buffers on MP3 players
C. Handling of interrupts in real-time systems
D. Simulation
E. all of the above

### Wrong!

20) When a stack is full and push operation is performed to insert a new element, stack is said to be in overflow state
A. True
B. False

### Wrong!

21) When there is no element in a stack (stack empty) and pop operation is called then stack is said to underflow state
A. True
B. False

### Wrong!

22) Number of edges coming towards node is out-degree of node
A. True
B. False

### Wrong!

23) Number of edges going out from the node is the In-degree of the node.
A. True
B. False

### Wrong!

24) A directed graph is defined as the set of ordered pair of vertices and edges where each connected edge has not assigned a direction
A. True
B. False

### Wrong!

25) An undirected graph G is a graph in which each edge e is assigned a direction.
A. True
B. False

### Wrong!

26) Front end is used to insert an element from queue
A. True
B. False

### Wrong!

27) Rear end is used to delete an element in queue
A. True
B. False

### Wrong!

28) Tree is a special form of graph i.e. minimally connected graph and having only one path between any two vertices.
A. True
B. False

### Wrong!

29) In graph there can be more than one path i.e. graph can have unidirectional or bidirectional paths (edges) between nodes
A. True
B. False

### Wrong!

30) Tree is a special case of graph having no loops, no circuits and no self-loops
A. True
B. False

### Subscribe to see your results

22317 Data Structure Using ‘C’ 2nd

%%description%%
%%description%%