Explore topic-wise MCQs in Computer Science Engineering (CSE).

This section includes 139 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.

51.

Which of the following name does not relate to stacks?

A. fifo lists
B. lifo list
C. piles
D. push-down lists
Answer» B. lifo list
Discussion
52.

A data structure where elements can be added or removed at either end but not in the middle is called …

A. arrays
B. stacks
C. queues
D. deque
Answer» E.
Discussion
53.

The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

A. ab + cd∗e − fg /∗∗
B. / ab + cd ∗ e − f ∗∗g /
C. ab + cd ∗ e − ∗f ∗ g /
D. ab + cde ∗ − ∗ f ∗ g /
Answer» B. / ab + cd ∗ e − f ∗∗g /
Discussion
54.

What is the postfix form of the following prefix expression -A/B*C$DE ?

A. abcde$*/-
B. a-bcde$*/-
C. abc$ed*/-
D. a-bcde$*/
Answer» B. a-bcde$*/-
Discussion
55.

The data structure required to evaluate a postfix expression is

A. queue
B. stacks
C. array
D. linked-list
Answer» C. array
Discussion
56.

What is the postfix form of the following prefix: *+ab–cd

A. ab+cd–*
B. abc+*–
C. ab+*cd–
D. ab+*cd–
Answer» B. abc+*–
Discussion
57.

In stack terminology, the __________operations are known as push and pop operations respectively.

A. delete
B. insert
C. both (a) and (b)
D. none of the above
Answer» D. none of the above
Discussion
58.

A queue is a,

A. fifo (first in first out) list
B. lifo (last in first out) list
C. ordered array
D. linear tree
Answer» B. lifo (last in first out) list
Discussion
59.

A common example of a queue is people waiting in line at a__________.

A. bus stop
B. movie hall
C. shopping mall
D. none of the above
Answer» B. movie hall
Discussion
60.

What is one of the common examples of a stack?

A. a pile of books
B. bus stop
C. a basket of fruits
D. a carat of eggs
Answer» B. bus stop
Discussion
61.

What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

A. overflow
B. underflow
C. top
D. none of the above
Answer» B. underflow
Discussion
62.

The total number of elements in a stack at a given point of time can be calculated from the value of______.

A. overflow
B. top
C. queues
D. underflow
Answer» C. queues
Discussion
63.

When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

A. -1
B. 0
C. 1
D. x
Answer» B. 0
Discussion
64.

When the push operation is performed on stack the value of TOS will be ______

A. decrement
B. increment
C. one
D. none of these
Answer» C. one
Discussion
65.

A double linked list contains reference to _____

A. previous node
B. next node
C. current node
D. both a & b
Answer» E.
Discussion
66.

Data Structure that are created by user as per their requirement are known as

A. primitive data structure
B. non-primitive data structure
C. both a & b
D. none of these
Answer» B. non-primitive data structure
Discussion
67.

To insert element at start, the previous pointer of newly added node would point to ______

A. null
B. next node
C. new node
D. head node
Answer» B. next node
Discussion
68.

In linked list implementation, a node carries information regarding

A. the data
B. the link
C. both a & b
D. none of these
Answer» D. none of these
Discussion
69.

Stack is ____ type of data structure.

A. lifo
B. fifo
C. both a & b
D. none of these
Answer» B. fifo
Discussion
70.

Queue is _____ type of data structure.

A. lifo
B. fifo
C. both a & b
D. none of these
Answer» C. both a & b
Discussion
71.

In stack deletion operation is referred as _____

A. push
B. pop
C. peek
D. none of these
Answer» C. peek
Discussion
72.

In ___ Data Structure data can be processed one by one sequentially

A. array
B. linked list
C. tree
D. none of these
Answer» C. tree
Discussion
73.

Data structre is divided into _____ parts.

A. 4
B. 3
C. 2
D. 1
Answer» D. 1
Discussion
74.

When we insert an element in Queue, which pointer is increased by one?

