Data Structures

What is the main advantage of using arrays?

• Faster execution speed

• Inefficient memory usage

• Limited size flexibility

• Efficient storage and retrieval of multiple elements of the same data type

Explain the concept of a stack and provide an example of its application.

• A stack is a data structure that follows the First In, Last Out (FILO) principle. An example of its application is the redo feature in text editors.

• A stack is a data structure that follows the First In, First Out (FIFO) principle. An example of its application is the undo feature in text editors.

• A stack is a data structure that follows the Last In, First Out (LIFO) principle. An example of its application is the undo feature in text editors.

• A stack is a data structure that follows the Last In, Last Out (LILO) principle. An example of its application is the save feature in text editors.

Differentiate between a stack and a queue.

• In a stack, elements are added and removed from the front, while in a queue, elements are added at the top and removed from the rear.

• In a stack, elements are added and removed from the same end (top), while in a queue, elements are added at the rear and removed from the front.

• Stacks and queues are the same data structure with different names.

• Stacks are used for first-in-first-out (FIFO) operations, while queues are used for last-in-first-out (LIFO) operations.

How does Dynamic Memory Allocation (DMA) work in programming?

• DMA allocates memory only at compile time

• DMA is not used in modern programming languages

• DMA works by allocating memory during program execution rather than at compile time, providing flexibility in memory usage.

• DMA restricts memory usage during program execution

What is the time complexity of accessing an element in an array?

• O(n)

• O(1)

• O(log n)

• O(n^2)

What is the purpose of a queue data structure?

• To store and manage elements in a First-In-First-Out (FIFO) manner.

• To store and manage elements in a Last-In-First-Out (LIFO) manner.

• To sort elements based on a priority value.

• To randomly access elements within the data structure.

How is memory allocated dynamically in C programming?

• By using functions like malloc, calloc, or realloc.

• By using functions like free or delete

• By using functions like new or delete[]

• By declaring static variables

What are the disadvantages of using arrays?

• Efficient insertion and deletion operations

• Unlimited size

• Wide range of data types supported

• Fixed size, inefficient insertion and deletion operations, lack of flexibility in data types

Discuss the concept of LIFO in relation to stacks.

• LIFO stands for Last In First Out in relation to stacks.

• LIFO in relation to stacks means the last element added to the stack is the first one to be removed.

• LIFO implies that elements in a stack are removed randomly.

• LIFO means the first element added to the stack is the first one to be removed.

What are the different types of queues?

• Stack Queue

• Linear Queue, Circular Queue, Priority Queue, Double-ended Queue (Deque)

• Random Queue

• Dynamic Queue