stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Data Structures and Algorithms Theory- Pretest Flashcards | StudBud
Explore
/
Data Structures and Algorithms Theory- Pretest
Data Structures and Algorithms Theory- Pretest
10 terms
·
StudBud Administration
Imported from external platform
Flashcards
10 cards
F
Practice quiz
P
Host live
L
Questions
10
Answers
1
Quick sort uses which of the following algorithm to implement sorting?
greedy algorithm
dynamic programming
backtracking
divide and conquer
2
Which of the following is not a technique to avoid a collision?
Increasing hash table size
Make the hash function appear random
Use uniform hashing
Use the chaining method
3
What is the time complexity of the below program?
O(m)
O(n)
O(n*m)
O(n+m)
4
The number of edges from the node to the deepest leaf is called _________ of the tree.
Depth
Length
Width
Height
5
The term Push and Pop is related to _____________
Stack
None
Both
Queue
6
In a full binary tree if number of internal nodes is I, then number of leaves L are
L = 2*I
L = 2*I – 1
L = I – 1
L = I + 1
7
Which of the following ways can be used to represent a graph?
No way to represent
Adjacency List, Adjacency Matrix as well as Incidence Matrix
Adjacency List and Adjacency Matrix
Incidence Matrix
8
Graph G having v vertices and e edges. which is connected and has no cycles, which of the following statements is true?
v+1=e
v=e-1
v=e+1
v=e
9
A mathematical-model with a collection of operations defined on that model is called________________
Primitive Data Type
Abstract Data Tye
Algorithm
Data Structure
10
What is the postfix form of the expression D+(E*F)
DEF*+
EF*D+
DEF+*
EFD*+
