JNTU B.Tech III DATA STRUCTURES Previous Question Paper (August-2022 - R16)

An array is a collection of elements of the same data type stored in contiguous memory locations. Each element is identified by at least one array index or key. In memory, the address of any element can be calculated using the base address and the index:

Advantages:

• Provides constant time access (O(1)) to any element given its index.
• Efficient for storing fixed-size data sets.
• Better cache locality due to contiguous memory allocation.

Disadvantages:

• Fixed size: The capacity must be known at compile time, leading to potential memory wastage or overflow.
• Insertion and deletion are expensive (O(n)) as they require shifting elements to maintain contiguity.

A data structure is a specialized format for organizing, processing, retrieving, and storing data in a computer so that it can be accessed and modified efficiently. It defines the relationship between data and the operations that can be performed on them.

Data structures are broadly classified into two types:

1. Linear Data Structures: Elements are arranged in a sequential or linear order where each element is attached to its previous and next adjacent elements. Examples include Arrays, Linked Lists, Stacks, and Queues.
2. Non-Linear Data Structures: Elements are not arranged sequentially; they are organized in a hierarchical or interconnected manner. Data elements can be traversed in multiple ways. Examples include Trees (hierarchical) and Graphs (network-based).