CS6202 P&DS

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

Unit: I
Branch: IT
Page: 01 of 06
Semester: II
Unit syllabus:
C PROGRAMMING FUNDAMENTALS- A REVIEW
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
No
1
2
3
4
5
6
Topics to be covered
Conditional and Control statements

Statements and Blocks, if-else, else-if, switch
Conditional and Control statements
while, for, do-while, break and continue, goto and labels
Functions
Basics, Functions returning values, External Variables,
Scope rules
Functions
Header file, Static variables, Register variables, Block
Structure, Initialization, Recursion
Arrays
One Dimensional Arrays, Two Dimensional Arrays, Multi
Dimensional Arrays
Preprocessor
C Preprocessor Directives, #define Statement, #include
Statement, Conditional Compilation
Pointers
Pointers and Addresses, Pointers and Arrays, Address
Arithmetic, Pointer Arrays, Pointers to Pointers,
Initialization of Pointer Arrays
Variation in pointer declarations
Complication Declaration
Function Pointers
Pointer to Functions
Time in
min
Ref
Teaching
Method
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
Function with Variable number of arguments

Pointer and Function Arguments, Character Pointers and
Functions, Command Line Arguments
50
T1, R4
BB
10
Sample Programs
50
T1, R4
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS6202
LP Rev. No: 00
Sub Code : CS6202

Unit: II
Branch: IT
Semester: II
Date: 17/1/2014
Page: 02 of 06
Unit syllabus:
C PROGRAMMING ADVANCED FEATURES
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
No
11
12
13
14
15
16
17
18
Structures
Basics of Structures, Structures and Functions, Array of
Structures
Structures
Pointers to Structures, Self Referential Structures
Structures
Table lookup, typedef
Unions
Basics of Unions, Bit Fields
File Handling Concepts
Redirecting I/O to a File, End of File
File Manipulations
fopen, fclose, stdin, stdout, stderr, exit functions
File Manipulations
Renaming and Removing Files
File read write binary and Stdio
fprintf, fscanf, fgetc, fputc functions
Time in
min
Ref
Teaching
Method
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
T1, R4
BB
50
R4
BB
50
R4
BB
50
R4
BB
50
R4
BB
19
Sample Programs
20
CAT - I
50
T1, R4
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS6202
LP Rev. No: 00
Sub Code : CS6202

Unit: III
Branch: IT
Semester: II
Date:17/1/2014
Page: 03 of 06
Unit syllabus:
LINEAR DATA STRUCTURES LIST
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
No
21
22
23
24
25
Abstract Data Types (ADTs)

Introduction
List ADT
Array-based implementation, Linked list implementation
Singly linked lists
Programming Details Insertion
Singly linked lists
Programming Details Deletion, Find Operations
Circularly linked lists
Implementation
Time in
min
Ref
Teaching
Method
50
T2
BB/LCD
50
T2
BB/LCD
50
T2
BB
50
T2
BB
50
T2
BB
Doubly-linked lists
Implementation
Applications of lists
Polynomial Manipulation Insertion, Deletion
Polynomial Manipulation Merge, Traversal
Radix Sort, Multilists
26
27
28
29
30
Sample Problems
50
T2
BB
50
T2
BB
50
T2
BB
50
T2
BB/LCD
50
R1
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS6202
LP Rev. No: 00
Sub Code : CS6202

Unit: IV
Branch: IT
Semester: II
Date: 17/1/2014
Page: 04 of 06
Unit syllabus:
LINEAR DATA STRUCTURES STACKS, QUEUES
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
No
31
32
Stack ADT
Array Implementation of Stack
Stack ADT
Linked Implementation of Stack
Time in
min
Ref
Teaching
Method
50
T2
BB/LCD
50
T2
BB
33
34
Evaluating arithmetic expressions

Evaluation of Postfix expression, Infix to Postfix
Expression.
Applications
Balancing Symbols, Function Calls
50
T2
BB
50
T2
BB
35
Sample Problems
50
R1
BB
36
Queue ADT
Circular array implementation of queue
50
T2
BB/LCD
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

Unit: V
Branch: IT
Semester: II
Date: 17/1/2014
Page: 05 of 06
Unit syllabus:
SORTING, SEARCHING AND HASH TECHNIQUES
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
No
41
42
43
44
45
46
47
48
Sorting algorithms
Insertion sort , Selection sort
Sorting algorithms
Shell sort, Bubble sort
Sorting algorithms
Quick sort
Sorting algorithms
Merge sort, Radix sort
Sample Problems
Searching
Linear search, Binary Search
Hashing
Hash Functions, Separate Chaining
Open Addressing
Linear Probing, Quadratic Probing, Double Hashing
Time in
min
Ref
Teaching
Method
50
T2, R2
BB/LCD
100
T2, R2
BB/LCD
50
T2, R2
BB/LCD
50
T2, R2
BB/LCD
50
R1
BB/LCD
50
R2
BB/LCD
50
T2
BB/LCD
50
T2
BB/LCD
T2
BB
49
Rehashing, Extendible Hashing
50
50
Revision
50
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS6202
LP Rev. No: 00
Sub Code : CS6202

Branch: IT
Semester: II
Date: 17/1/2014
Page: 06 of 06
Course Delivery Plan

Weeks
Units
10
11
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
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.,
Approved by
Prepared by
Signature
Name
Designation
Date
Ms.R.Dhanalakshmi
Ms.M.Vijayasanthi
AP/IT
17/1/2014
Dr.D.Balasubramanian
HOD/IT
17/1/2014

CS6202 P&DS

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

CS6202 P&DS

Enviado por

Direitos autorais:

Formatos disponíveis

DOC/LP/01/28.02.

Sub Code : CS6202

Sub Name : PROGRAMMING AND DATA STRUCTURES I

Conditional and Control statements

Function with Variable number of arguments

Sub Code : CS6202

Sub Code : CS6202

Abstract Data Types (ADTs)

Sub Code : CS6202

Evaluating arithmetic expressions

Double ended Queues

Sub Code : CS6202

Rehashing, Extendible Hashing

Sub Code : CS6202

Course Delivery Plan

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

Você também pode gostar