Font size
WorksheetsData Structures Quiz
Total questions: 44
Worksheet time: 33mins
What do you call a collection of items stored at contiguous memory locations?
Linked List
Linear List
Array
Data Structure
Which of the following are examples of Data Structures?
Linear List
Linked List
Stacks
Trees
Pseudocodes
A (a) is a linear data structure, in which elements are not stored at contiguous memory locations.
What does LIFO stand for?
Last In First Out
Least In Flow Out
Last In Flow Out
Last In First Object
What do you this data structure classification in which the elements are stored/accessed on a non-linear order such as trees and graphs.
trees
linear
non-linear
graphs
How do you call this special function that is used to map a given value with a particular key for faster access of elements?
merge
sorted array
hash
bubble
(a) are used to represent networks. The networks may include paths in a city or telephone network or circuit network.
In linked list, the elements are using (a) to linked the data item to the next address in memory location.
Queue is using the order called FIFO while stack follows the order of LIFO or (a) .
The data type keyword NOT supported in C Language is:
double
pointer
union
enum
What is the range of floating point number in C ?
1.7 e -38 to 1.7 e +38
3.4 e -38 to 3.4 e +38
1.7 e -308 to 1.7 e +308
3.4 e -308 to 3.4 e +308
Under which data structure category does the Stack fall?
Homogeneous
Built-in
Non linear
Linear
Which of these in NOT a linear data structure?
Tree
Stack
Array
Queue
The data structure which expands and shrinks as per demand is called:
Array
Dynamic
Linked list
Non-linear
The operation to arrange all elements in required order is called:
Search
Insertion
Sorting
Merging
The two major factors of data structure complexity are:
time and location
type and size
time and memory
type and space
Identify the correct statement:
Stack is FIFO and Queue is LIFO
Stack is LIFO and Queue is FIFO
Stack and Queue are both LIFO
Stack and Queue are both FIFO
State the meaning of "void" keyword:
No statement
No function
No program
No value
Example of linear data structure except
array
tree
queue
stack
Which of these data structures is LIFO?
Stack
Queue
Binary Tree
Double linked list
int nums[ ] =
{2, 3, 5, 8, 9, 11};
How would you access the fourth element in nums
nums[8]
nums[3]
nums(4)
nums(3)
It use pointer to link nodes.
Variable
Link List
Pointer
Trees
Act of adding values into a stack is called
Popping
Polling
Pushing
None
The worst case occurs in linear search algorithm when ______________________
Item is not in the array at all
Item is somewhere in the middle of the array
Item is the last element in the array or item is not there at all
Item is the last element in the array
Recognize the algorithm that does not divide the list.
Merge sort
Binary Search
Linear Search
Quick sort
How do we arrange data?
Sorting
Seach
Toggle
None
What is the complexity of Binary Search?
(a)
How do you search in O(1)?
(a)
