DS - Unit-2 Previous Questions

Syllabus

Queues: Introduction to Queues, Definition, Array Representation of Queues, Primitive operations of queue and its implementation;

Types of Queues: How to overcome the drawbacks of Linear Queue using Circular Queue, Representation of Circular Queues, Deques and Priority Queues.

Linked list: Introduction, Representation and implementation of operations (Insertion, Deletion and Search) of Singly, Doubly and Circular Linked Lists, Implementation of stack and queue using lists.

SEMESTER END EXAMINATIONS – JUNE 2024

Design a program to create Singly Linked List (SLL) of student data having the following the fields: Std_USN, Name, Marks and Total and display the same.

Write a program to perform insert and delete operations on Circular QUEUE.

Develop an algorithm to perform queue operation into a Circular Linked List.

Identify the limitations of linear queue? How can it be resolved by the circular queue?

Examine the advantages of double linked list over single linked list.

BACKLOG SUBJECT EXAMINATIONS – SEPTEMBER / OCTOBER 2023

Implement a singly linked list to store a polynomial equation.

Write C functions for the Insertion and Deletion of elements in a circular queue. For an array of size 4, show (diagrammatically) the representation of the queue for the conditions. i. Insert 3 elements ii. Delete 2 elements iii. Insert 3 elements iv. Delete 1 element.

Write an algorithm to insert a node in between any two nodes in an ordered linked list.

Assume there are two singly linked list L1 and L2. Write an algorithm to create a doubly linked list L3 by merging the even positions node from L1 and odd positions node from L2.

SEMESTER END EXAMINATIONS – MAY / JUNE 2023

Represent diagrammatically the following sequence of operations on an empty stack. Push (54); push (52); pop (); push (55); push (62); S=pop (); Represent diagrammatically the following sequence of operations on an empty queue. enqueue(21); enqueue(24);dequeue();enqueue(28);enqueue(32); Q=dequeue(); Find the value of S+Q.

Write a C Program to insert a node with a value X to the right of the node with the value Y in a SLL.

Write a C function to insert a node in a doubly linked list by position. Your program should take position as input from the user.

Explain the limitations of Linear Queue with an example. Also explain with the program how to overcome these limitations using Circular Queue.

Write a C functions to perform following operations on Circular Doubly Linked List. i. beginsert (); ii. lastinsert (); iii. begin_delete(); iv. last_delete(); v. display()

SUPPLEMENTARY SEMESTER EXAMINATIONS - NOVEMBER 2022

Develop routines to perform each of the following operation on a linear list: i. Delete every second element for a list ii. Return the number of elements in the list.

State the limitations of Linear Queue and explain how it will be resolved in Circular Queue. Explain the algorithms for Insertion and Deletion of elements in a circular queue.

Discuss the routines to simulate the operations of Queue using singly linked list.

What do you mean by priority queue? Discuss different types of priority queue.

Develop C routine to insert a node before a given key node in a doubly linked list.

SEMESTER END EXAMINATIONS – JUNE 2022

Write C functions for Insertion and Deletion of elements in a circular queue. For an array of size 3, show (diagrammatically) the representation of the queue for the conditions. i. Insert 3 elements ii. Delete 2 elements iii. Insert 3 elements iv. Delete 1 element.

Differentiate between doubly Linked List and singly Linked List. Write a C function to insert a node in a doubly linked list by position. Your program should take position as input from user.

What is Queue? List its types. Mention the limitations of Linear Queue. Also Explain the insert, delete and display operations on Queue with appropriate examples.

Develop a ‘C’ routine to insert a node before a given key node in a doubly linked list.

EXAMINATIONS SEPTEMBER /OCTOBER 2021

Write C functions for Insertion and Deletion of elements in a circular queue. For an array of size 4, show (diagrammatically) the representation of the queue for the conditions. i. Insert 3 elements ii. Delete 2 elements iii. Insert 3 elements iv. Delete 1 element.

Differentiate between doubly Linked List and singly Linked List. Also develop a ‘C’ routine to insert a node before a given key node in a doubly linked list.

What is Queue? List its types. Mention the limitations of Linear Queue. Also Explain the insert, delete and display operations on Queue with appropriate examples.

Write a C function to insert a node in a doubly linked list by position. Your program should take position as input from user.

SEMESTER END EXAMINATIONS – JULY / AUGUST 2021

Illustrate the creation and display operations on Singly Linked List (SLL) of Employee Data with the fields: Employee ID, Name, company name and Mobile number.

Develop a program to perform insert and delete operations on Deques.

Differentiate between doubly Linked List and singly Linked List. Develop an algorithm to perform stack operation into a circular single linked List.

Write a routines to simulate the operations of Queue using singly linked list.

EXAMINATIONS SEPTEMBER /OCTOBER 2020

Explain how queue data structure is useful in categorizing data with an algorithm.

Write an algorithm to search an item in a singly linked list. Explain the algorithm with example.

Write a C program to simulate the insert and delete operations of a Queue. Trace the program for the following sequence of operations for Queue of size 3. i. Insert 3 elements ii. Delete 2 elements iii. Insert 3 elements.

Write a C function to insert a node in a doubly linked list by position. Your program should take position as input from user.