Course File Index Lab
Course File Index Lab
INDEX
Sl. No. CONTENT
1. Mission and Vision of the Institute and Department
2. Faculty Timetable
3. Student Name List
4. Syllabus
5. Lesson Plan
6. Model Exam Question Paper
7. Mark Statement for Model Exam
8. Sample Answer Scripts
9. Lab Manual
10. Log Book
ANAND INSTITUTE OF HIGHER TECHNOLOGY
Approved by AICTE, New Delhi. Affiliated to Anna University, Chennai
An ISO 9001:2008 Certified Institution & Accredited by NBA
DEPARTMENT OF ECE
ANAND INSTITUTE OF HIGHER TECHNOLOGY
Approved by AICTE, New Delhi. Affiliated to Anna University, Chennai
An ISO 9001:2008 Certified Institution & Accredited by NBA
DEPARTMENT OF ECE
Faculty Timetable
1 2 3 4 5 6 7 8
Period 10.45 to 12:30
& 8:30 11.00 – 1:05
Day 9:15 – 10:00 – A.M 11:00 – 11:45 – P.M 1:05 – 1:50 – 2:35 2:35 – 3:20
–9:15
10:00 A.M 10:45 A.M 11:45 A.M 12.30 P.M 1:50 P.M P.M P.M
A.M
CS3362
CS3362 – CPDS
TUE – CPDS
LAB
LAB B L
R U
WED E N
A C
K H
THU
FRI
.
ANAND INSTITUTE OF HIGHER TECHNOLOGY
Approved by AICTE, New Delhi. Affiliated to Anna University, Chennai
An ISO 9001:2008 Certified Institution & Accredited by NBA
DEPARTMENT OF ECE
CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY LT PC
0 0 3 1.5
COURSE OBJECTIVES:
To develop applications in C
To implement linear and non-linear data structures
To understand the different operations of search trees
To get familiarized to sorting and searching algorithms
LIST OF EXPERIMENTS
1. Practice of C programming using statements, expressions, decision making and iterative
statements
2. Practice of C programming using Functions and Arrays
3. Implement C programs using Pointers and Structures
4. Implement C programs using Files
5. Development of real time C applications
6. Array implementation of List ADT
7. Array implementation of Stack and Queue ADTs
8. Linked list implementation of List, Stack and Queue ADTs
9. Applications of List, Stack and Queue ADTs
10.Implementation of Binary Trees and operations of Binary Trees
11. Implementation of Binary Search Trees
12. Implementation of searching techniques
13. Implementation of Sorting algorithms : Insertion Sort, Quick Sort, Merge Sort
14. Implementation of Hashing – any two collision techniques
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students will be able to:
CO1:Use different constructs of C and develop applications
CO2:Write functions to implement linear and non-linear data structure operations
CO3:Suggest and use the appropriate linear / non-linear data structure operations for a given
problem
CO4:Apply appropriate hash functions that result in a collision free scenario for data storage
and Retrieval
CO5:Implement Sorting and searching algorithms for a given application
ANAND INSTITUTE OF HIGHER TECHNOLOGY
Approved by AICTE, New Delhi. Affiliated to Anna University, Chennai
An ISO 9001:2008 Certified Institution & Accredited by NBA
DEPARTMENT OF ECE