A. front
B. rear
C. both a & b
D. none of these
Answer» C. both a & b
Discussion
75.

Which of the following is a possible operation on queue?

A. push
B. pop
C. display
D. enqueue
Answer» E.
Discussion
76.

Which of the following is not the possible operation on stack?

A. push
B. pop
C. display
D. enqueue
Answer» E.
Discussion
77.

if there are no nodes in linked list then start pointer will point at which value?

A. null
B. garbage
C. 1
D. 2
Answer» B. garbage
Discussion
78.

Worst space complexity of queue data structure is

A. o(n)
B. o(log(n))
C. o(1)
D. n/a
Answer» B. o(log(n))
Discussion
79.

In stack, to display the lastly inserted element without removing it, which function is used?

A. push
B. pop
C. display
D. peek
Answer» E.
Discussion
80.

Worst space complexity of stack data structure is

A. o(log(n))
B. o(1)
C. n/a
D. o(n)
Answer» E.
Discussion
81.

Worst space complexity of singly linked list is

A. o(n)
B. o(1)
C. o(log(n))
D. n/a
Answer» B. o(1)
Discussion
82.

The elements of an array are stored successively in memory cells because

A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Answer» B. the architecture of computer memory does not allow arrays to store other than serially
Discussion
83.

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

A. push, pop
B. pop, push
C. insert, delete
D. delete, insert
Answer» B. pop, push
Discussion
84.

……………….. level is where the model becomes compatible executable code

A. abstract level
B. application level
C. implementation level
D. all of the above
Answer» D. all of the above
Discussion
85.

A list which displays the relationship of adjacency between elements is said to be

A. linear
B. non linear
C. linked list
D. trees
Answer» B. non linear
Discussion
86.

The data structure which is one ended is ………………

A. queue
B. stack
C. tree
D. graph
Answer» C. tree
Discussion
87.

Which of the following is an application of stack?

A. finding factorial
B. tower of hanoi
C. infix to postfix conversion
D. all of the above
Answer» C. infix to postfix conversion
Discussion
88.

The time complexity of quick sort is …………..

A. o(n)
B. o(n2)
C. o(n log n)
D. o(log n)
Answer» D. o(log n)
Discussion
89.

In a priority queue, insertion and deletion takes place at ………………

A. front, rear end
B. only at rear end
C. only at front end
D. any position
Answer» E.
Discussion
90.

A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue
B. random of queue
C. priority
D. dequeue
Answer» E.
Discussion
91.

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list
Answer» D. linear linked list
Discussion
92.

The disadvantage in using a circular linked list is …………………….

A. it is possible to get into infinite loop.
B. last node points to first node.
C. time consuming
D. requires more memory space
Answer» B. last node points to first node.
Discussion
93.

When does top value of the stack changes?

A. before deletion
B. while checking underflow
C. at the time of deletion
D. after deletion
Answer» E.
Discussion
94.

A …………………… does not keep track of address of every element in the list.

A. stack
B. string
C. linear array
D. queue
Answer» D. queue
Discussion
95.

Which of the following data structures are indexed structures?

A. linear arrays
B. linked lists
C. graphs
D. trees
Answer» B. linked lists
Discussion
96.

Each node in a linked list has two pairs of ………….. and ……………….

A. link field and information field
B. link field and avail field
C. avail field and information field
D. address field and link field
Answer» B. link field and avail field
Discussion
97.

Linear arrays are also called ……………….

A. straight line array
B. one-dimensional array
C. vertical array
D. horizontal array
Answer» C. vertical array
Discussion
98.

Arrays are best data structures …………

A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of the above
Answer» B. for the size of the structure and the data in the structure are constantly changing
Discussion
99.

The simplest type of data structure is ………………

A. multidimensional array
B. linear array
C. two dimensional array
D. three dimensional array
Answer» C. two dimensional array
Discussion
100.

The logical or mathematical model of a particular organization of data is called a ………

A. data structure
B. data arrangement
C. data configuration
D. data formation
Answer» B. data arrangement
Discussion