Scribd
Upload
9 views4 pages

2.10 Lab Sheet

This document provides instructions for a laboratory activity on developing a C program to perform operations on a singly circular linked list (SCLL). The objectives are to insert, delete, display, sort, find, and replace nodes in a SCLL. Requirements include a computer with 2GB RAM and 320GB HDD, a C compiler, and a text editor. The tasks involve gaining knowledge of C programming concepts and SCLL operations, and skills like creating and compiling a C program, debugging, and manipulating nodes in a linked list. Teaching points outline how to perform each SCLL operation, and procedural precautions are provided.

Uploaded by

chariprasad512
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
9 views4 pages

2.10 Lab Sheet

This document provides instructions for a laboratory activity on developing a C program to perform operations on a singly circular linked list (SCLL). The objectives are to insert, delete, display, sort, find, and replace nodes in a SCLL. Requirements include a computer with 2GB RAM and 320GB HDD, a C compiler, and a text editor. The tasks involve gaining knowledge of C programming concepts and SCLL operations, and skills like creating and compiling a C program, debugging, and manipulating nodes in a linked list. Teaching points outline how to perform each SCLL operation, and procedural precautions are provided.

Uploaded by

chariprasad512
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Laboratory Sheet Singly Circular Linked List

DATA STRUCTURES LAB

OBJECTIVE: Develop a C Program to perform insert, delete, display, sort, find and
replace operations on Singly Circular Linked List (SCLL).
MINIUM REQUIREMENTS:

1. Computer with 2GB RAM,320GB HDD

2. C Compiler

3. Text Editor

TASK ANALYSIS:

A. KNOWLEDGE

1. Structure of C Program

2. Function prototype

3. Execution of C program

4. Operations of singly circular linked list

B. SKILL

 Opening Text editor

 Creating new .C file


Handling of Text
editor and C  Compiling and executing a C Program
Compiler  Debugging a C Program
 Identifying required inputs and outputs

 Writing algorithm
 Selecting suitable instructions
 Writing C Program
Manipulation
Activities  Creating new node using structure

 Dynamically allocate memory to a node

 Create and add nodes to linked list


Laboratory Sheet Singly Circular Linked List

 Save the program with .C extension.


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

2. TEACHING POINTS

Sl. No Teaching Points Suggested Time-15 min


1. Create a node 2
2. Allocate memory to node 2
3. Insert nodes to Linked list 2
4. Delete nodes from Linked list 2
5. Displaying the list 2
6. Sorting of linked list 2
7. Find and replace the nodes 3

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.

 Press Alt+F9 to compile the program

 Press Ctrl+F9 to run the program


Laboratory Sheet Singly Circular Linked List

3. NEED AND SCOPE OF EXPERIMENT

 Implementation of a Queue
 Hash table implementation
 Dynamic memory allocation

4. PLANNING AND ORGANISATION

ACTION ACTIVITY

 Working condition of Computer and its requirements.


Check for
 Appropriate C compiler.

For writing code  Read teaching points carefully.

5. SCHEME OF EVALUATION

CATEGORY OF SUB TASK WEIGHTAGE WITH TOTAL


SKILL 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. Compiling and executing a C
Program
Compiler and Text
Editor D. Debugging a C Program
E. Identifying required inputs and
outputs
Laboratory Sheet Singly Circular Linked List

A. Writing pseudocode
A B C T
B. Selecting suitable instructions
2. Manipulation
C. Writing C Program 4 5 6 15
Activities

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


B. Debugging and executing the
3.Precise program 2 8 5 6 4 25
operations/Activities 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 to represent linked list

2. How will you traverse linked list in reverse order?

3. How the memory is allocated dynamically?

4. List a few applications of circular linked list?

5. How can you insert a node to the beginning of a singly circular linked list?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy