Question : What is a Data Structure?
Solution :
Correct Answer : A way of organizing and storing data
Description -
Question : Which of the following is a linear data structure?
Solution :
Correct Answer : Array
Description -
Question : What is an Algorithm?
Solution :
Correct Answer : A finite sequence of instructions to solve a problem
Description -
Question : Which characteristic is NOT required for an algorithm?
Solution :
Correct Answer : Ambiguity
Description -
Question : What does a pointer store?
Solution :
Correct Answer : Address of a memory location
Description -
Question : Which symbol is used to declare a pointer in C?
Solution :
Correct Answer : *
Description -
Question : Which ADT follows LIFO order?
Solution :
Correct Answer : Stack
Description -
Question : Which ADT follows FIFO order?
Solution :
Correct Answer : Queue
Description -
Question : Which notation represents the upper bound of an algorithm?
Solution :
Correct Answer : O
Description -
Question : Which of the following is NOT a data structure?
Solution :
Correct Answer : Compiler
Description -
Question : What is the time complexity of accessing an element in an array?
Solution :
Correct Answer : O(1)
Description -
Question : Which asymptotic notation gives the lower bound?
Solution :
Correct Answer : Ω(n)
Description -
Question : Which asymptotic notation gives both upper and lower bounds?
Solution :
Correct Answer : Θ
Description -
Question : What will be the value of x?
int x = 10;
int *p = &x;
Solution :
Correct Answer : 10
Description -
Question : Which operator is used to obtain the address of a variable?
Solution :
Correct Answer : &
Description -
Question : Which operation is generally NOT part of Stack ADT?
Solution :
Correct Answer : Sort
Description -
Question : Which operation inserts an element into a Queue?
Solution :
Correct Answer : Enqueue
Description -
Question : Which operation removes an element from a Queue?
Solution :
Correct Answer : Dequeue
Description -
Question : What is the complexity of linear search in the worst case?
Solution :
Correct Answer : O(n)
Description -
Question : Which data structure uses pointers extensively?
Solution :
Correct Answer : Linked List
Description -
Question : If an algorithm has complexity O(n²), then for n=100, approximately how many operations may occur?
Solution :
Correct Answer : 10,000
Description -
Question : Which notation best describes the average-case complexity?
Solution :
Correct Answer : None specifically
Description -
Question : What is a dangling pointer?
Solution :
Correct Answer : Pointer pointing to deleted memory
Description -
Question : What is a NULL pointer?
Solution :
Correct Answer : Pointer that points no where
Description -
Question : Which of the following is an Abstract Data Type?
Solution :
Correct Answer : Stack
Description -
Question : ADT(Abstract Data Type) mainly specifies:
Solution :
Correct Answer : Operations and behavior
Description -
Question :
int x = 5;
int *p = &x;
*p = 20;
Value of x becomes:
Solution :
Correct Answer : 20
Description -
Question : Which complexity grows fastest?
Solution :
Correct Answer : O(n²)
Description -
Question : Which of the following is NOT an ADT (Abstract Data Type)?
Solution :
Correct Answer : RAM
Description -
Question : Why is asymptotic analysis important?
Solution :
Correct Answer : Evaluates algorithm growth independent of hardware
Description -