stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Data Structures Flashcards | StudBud
Explore
/
Data Structures
Data Structures
23 terms
·
StudBud Administration
·
44 plays
Quiz for Event
Flashcards
23 cards
F
Practice quiz
P
Host live
L
Questions
23
Answers
1
A mathematical-model with a collection of operations defined on that model is called
Data Structure
Algorithm
Abstract Data Type
Primitive Data Type
2
The order of an algorithm that finds if a given boolean function of 'n' variable returns '1' is
Linear
Exponential
Logarithmic
Constant
3
Find the time Complexity
O(N^2 )
O(N log N)
O(N^3 )
O(N)
4
In a stack the command to access nth element from the top of the stack S will be
None of the above
S [Top-n]
S [Top-n-1]
S [Top+n]
5
The goal of hashing is to produce a search that takes
O(n2 ) time
O(1) time
O(log n ) time
O(n log n ) time
6
Which of the following is useful in traversing a given graph by breadth first search?
Set
Queue
Stack
List
7
A queue has configuration a,b,c,d. To get configuration d,c,b,a. One needs a minimum of
3 deletion and 2 additions
3 deletion and 3 additions
2 deletion and 3 additions
2 deletion and 2 additions
8
Which of the following algorithm design technique is used in the quick sort algorithm?
Greedy method
Backtracking
Divide and conquer
Dynamic programming
9
Best Data Structure for compression of the .jpeg and .mp3 file-formats
B Tree
Huffman Coding Tree
Binary Tree
Syntax Tree
10
What value does function mystery return when called with a value of 4?
24
1
4
0
11
What is the output of following fork() function :
Hello World!
Compile Time error
Hello World! Hello World!
None of These
12
A problem is solved by a time complexity. The best time complexity for the algorithm is
log log(n)
nlog(n)
log(n)
n
13
Arranging a pack of cards by picking one by one is an example of
Bubble Sort
Heap Sort
Insertion sort
Quick Sort
14
Best Data structure for storing an address book
Stack
Queues
Linked List
A Sorted Tree
15
Which of the below factors does not affect the efficiency of lookup operations in a hash table?
Size of elements stored in the hash table
Number of elements stored in the hash table
Number of buckets in the hash table
16
What is the minimum number of nodes that a binary tree can have?
One
Two
None
Zero
17
The time factor when determining the efficiency of algorithm is measured by
Counting the kilobytes of algorithm
Counting the number of statements
Counting microseconds
Counting the number of key operations
18
Which of the following data structure can't store the non-homogeneous data elements?
Records
Pointers
Stacks
Arrays
19
Which algorithm solves all pair shortest path problem
Dijkastra's algorithm
Bellman-Ford algorithm
Floyd-Warshall's algorithm
Prim's algorithm
20
Which sorting algorithn is faster :
O(n^2)
O(nlogn)
O(n^3)
O(n+k)
21
A variable P is called pointer if
P contains the address of an element
P points to the address of first element
P contain the element and the address of element
P can store only memory addresses
22
Which of the following abstract data types can be used to represent a many to many relation?
Tree
Plex
Queue
Graph
23
While deleting nodes from a binary heap, ---____node is replaced by the last leaf in the tree.
root
left leaf
cycle
right leaf
