CBSE Class 12 Computer Science Stacks Queues And Linked List Worksheet

STACKS, QUEUES AND LINKED LIST

Stack

In computer science, a stack is a Last in, First out (LIFO) data structure. It simply means that element that is inserted at the end will be deleted first. To Manage a stack all the insertion and deletion takes place from one position One of the common uses of stack is in function call.

Operations on the Stack

There are two fundamental operations

Push

Pop

Push means to insert an element

Pop means to delete an element

Queue

In computer science, a Queue is a First in, First out (FIFO) data structure. It simply means that an element that is inserted at the beginning will be deleted f deletion takes place from two different positions called “front” and “rear”. Every element is inserted from the rear position and deleted from the front position in the queue.

Linked List

A linked list is a data structure consisting of a group of Under the simplest form, each node is composed of a data and a the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.

Here in the figure is an example of a linked list whose nodes contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the l Linked lists are among the simplest and most common data structures. They can be used to implement several other common The principal benefit of a linked list over an removed without reallocation or reorganization of the entire structure because the data items be stored contiguously in memory or on disk. Linked lists allow insertion and removal of nodes at any point in the list, and can do so with a constant number of operations if the link previous to the link being added or removed is maintained during list traversal.

Linked list are dynamic structure where memory allocation takes place at run time.

Operation on a linked list

There are three basic operations on a linked list

Insertion

Deletion

Traversal

Inserting a node or element into Linked list :

Inserting an element into linked list contains 3 types .

1. Insertion at beginning of the Linked

2. Insertion after/before any element

3. Insertion at the end of the linked list

Please click the link below to download full pdf file for CBSE Class 12 Computer Science Stacks Queues and Linked List.