
DS Quiz
Quiz
•
Other
•
University
•
Practice Problem
•
Hard
Kabilan S
Used 1+ times
FREE Resource
Enhance your content in a minute
12 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
Which of the following is not a stable sorting algorithm in its typical implementation
Insertion sort
Merge sort
Quick sort
Bubble sort
2.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted(maximum 1 or two elements are misplaced).
Quick sort
Heap sort
Merge sort
Insertion sort
3.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
The average number of key comparisons done in a successful sequential search in a list of length n is
log n
(n-1)/2
n/2
(n+1)/2
4.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree for a skewed tree?
O(n) for all
O(log n)for all
O(log n)for search and insert, and O(n) for delete
O(log n)for search, and O(n)for insert and delete
5.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
Which searching technique takes O(1) time complexity for searching the data?
Binary search
Linear Search
AVL Tree Search
Hashing
6.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph?
Breadth first search
Depth first search
Prim's minimum spanning tree algorithm
Kruskal' minimum spanning tree algorithm
7.
MULTIPLE CHOICE QUESTION
30 sec • 2 pts
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?
{u,v} must be an edge in G, and u is a descendant of v in T
{u,v} must be an edge in G, and v is a descendant of u in T
If {u,v} is not an edge in G then u is a leaf in T
If {u,v} is not an edge in G then u and v must have the same parent in T
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?
Similar Resources on Wayground
12 questions
Alberta Natural Resources #2
Quiz
•
KG - University
15 questions
PDP
Quiz
•
University
15 questions
Do you know Radio Untar?
Quiz
•
University
16 questions
EXLP
Quiz
•
University
13 questions
Accounting 100
Quiz
•
University
10 questions
17 course French classical menu 01
Quiz
•
University
10 questions
e-Quiz (Day 4)
Quiz
•
University
14 questions
Brawl Stars
Quiz
•
KG - Professional Dev...
Popular Resources on Wayground
8 questions
2 Step Word Problems
Quiz
•
KG - University
20 questions
Comparing Fractions
Quiz
•
4th Grade
15 questions
Fractions on a Number Line
Quiz
•
3rd Grade
20 questions
Equivalent Fractions
Quiz
•
3rd Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
10 questions
Latin Bases claus(clois,clos, clud, clus) and ped
Quiz
•
6th - 8th Grade
22 questions
fractions
Quiz
•
3rd Grade
7 questions
The Story of Books
Quiz
•
6th - 8th Grade
Discover more resources for Other
8 questions
2 Step Word Problems
Quiz
•
KG - University
7 questions
Comparing Fractions
Interactive video
•
1st Grade - University
7 questions
Force and Motion
Interactive video
•
4th Grade - University
10 questions
14.2 Independent/Dependent Variables
Quiz
•
KG - University
18 questions
Great Lakes States
Quiz
•
KG - University
7 questions
DNA, Chromosomes, Genes, and Traits: An Intro to Heredity
Interactive video
•
11th Grade - University
7 questions
Reflexive Verbs in Spanish
Lesson
•
9th Grade - University
7 questions
Narrative Writing 1
Interactive video
•
4th Grade - University
