DATA STRUCTURES LAB
CS231
Overview
The goal of this course is to introduce the students to the world of computer networks where they learn network related commands, practise Linux programming using Linux system calls, and start using tools for Network Traffic Analysis and Network Monitoring. By the end of this course, students should be able to design and deploy Computer Networks.
Instructors
PREETHI L
preethi@cet.ac.in
BINCY N RASHAD
Prerequisites
- CS205 : Data structures
Teaching Assistants
Midhun Shaji
Asif A
Subipriya Laxmi S B N
Syllabus
Schedule
- Cycle 1
- Menu driven program for linear search and binary search
- Sorting Algorithms: Bubble sort, Insertion sort, Selection sort, Quick sort, Merge sort
- String operations
- Cycle 2
- Menu driven program for stack operations using array
- Menu driven program for queue operations using array
- Menu driven program for input and output restricted DEQUEUE
- Menu driven program for circular queue operations using array
- Infix to Postfix conversion using stack
- Menu driven program for postfix and prefix evaluation
- Program for multiple stack using array
- Cycle 3
- Menu driven program for singly linked list operations
- Menu driven program for stack operations using Linked lists
- Menu driven program for polynomial addition and multiplication
- Cycle 4
- Menu driven program for Binary search tree operations
- Implement BFS and DFS Algorithms
- Implement hash table using mapping functions, collision and overflow resolving schemes