Foxoyo
Hey..!!
Data Structure Abstract Data Types
Practice
MCQs
Quizzes
About
Leaderboard
Amazon Books
14
MCQs
0
Attempts
0 %
Accuracy
share
Filter by
Type here
Apply
What is the space complexity for deleting a linked list
Either O(1) or O(n)
O(n)
O(1)
O(logn)
What would be the asymptotic time complexity to find an element in the linked list
O(n)
none of the mentioned
O(n2)
O(1)
In linked list implementation of a queue, from where is the item deleted
At the head of link list
At the centre position in the link list
none of the mentioned
At the tail of the link list
What is not a disadvantage of priority scheduling in operating systems
none of the mentioned
A low priority process might have to wait indefinitely for the CPU
Interrupt handling
If the system crashes, the low priority systems may be lost permanently
What is the time complexity of inserting a node in a doubly linked list
O(logn)
O(nlogn)
O(1)
O(n)
Which of the following applications may use a stack
All of the mentioned
A parentheses balancing program.
Tracking of local variables at run time.
Compiler Syntax Analyzer.
Given pointer to a node X in a singly linkedlist.
Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list
Possible if X is not last node
Possible if X is not first node
Possible if size of linked list is even
Possible if size of linked list is odd
Which data structure is needed to convert infix notation to postfix notation
Queue
Stack
Tree
Branch
What does ‘stack overflow’ refer to
adding items to a full stack
removing items from an empty stack
accessing item from an undefined stack
index out of bounds exception
A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is
Queue
Circular queue
Priority queue
Dequeue
Which of the following array position will be occupied by a new element being pushed for a stack of size N elements
(capacity of stack > N)
S[0].
S[1].
S[N]
S[N-1].
Which of the following points is/are true about Linked List data structure when it is compared with array
Random access is not allowed in a typical implementation of Linked Lists
It is easy to insert and delete elements in Linked List
All of the mentioned
Arrays have better cache locality that can make them better in terms of performance
Which of the following is not an inherent application of stack
Reversing a string
Implementation of recursion
Evaluation of postfix expression
Job scheduling
What is the output of the following piece of code?public class array{ public static void main(String args[]) { int []arr = {1,2,3,4,5};System.
out.
println
(arr[5]); }}
InavlidInputException
5
4
ArrayIndexOutOfBoundsException
1
take a quick Quiz
Practice mcqs on Data Structure Abstract Data Types
Let's start
pick difficulty level
all
1
2
3
4
5
14
Mcqs
0
attempts
0
followers
Related Topics
Data Structure Abstract Data Types
Data Structure Arrays Types
Data Structure Types of Lists
C Data Types
Data Types
C Data Types Variables and Operators
DBMS Data Types
Hadoop MapReduce Types and Hadoop Cluster
Data Structure
Data Structure Dynamic Programming
Suggested Books