DOC/LP/01/28.02.

02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date: 17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 01 of 06
Unit: I Branch: IT Semester: II

Unit syllabus:

C PROGRAMMING FUNDAMENTALS- A REVIEW 9

Conditional statements Control statements Functions Arrays Preprocessor - Pointers -
Variation in pointer declarations Function Pointers Function with Variable number of
arguments

Objective:
To introduce the basics of C programming language.

Session Teaching
Topics to be covered Time in
No Ref Method
min
Conditional and Control statements
1 50 T1, R4 BB
Statements and Blocks, if-else, else-if, switch
Conditional and Control statements
2 50 T1, R4 BB
while, for, do-while, break and continue, goto and labels
Functions
3 Basics, Functions returning values, External Variables, 50 T1, R4 BB
Scope rules
Functions
4 Header file, Static variables, Register variables, Block 50 T1, R4 BB
Structure, Initialization, Recursion
Arrays
5 One Dimensional Arrays, Two Dimensional Arrays, 50 T1, R4 BB
Multi Dimensional Arrays
Preprocessor
6 C Preprocessor Directives, #define Statement, #include 50 T1, R4 BB
Statement, Conditional Compilation
Pointers
Pointers and Addresses, Pointers and Arrays, Address
7 50 T1, R4 BB
Arithmetic, Pointer Arrays, Pointers to Pointers,
Initialization of Pointer Arrays
Variation in pointer declarations
Complication Declaration
8 50 T1, R4 BB
Function Pointers
Pointer to Functions
 Function with Variable number of arguments
9 Pointer and Function Arguments, Character Pointers and 50 T1, R4 BB
Functions, Command Line Arguments
10 Sample Programs 50 T1, R4 BB

DOC/LP/01/28.02.02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date: 17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 02 of 06
Unit: II Branch: IT Semester: II

Unit syllabus:

C PROGRAMMING ADVANCED FEATURES 9

Structures and Unions - File handling concepts File read write binary and Stdio File
Manipulations

Objective:
To introduce the advanced features of C programming language.

Session Teaching
Topics to be covered Time in
No Ref Method
min
Structures
11 Basics of Structures, Structures and Functions, Array of 50 T1, R4 BB
Structures
Structures
12 50 T1, R4 BB
Pointers to Structures, Self Referential Structures
Structures
13 50 T1, R4 BB
Table lookup, typedef
Unions
14 50 T1, R4 BB
Basics of Unions, Bit Fields
File Handling Concepts
15 50 R4 BB
Redirecting I/O to a File, End of File
File Manipulations
16 50 R4 BB
fopen, fclose, stdin, stdout, stderr, exit functions
File Manipulations
17 50 R4 BB
Renaming and Removing Files
File read write binary and Stdio
18 50 R4 BB
fprintf, fscanf, fgetc, fputc functions
 19 Sample Programs 50 T1, R4 BB

20 CAT - I

DOC/LP/01/28.02.02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date:17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 03 of 06
Unit: III Branch: IT Semester: II

Unit syllabus:

LINEAR DATA STRUCTURES LIST 9

Abstract Data Types (ADTs) List ADT array-based implementation linked list
implementation singly linked lists- circularly linked lists- doubly-linked lists applications of
lists Polynomial Manipulation All operation (Insertion, Deletion, Merge, Traversal)

Objective:
To introduce the concept of List ADT and its applications.

Session Teaching
Topics to be covered Time in
No Ref Method
min
Abstract Data Types (ADTs)
21 50 T2 BB/LCD
Introduction
List ADT
22 50 T2 BB/LCD
Array-based implementation, Linked list implementation
Singly linked lists
23 50 T2 BB
Programming Details Insertion
Singly linked lists
24 50 T2 BB
Programming Details Deletion, Find Operations
Circularly linked lists
25 50 T2 BB
Implementation
 Doubly-linked lists
26 50 T2 BB
Implementation
Applications of lists
27 50 T2 BB
Polynomial Manipulation Insertion, Deletion
Applications of lists
28 50 T2 BB
Polynomial Manipulation Merge, Traversal
Applications of lists
29 50 T2 BB/LCD
Radix Sort, Multilists
30 Sample Problems 50 R1 BB

DOC/LP/01/28.02.02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date: 17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 04 of 06
Unit: IV Branch: IT Semester: II

Unit syllabus:

LINEAR DATA STRUCTURES STACKS, QUEUES 9

Stack ADT Evaluating arithmetic expressions- other applications- Queue ADT circular queue
implementation Double ended Queues applications of queues

Objective:
To introduce Stack ADT and Queue ADT with their applications.

Session Teaching
Topics to be covered Time in
No Ref Method
min
Stack ADT
31 50 T2 BB/LCD
Array Implementation of Stack
Stack ADT
32 50 T2 BB
Linked Implementation of Stack
 Evaluating arithmetic expressions
33 Evaluation of Postfix expression, Infix to Postfix 50 T2 BB
Expression.
Applications
34 50 T2 BB
Balancing Symbols, Function Calls
35 Sample Problems 50 R1 BB
Queue ADT
36 50 T2 BB/LCD
Circular array implementation of queue
37 Double ended Queues 50 T2, R3 BB/LCD

38 Applications of queues 50 T2 BB

39 Sample Problems 50 R1 BB

40 CAT - II

DOC/LP/01/28.02.02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date: 17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 05 of 06
Unit: V Branch: IT Semester: II

Unit syllabus:

SORTING, SEARCHING AND HASH TECHNIQUES 9

Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge
sort - Radix sort Searching: Linear search Binary Search Hashing: Hash Functions Separate
Chaining Open Addressing Rehashing Extendible Hashing

Objective:
To introduce the concepts of sorting, searching and hashing.
Session Teaching
Topics to be covered Time in
No Ref Method
min
Sorting algorithms
41 50 T2, R2 BB/LCD
Insertion sort , Selection sort
Sorting algorithms
42 100 T2, R2 BB/LCD
Shell sort, Bubble sort
Sorting algorithms
43 50 T2, R2 BB/LCD
Quick sort
Sorting algorithms
44 50 T2, R2 BB/LCD
Merge sort, Radix sort
45 Sample Problems 50 R1 BB/LCD
Searching
46 50 R2 BB/LCD
Linear search, Binary Search
Hashing
47 50 T2 BB/LCD
Hash Functions, Separate Chaining
Open Addressing
48 50 T2 BB/LCD
Linear Probing, Quadratic Probing, Double Hashing
49 Rehashing, Extendible Hashing 50 T2 BB

50 Revision 50 BB

DOC/LP/01/28.02.02

LESSON PLAN LP- CS6202

LP Rev. No: 00
Sub Code : CS6202
Date: 17/1/2014
Sub Name : PROGRAMMING AND DATA STRUCTURES I
Page: 06 of 06
Branch: IT Semester: II

Course Delivery Plan

Weeks 1 2 3 4 5 6 710 8 11 9
12 13
I II I II I II I II I II I II I II I II I II I II I II I II I II
Units 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 -
TEXT BOOKS:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2nd Edition,
Pearson Education, 1988.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
Education, 1997.

REFERENCES:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to

Algorithms", Second Edition, Mcgraw Hill, 2002.
2. Reema Thareja, Data Structures Using C, Oxford University Press, 2011
3. Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.
4. Stephen G. Kochan, Programming in C, 3rd edition, Pearson Ed.,

Prepared by Approved by

Signature

Ms.R.Dhanalakshmi
Name Dr.D.Balasubramanian
Ms.M.Vijayasanthi
Designation AP/IT HOD/IT

Date 17/1/2014 17/1/2014