Laboratory Sheet [20] Implementing various circular queue operations using Linked lists

DATA STRUCTURES LAB

Objective: Develop a C program for implementing insertion, deletion and display operations on a
Circular Queue using Linked lists

Requirements:

1. Personal Computer

2. Turbo C software

Task analysis:

A. Knowledge

1. Structure of C Program

2. Operations of Circular Queue

3. Basics of C Structures

4. Basics of node creation to form a circular linked list

5. Debugging

B. Skill

• Opening Text editor

• Creating new .C file
Usage of Turbo C • Compiling and Running the Program
Software
• Debugging a C Program
• Identifying inputs and outputs

 Declaring and initializing a node in a Linked list

 Accessing the Linked list elements
Manipulation
 Defining functions for insert, delete and display operations of
Activities Circular Queue
 Writing the Program
Laboratory Sheet [20] Implementing various circular queue operations using Linked lists

 Compiling the Program.

 Debugging and executing the program
Precise  Giving valid inputs
operations/Activities  Observing the output.
 Assessing of Actual program.

2. Teaching points

Teaching Point Suggested Time-15

Sl No min
1. Structure concept 2
2. Linked list concept 2
3. Pointers concept 2
4. Circular Queue concept 2
5. Insertion and Deletion operations on Circular Queue 2
6. Display of Circular Queue 1
7. Program logic 4

A. Procedural precautions:

 Ensure that each instruction is written as per syntax.

 Do not run program before saving.

 Make sure that the file is saved with .C extension.

3. Need and scope of experiment

 This exercise is essential to understand basic working of Circular Queue.

 The Circular Queue is used in many applications like Job scheduling algorithms, game
theory and priority circular Queues etc.,
 Laboratory Sheet [20] Implementing various circular queue operations using Linked lists
4. Planning and organization

Action Activity
Check for  Working condition of Computer
 Proper Turbo C software
 Read teaching points carefully.
For writing code

5. Scheme of evaluation

Category of skill Sub task Weightage with Total

competency level
individually (50)

A. Opening Text editor

A B C D E T
B. Creating new .C file
1 1 1 1 1 5
1. Handling of C C. Knowing how to Compile and Run
a C Program
Compiler and Text
Editor D. Knowing how to debug a C
Program
E. Identifying required inputs and
outputs

A. Writing pseudocode
B. Selecting suitable instructions
2. Manipulation A B C T
C. Writing C Program
Activities 4 5 6 15
 Laboratory Sheet [20] Implementing various circular queue operations using Linked lists

A. Compiling the Program. A B C D E T

B. Debugging and executing the
3.Precise program
operations/Activities 2 8 5 6 4 25
C. Giving valid inputs
D. Observing the output.
E. Assessing of Actual program.

A. Co Operation
B. Co-Ordination
4.Values C. Communication
5
D. Sharing
E. Leadership

Total 50

6. Assessment / viva questions (Indicative purpose)

1. How can you create a node in a linked list?

2. State the purpose of malloc ().

3. How to insert a node in a circular Queue using linked list?

4. How can you delete an element from the Circular Queue using linked list?

5. How can you display the elements in the Circular Queue using linked list?

6. Give applications of circular queues.