Subject Expert
Learn, Evaluate and Optimize
Home
Click to open
Learn
Help
Login
Sign Up
Learn
Computer Science
Object Oriented Software Engineering
OOSE Labs
Web Engineering
Database Systems
Database Systems Labs
Computer Programming
Software Quality
Operating Systems
Computer Networks
Software Engineering
Data Structures
Computer Organization
Object Oriented Programming
Software Construction
Compiler Construction
Android Development
Android Labs
Automata Theory
Essentials of Cyber Security
Cloud Computing
Numerical Computing
Digital Switching
Wireless Networks
Programming Fundamentals
Routing and Switching Principles
Human Computer Interaction
Discrete Structures
Machine Learning
Artificial Intelligence
Digital Image Processing
Test Me Subject
Design Patterns
Computer Basics
Technology Trends
Data Science
Software Engineering Principles
Assembly Language
Web Technologies
HTML
CSS
HTML5
AngularJS
Bootstrap
Git
E Marteking Tips
Flutter
Online Tools
UX Automation
Python
MVC
ReactJS
College Subjects
Biology 11
Biology 12
Physics 11
Physics 12
Mathematics 11
Mathematics 12
Chemistry 11
Chemistry 12
English 11 and 12
Accounting
Biology for ADA
Programming Languages
Javascript
PHP
C Sharp Language
Java
TypeScript
Programming Concepts
Dart
Puthon
Primary School
Inspiring Science Class 4
Inspiring Science Grade 1
Computer Made Friendly Class 4
Pick Me Up 2 Class 4
English Grammer Class 1
Mathematic for 5th Class
Computer Science for Class II
Mathematics Class 5
Mathematics Class 2
General Science Class 5
English Class 2
English Class 5
Mathematics Class 3
Mathematics for Grade 4 for Oxford
Professionals
Interview Tips
Tips
Emerging Trends in IT
High School
Computer Science Class 9
Computer Science Class 10
General Science Class 6
Mathematics Class 6
ISLAM
Quran Recitation
Islam Basics
Quran Tafseer
Courses
×
Computer Science
Web Technologies
College Subjects
Programming Languages
Primary School
Professionals
High School
ISLAM
Object Oriented Software Engineering
OOSE Labs
Web Engineering
Database Systems
Database Systems Labs
Computer Programming
Software Quality
Operating Systems
Computer Networks
Software Engineering
Data Structures
Computer Organization
Software Construction
Compiler Construction
Android Development
Android Labs
Automata Theory
Essentials of Cyber Security
Cloud Computing
Numerical Computing
Digital Switching
Wireless Networks
Programming Fundamentals
Routing and Switching Principles
Discrete Structures
Machine Learning
Artificial Intelligence
Digital Image Processing
Test Me Subject
Design Patterns
Computer Basics
Technology Trends
Data Science
Software Engineering Principles
Assembly Language
HTML
CSS
HTML5
AngularJS
Bootstrap
E Marteking Tips
Flutter
Online Tools
UX Automation
Python
ReactJS
Biology 11
Biology 12
Physics 11
Physics 12
Mathematics 12
Chemistry 11
Chemistry 12
English 11 and 12
Biology for ADA
Javascript
PHP
C Sharp Language
TypeScript
Programming Concepts
Dart
Inspiring Science Class 4
Inspiring Science Grade 1
Computer Made Friendly Class 4
Pick Me Up 2 Class 4
English Grammer Class 1
Computer Science for Class II
Mathematics Class 5
Mathematics Class 2
General Science Class 5
English Class 2
Mathematics Class 3
Mathematics for Grade 4 for Oxford
Interview Tips
Tips
Computer Science Class 9
Computer Science Class 10
Mathematics Class 6
Quran Recitation
Islam Basics
Home
Communicator
Tools
Profile Settings
Loading, please wait ...
Open its course -
Data Structures
Multiple Choice Questions for Algorithm and Data Structures
1
Kruskal’s algorithm is used for finding ________ of a graph.
Vector list
Cyclic complexity
Minimum Spanning Tree
Weighted sum
View Answer
2
In Hashing two keys may hash to the same slot. We call this situation
Parity
Bit loss
Collision
Double Hashing
View Answer
3
log base 10 of 100 ( or log(100) ) is
2
1
10
0
View Answer
4
When we have only an asymptotic upper bound, we use
Theta notation
Omega notation
O notation
Random numbers
View Answer
5
In AVL tree, for each node x, the heights of the left and right subtrees of x differ by at most .......
0
1
-1
2
View Answer
6
How many comparisons are required to sort an array of size 5 using counting sort?
5
2
4
0
View Answer
7
Which of the following sorting algorithms can sort without comparing the elements of an array?
Quicksort
Merge Sort
Counting Sort
Selection Sort
View Answer
8
The maximum number of elements that must be examined to complete a binary search in an array of 200 elements are .......
200
8
13
41
View Answer
9
Worst case running time of bubble sort is .....
O(log n)
O(n*n)
O(2n)
O(n)
View Answer
10
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
View Answer
11
Which of the following case does not exist in complexity theory
Best case
Worst case
Average case
Null case
View Answer
12
Two main measures for the efficiency of an algorithm are a.
Time and space
Complexity and capacity
Processor and memory
Data and space
View Answer
13
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated
View Answer
14
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
View Answer
15
The term "push" and "pop" is related to the
array
lists
stacks
all of above
View Answer
16
A data structure where elements can be added or removed at either end but not in the middle
Queues
Deque
Stacks
Linked lists
View Answer
17
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
View Answer
18
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
View Answer
19
Which data structure allows deleting data elements from front and inserting at rear?
Stacks
Queues
Deques
Binary search tree
View Answer
20
The in order traversal of tree will yield a sorted listing of elements of tree in
Binary trees
Binary search trees
Heaps
None of above
View Answer
21
An algorithm that calls itself directly or indirectly is known as
Sub algorithm
Recursion
Polish notation
Traversal algorithm
View Answer
22
Which of the following sorting algorithm is of divide-and-conquer type?
Bubble sort
Insertion sort
Quick sort
All of above
View Answer
23
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
ABFCDE
ADBFEC
ABDECF
ABDCEF
View Answer
24
To represent hierarchical relationship between elements, which data structure is suitable?
Deque
Priority
Tree
All of above
View Answer
25
A binary tree whose every node has either zero or two children is called
Complete binary tree
Binary search tree
Extended binary tree
None of above
View Answer
26
The depth of a complete binary tree is given by
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2n+1
View Answer
27
A connected graph T without any cycles is called
a tree graph
free tree
A tree
All of above
View Answer
28
In a graph if e=(u, v) means
u is adjacent to v but v is not adjacent to u
e begins at u and ends at v
u is processor and v is successor
both b and c
View Answer
29
If every node u in G is adjacent to every other node v in G, A graph is said to be
isolated
complete
finite
connected
View Answer
30
A Complete Binary tree has ________________ number of leaf nodes at level 5.
16
32
10
8
View Answer
31
In a Circular-Linked List "LastNode.next" is always________________.
Previous Node
New Node
First Node
Null
View Answer
32
10. In a Doubly-Linked List "LastNode.next" is always ________________.
First Node
Current Node
New Node
Null
View Answer
33
In a graph G if an edge e = [u,v], then u and v are called ________________.
Endpoints of edge e
Adjacent Vertices
Neighbor Vertices
All of the Above
View Answer
34
The primitive data structure are used to store ________ value(s)
Multiple
Group of
Single
None of the Above
View Answer
35
Two main measures for the efficiency of an algorithm are :
Complexity and Capacity
Time and Space
Data and Space
Capacity and Time
View Answer
36
ADT is called as Abstract because ________
It is completely independent data type
Implementation Details are hidden
It is a collection of different data types
All of the above
View Answer
37
Variable which can be accessed by all modules of the program is called as __________.
Static Variable
Global Variable
Local Variable
Protected Variable
View Answer
38
Mathematical Model that can have set of operations that can be performed on that model is called as _________.
Primitive Data Type
Composite Data Type
Abstract Data Type
All of the above
View Answer
39
Term Data Structure refers to _________ and interrelationship between them.
Object Oriented Programming
Organization of data element
Programming Language Statement
None of these
View Answer
About Us
Who we are
Privacy Policy
Terms of Use
Contact Us
support@subexpert.com
Write to Us
View Help
Subject Expert
Learn, Evaluate and Optimize
Products / Utilites
Attendance Mapper
Industry Liason Cell (ILC)
Smart Secretary
Follow Us
Facebook
Switch Display Mode
Enable Translation
© 2024 - Subject Expert