ADSA Quiz-1 (Algo and Time Complexity, Array) Sec-38

What is the primary purpose of an algorithm?

• To manage memory allocation

• To provide a solution to a problem

• To store data efficiently

• To visualize data

Which of the following is NOT a characteristic of an algorithm?

• Unambiguous

• Input

• Output

• Infinite steps

What does time complexity measure?

• The efficiency of data storage

• The number of steps in an algorithm

• The time required to run an algorithm

• The amount of memory used

Which notation is used to describe the upper bound of an algorithm's running time?

• Little-o notation

• Theta notation

• Omega notation

• Big-O notation

What is space complexity concerned with?

• The time taken to execute an algorithm

• The amount of memory required by an algorithm

• The number of operations performed

• The efficiency of data retrieval

In a singly linked list, what does each node contain?

• Only pointers

• Data and a pointer to the previous node

• Data and a pointer to the next node

• Only data

What is the main advantage of using linked lists over arrays?

• Faster access times

• Better memory locality

• Dynamic size

• Easier to implement

Which of the following is a disadvantage of linked lists?

• Faster access times

• More complex to manage

• Easier to implement

• Fixed size

What is the purpose of a header node in a linked list?

• To keep track of the list size

• To store the last element

• To point to the first element

• To store the total memory used

In a doubly linked list, what does each node contain?

• Data and a pointer to the last node

• Data and a pointer to the next node only

• Only data

• Data, a pointer to the next node, and a pointer to the previous node