JNTU B.Tech II DATA STRUCTURES Previous Question Paper (March 2021 - R15)

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

Data structures are broadly classified into two categories:

• Linear Data Structures: Data elements are arranged in a sequential or linear order. Examples include Arrays, Linked Lists, Stacks, and Queues. These are used for applications like implementing function call stacks, task scheduling, and maintaining ordered lists.
• Non-Linear Data Structures: Data elements are arranged in a hierarchical or interconnected manner. Examples include Trees and Graphs. These are used for applications like file system organization, database indexing, and network routing algorithms.

To insert a node into a Singly Linked List, assume a node structure with data and a next pointer.

Algorithm: Insert at Beginning

1. Create a new node 'newNode'.
2. Set newNode.data = value.
3. Set newNode.next = head.
4. Set head = newNode.

Algorithm: Insert at End

1. Create a new node 'newNode'.
2. Set newNode.data = value and newNode.next = null.
3. If head is null, set head = newNode and return.
4. Initialize temp = head.
5. Traverse until temp.next is null: temp = temp.next.
6. Set temp.next = newNode.