Scribd
Upload
340 views2 pages

Data Structures Lab Cycle Final-1

The document outlines the experiments for the Data Structures Lab course at Sree Chitra Thirunal College of Engineering, detailing evaluation criteria and deadlines for three cycles of experiments. Each cycle focuses on different data structures, including arrays, linked lists, binary trees, and sorting algorithms, with specific tasks to be completed by students. The document also notes exclusions from the syllabus for certain questions.

Uploaded by

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

Data Structures Lab Cycle Final-1

The document outlines the experiments for the Data Structures Lab course at Sree Chitra Thirunal College of Engineering, detailing evaluation criteria and deadlines for three cycles of experiments. Each cycle focuses on different data structures, including arrays, linked lists, binary trees, and sorting algorithms, with specific tasks to be completed by students. The document also notes exclusions from the syllabus for certain questions.

Uploaded by

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

DATA STRUCTURES LAB - PCCSL307

List of Experiments
July 3, 2025
Department of Computer Science and Engineering
Sree Chitra Thirunal College of Engineering

Each experiment will be evaluated based on the following rubrics.


• Preparation and Pre-Lab Work (7 Marks)

• Conduct of Experiments (7 Marks)

• Lab Reports and Record Keeping (6 Marks)

• Viva Voce (5 Marks)

• Attendance (5 Marks)

Cycle 1 - Arrays, Stack and Queue

Deadline: 15/8/2025

1. Given an array of sorted items, implement an efficient algorithm to search for specific
item in the array.

2. Find the sum of two sparse polynomials using arrays.

3. Implement a program using a stack to check whether a string containing parentheses (


and ) is balanced. Demonstrate your solution with various test cases.

4. You are tasked with designing a system for managing printer tasks in a small office. Each
print request should be stored and processed in the order it was received. Implement the
following:

• A queue using arrays to store and manage regular print requests.


• Use a DEQUEUE to manage the print requests.
• Implement Circular Queue using arrays for the above scenario.

5. Implement a simple calculator that perform the following:

• Convert infix expression to postfix.


• Evaluate the postfix expression using stack.
DATA STRUCTURES LAB - PCCSL307

Cycle 2 - Linked list, Binary Trees and Graph problems

Deadline: 15/9/2025

1. Implement backward and forward navigation of visited web pages in a web browser (i.e.
back and forward buttons) using doubly linked list operations.

2. Implement addition and multiplication of polynomials using singly linked lists.

3. Create a binary tree for a given simple arithmetic expression and find the prefix / postfix
equivalent.

4. Given an adjacency list of an undirected graph, find the number of connected components
in the graph using Breadth First Search and Depth First Search.

5. Implement route planning in transportation networks where the input is a set of intercon-
nected cities. Find the shortest path from a given source city to all other cities. Model
this as a graph problem using a directed graph having non-negative edge weights.

Cycle 3 - Binary search tree, Sorting and Hash table

Deadline: 15/10/2025

1. Implement a dictionary of word-meaning pairs using binary search trees.

2. Implement Bubble sort, Insertion Sort, Radix sort, Quick Sort, and Merge Sort and
compare the number of steps involved.

3. Implement a spell checker using a hash table to store a dictionary of words for fast lookup.
Implement functions to check if a word is valid and to suggest corrections for misspelled
words.

Note: Questions 2, 11, 14, 16, 17, 18 of the syllabus are not included in this cycle.

Page 2

You might also like