In this article we have provided 22317 Data Structure Mcq Questions & Answers with this 22317 Mcq on Data Structure you will get a rough idea about Msbte I scheme paper pattern, and with these data structure using c mcq pdf download we have also provided msbte I scheme 22317 model 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 Test series 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)

## 22317 Data Structure Mcq Questions & Answers

1) What is another name for the circular queue among the following options?
A. Square buffer
B. Rectangle buffer
C. Ring buffer
D. None of the above

### Wrong!

2) If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are inserted in a queue, what would be the order for the removal?
A. 1234
B. 4321
C. 3241
D. None of the above

### Wrong!

3) A list of elements in which enqueue operation takes place from one end, and dequeue operation takes place from one end is__
A. Binary tree
B. Stack
C. Queue

### Wrong!

4) Which of the following principles does Queue use?
A. LIFO principle
B. FIFO principle
C. Linear tree
D. Ordered array

### Wrong!

5) Which one of the following is not the type of the Queue?
A. Linear Queue
B. Circular Queue
C. Double ended Queue
D. Single ended Queue

### Wrong!

6) Which one of the following is the overflow condition if the linear queue is implemented using an array with a size MAX_SIZE?
A. rear = front
B. rear = front+1
C. rear=MAX_SIZE -1
D. rear = MAX_SIZE

### Wrong!

7) Which one of the following is the overflow condition if a circular queue is implemented using an array having size MAX?
A. rear= MAX-1
B. rear=MAX
C. front=(rear+1) mod max
D. None of the above

### Wrong!

8) The time complexity of enqueue operation in Queue is __
A. O(1)
B. O(n)
C. O(logn)
D. O(nlogn)

### Wrong!

9) Which of the following determines the need for the Circular Queue?
A. Avoid wastage of memory
B. Access the Queue using priority
C. Follows the FIFO principle
D. None of the above

### Wrong!

10) Which one of the following is the correct way to increment the rear end in a circular queue?
A. rear =rear+1
B. (rear+1) % max
C. (rear % max) + 1
D. None of the above

### Wrong!

11) Which operation does the above code perform?
A. Enqueue
B. Dequeue
C. Return the front element
D. Both b and c

### Wrong!

12) Which of the following data structures allows you to insert the elements from both the ends while deleting from only one end?
A. Input-restricted queue
B. Output-restricted queue
C. Priority queue
D. None of the above

### Wrong!

13) Application of Stack
A. In mobile devices for sending and receiving messages.
B. Recursion
C. Polish notation
D. Both (b) & (c)

### Wrong!

14) Application of Queue
A. In computer systems for organizing processes.
B. In mobile devices for sending and receiving messages.
C. Polish notation
D. Both (a) & (b)

### Wrong!

15) Example of Linear data structure
A. stack
B. queue
C. tree
D. Both (a) & (b)

### Wrong!

16) Example of Non-linear data structure
A. Queue
B. Tree
C. Graph
D. Both (b) & (c)

## State the following statements are True or False

17) A data structure in which all data elements are stored in a sequence is known as linear data structure.
A. True
B. False

### Wrong!

18) A data structure in which all data elements are not stored in a sequence is known as a non-linear data structure.
A. True
B. False

### Wrong!

19) In Linear data structure All elements are stored in non-contiguous memory locations inside memory.
A. True
B. False

### Wrong!

20) In Non-linear data structure All elements may stored in contiguous memory locations inside memory
A. True
B. False

### Wrong!

21) Indegree of node  is the number of edges coming towards a specified node i.e. number of edges that have that specified node as the head is known as indegree of a node.
A. True
B. False

### Wrong!

22) Outdegree of node is number of edged going out from a specified node i.e. number of edges that have that specified node as the tail is known as outdegree of a node
A. True
B. False

### Wrong!

23) Binary search is efficient for the Smaller array.
A. True
B. False

### Wrong!

24) Linear search is efficient for the larger array.
A. True
B. False

### Wrong!

25) Algorithm is a stepwise set of instructions written to perform a specific task
A. True
B. False

### Wrong!

26) A node without any child node is called as leaf node
A. True
B. False

### Wrong!

27) Stack is a data structure in which insertion and deletion operations are performed at the different ends.
A. True
B. False

### Wrong!

28) Queue is a data structure in which insertion and deletion operations are performed at the same ends.
A. True
B. False

### Wrong!

29) In stack an element inserted last is deleted first so it is called Last In First Out list.
A. True
B. False

### Wrong!

30) In Queue an element inserted first is deleted first so it is called First In First Out list.
A. True
B. False

### Subscribe to see your results

22317 Data Structure Using ‘C’ Mcq Test paper

%%description%%
%%description%%