Вы находитесь на странице: 1из 3

SVS College of Engineering

Approved by AICTE ,NEW DELHI, Affiliated to Anna University , Chennai.


J P Nagar, Arasampalayam, Coimbatore - 642 109.
Ph: (0422) 2619300,2619301,2619302,2619303,2619304,2619305, Fax:
0422 2619306,

Department of Computer Science & Engineering


COURSE PLAN Academic Year 2014 2015

1. COURSE CODE

CS 6301

2. COURSE TITLE

PROGRAMMING AND DATA STRUCTURES II

3. CLASS & SEMESTER

II B.E(CSE ) & II.BE (IT)

4. FACULTY

Mrs.M.Kavitha Margret, Assistant Professor

5. SESSION PLAN
HOUR
No.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
HOUR
No.

TOPICS
UNIT I (OBJECT ORIENTED
PROGRAMMING FUNDAMENTALS)
C++ Programming features
Data Abstraction - Encapsulation
class - object - constructors
Static members
constant members member functions
pointers references
Role of this pointer
Storage classes
function as arguments
UNIT II (OBJECT ORIENTED
PROGRAMMING CONCEPTS)
String Handling
Copy Constructor - Polymorphism
Compile time and run time polymorphisms
Function overloading - operators overloading
Dynamic memory allocation
Nested classes
Inheritance
Virtual functions

HOURS
PLANNED

COMPLETED ON

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
2
1

TOPICS

HOUR

COMPLETED ON

UNIT III (C++ PROGRAMMING ADVANCED


18
19
20
21
22
23
24
25
26

27
28
29
30
31
32
33
34

FEATURES}
Abstract class
Exception handling
Standard libraries - Generic Programming templates
class template - function template
STL containers iterators
Function adaptors
Allocators
Parameterizing the class
File handling concepts
UNIT IV (ADVANCED NON-LINEAR DATA
STRUCTURES)
AVL trees
B-Trees
Red-Black trees
Splay trees
Binomial Heaps - Fibonacci Heaps
Disjoint Sets
Amortized Analysis accounting method potential
method
aggregate analysis

1
1
1
1
1
1
1
1
1

2
1
1
1
1
1
1
1

UNIT V (GRAPHS)
35
36
37
38
39
40
41
42

Representation of Graphs
Breadth-first search Depth-first search
Topological sort
Minimum Spanning Trees
Kruskal and Prim algorithm
Shortest path algorithm Dijkstras algorithm
Bellman-Ford algorithm
Floyd - Warshall algorithm

Lecture hours

45

Tutorial hours

Total hours

45

6. TEST TOPICS
TEST
No.

TOPICS

1
1
1
1
1
1
1
2

1
2
3

Unit I, II
Unit III, Unit IV (50%)
Unit IV (50%), Unit V

7.EVALUATION COMPONENTS
S.NO.
COMPONENTS
1
Tests
2
Attendance
Total Continuous Assessment Marks
3
Final University Examinations
Total Marks

MARKS
15
05
20
80
100

8. TEXT BOOK:
1. Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, Pearson Education, 2007.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2 nd Edition, Pearson
Education, 2005
REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to
Algorithms", Second Edition, Mc Graw Hill, 2002.
2. Michael T Goodrich, Roberto Tamassia, David Mount, Data Structures and Algorithms in C++,
7th Edition, Wiley Publishers, 2004.

SIGNATURE OF THE FACULTY

HoD

PRINCIPAL