DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Size: px

Start display at page:

Download "DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY"

Shonda Wheeler
5 years ago
Views:

1 DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR

2 Subject Code Subject Title L T P Total of LTP C FUNDAMENTALS OF DATA UCA STRUCTURES INSTRUCTIONAL OBJECTIVES: At the end of this course the learner is expected: 1. To learn Several data structure concepts like stack, queue, linked list, trees and graphs 2. To learn the Applications of data structures. 3. To improve the Problem solving quality using data structure techniques. UNIT I - INTRODUCTION TO DATA STRUCTURES Definition types of data structure-abstract data type-array as an abstract data typerepresentation of array- sparse matrices- asymptotic notation. UNIT II - STACKS AND QUEUES Stacks- queue- mazing problem- evaluation of expression- postfix notation- infix to post fix- multiple stack and queue. UNIT III - LINKED LIST Singly linked list- representation of linked singly list- operations on singly linked listdoubly linked list- representation of doubly linked list- operations on doubly linked listdifferentiate singly and doubly linked list- circularly singly and doubly linked list UNIT IV - TREES Tree Terminology- representation of tree- binary tree- binary tree traversal- operations on tree- applications- Sorting : selection sort- bubble sort- quick sort UNIT V - GRAPHS Definition- representation of a graph- operations- breadth first search- depth first searchminimum cost spanning trees- kruskal s algorithm and prim s algorithm- shortest path and transitive closure- single source- floyds algorithm- all pair dijikstra s algorithm. TEXT BOOK 1. Ellis Horowitz, Sahni, Dinesh Mehta (1999), Fundamentals of Data Structures in C++, Golgotha publication, New Delhi. REFERENCE 1. Weiss Mark Allen (2006), Data Structure and algorithm analysis, Pearson Education.

3 LESSON PLAN Subject Name: Subject Code: FUNDAMENTALS OF DATA STRUCTURES UCA15201 Unit I Lecture Hour Description Reference with chapter 1 Definition & introduction to C++ Class Chapter 2: ADT and C++ Classes Chapter 2: Array as an Abstract data type Chapter 2:2.2 4 Polynomial abstract data type Chapter 2:2.3 5 Polynomial abstract data type & representation Chapter 2: Polynomial addition Chapter 2: Sparse Matrices-introduction Chapter 2:2.4 8 Sparse Matrices-representation Chapter 2: Transposing a matrix Chapter 2: Matrix Multiplication Chapter 2: Representation of arrays Chapter 2: Representation of arrays-continuation Chapter 2:2.5 Unit II Lecture Hour Description Reference with chapter 13 Templates in C++ & its functions Chapter 3: Stack Abstract Data Type Chapter 3: Queue Abstract Data Type Chapter 3: Queue Abstract Data Type examples Chapter 3: Circular Queue Chapter 3: Amazing problem Chapter 3: Amazing problem analysis of path Chapter 3: Evaluation of expression-expressions Chapter 3: Evaluation of expression Postfix notation Chapter 3: Evaluation of expression infix to Postfix Chapter 3:3.6.3 notation 23 Analysis of postfix Chapter 3:3.6.3 Unit-III Lecture Hour Description Reference with chapter 24 Singly linked list Chapter 4: Defining a node in c++ Chapter 4: Designing a chain class in C++ Chapter 4: Pointer & list manipulation operation Chapter 4: Operations Chapter 4: Circular list Chapter 4: Doubly linked list-introduction Chapter 4:4.10

4 31 insertion &deletion into a doubly linked list Chapter 4: representation of generalized list Chapter 4: recursive algorithm Chapter 4: Unit-IV Lecture Hour Description Reference with chapter 34 Tree -Terminology Chapter 5: Representation of trees Chapter 5: Representation as a degree-two tree Chapter 5: Binary tree abstract data type Chapter 5: Binary tree representations Chapter 5: Binary tree traversal-introduction Chapter 5: Inorder traversal Chapter 5: Postorder and preorder traversal Chapter 5:5.3.3, Iterative inorder traversal Chapter 5: Level order & traversal without a stack Chapter 5:5.3.6, Sorting-Introduction Chapter 7: selection sort Chapter 1:Theorem Bubble sort Chapter 7:7.9:ex:8 47 Quick sort Chapter 7:7.3 Unit-V Lecture Hour Description Reference with chapter 48 Graph introduction Chapter 6: The Graph Abstract Data Type Chapter 6: Graph Representations Chapter 6: Depth First Search Chapter 6: Breadth First Search Chapter 6: Spanning Trees Chapter 6: Minimum Cost Spanning trees Chapter 6: Kruskal s Algorithm Chapter 6: Prim s Algorithm Chapter 6: Shortest path, Nonnegative edge costs- Chapter 6:6.4.1 Dijikstra s algorithm 58 General Weights- Floyd s algorithm Chapter 6: All pair shortest path Chapter 6: Transitive closure Chapter 6:6.4.4

5 Subject Code Subject Title L T P Total of LTP C OBJECT ORIENTED UCA PROGRAMMING USING C++ INSTRUCTIONAL OBJECTIVES: At the end of this course the learner is expected: 1. To learn the concepts of class & objects. 2. To perform Inheritance, Overloading of operators, functions, constructors and File Handling. 3. To do effective exception handling. UNIT I - PRINCIPLES OF OBJECT ORIENTED PROGRAMMING Object Oriented Programming Paradigms- Basic concept of OOPS- Benefits of OOPwhat is C++-simple C++ program-structure of C++ program- Creating a source file Compiling and linking. UNIT II - TOKENS, EXPRESSION AND CONTROL STRUCTURES Tokens-Keywords-Identifiers and Constants-Basic data types-user defined data types- Derived data types-type compatibility-declaration of variables-dynamic initialization of variables-reference variables-operators in C++-Manipulators-Type cast operator-implicit conversion-operator overloading-control structures. UNIT III - CLASS AND OBJECTS Functions in C++- Function overloading-specifying a class- Defining member function- Arrays within a class-arrays of objects- Objects as function arguments- Friendly functions-constructor and destructor. UNIT IV - INHERITANCE, POINTER, VIRTUAL FUNCTION AND POLYMORPHISM Single inheritance-multilevel-multiple inheritance-hierarchical-hybrid-virtual base class-abstract classes-pointers- this pointer-virtual functions-pure virtual functions.- Operator over loading- Rules for operator overloading. UNIT V - MANAGING CONSOLE I/O OPERATIONS C++ streams-streams classes-unformatted I/O operations-formatted console I/O operations-managing output with manipulators-exception handling- Basics of exception handling. TEXT BOOKS 1. E. Balagurusamy, (2008), Object Oriented Programming with C++, Tata McGraw- Hill Publication.

6 REFERENCE 1. Herbert Schildt, (2003), C++: The Complete Reference, Tata McGraw publication. LESSON PLAN Subject Name: Subject Code: OBJECT ORIENTED PROGRAMMING USING C++ UCA15202 UNIT I Lecture Hour Description Reference With Chapter 1 Object Oriented Programming Paradigm Chapter 1: Basic concepts of Object Oriented Programming Systems Chapter 1: Benefits of Object Oriented Programming Chapter 1: What is C++? Chapter 2: Simple C++ program and its concepts Chapter 2: Structure of C++ program Chapter 2: Creating a source file, compiling and linking Chapter 2: 2.7, 2.8 UNIT II Lecture Hour Description Reference With Chapter Chapter 3: 3.1, 8 Tokens, keywords, identifiers and constants 3.2, 3.3, Basic datatypes Chapter 3: User- defined datatypes Chapter 3: Derived datatypes Chapter 3: Type compatibility Chapter 3: Declaration of variables Chapter 3: Dynamic initialization of variables Chapter 3: Reference variables Chapter 3: Operators in C++ Chapter 3: 3.14, Operators in C++ Chapter 3: 3.16, Manipulators Chapter 3: Typecast operator Chapter 3: Implicit conversion Chapter 3: Operator overloading Chapter 3: Control structures Chapter 3: Control structures Chapter 3: 3.25

7 Lecture Hour UNIT III Description Reference With Chapter Chapter 4: 4.1, 24 Functions in C++ 4.2, Functions in C++ Chapter 4: 4.5, 4.6 Chapter 4: 4.7, 26 Functions in C++ 4.8, Function Overloading Chapter 4: 4.10 Chapter 5: 5.1, 28 Specifying a class 5.2, Defining member function Chapter 5: Defining member function Chapter 5: 5.7, Array within a class Chapter 5: Arrays of objects Chapter 5: Objects as function arguments Chapter 5: Friendly functions Chapter 5: Constructors Chapter 6: 6.1, Constructors Chapter 6: 6.3, Constructors Chapter 6: 6.5, Constructors Chapter 6: 6.7, 6.8 Chapter 6: 6.9, Constructors 40 Destructors Chapter 6: 6.11 Lecture Hour UNIT IV Description Reference With Chapter Chapter 8: 8.1, 41 Single inheritance 8.2, 8.3, Multilevel inheritance Chapter 8: Multiple Inheritance Chapter 8: Hierarchical inheritance Chapter 8: Hybrid inheritance Chapter 8: Virtual base class Chapter 8: Abstract class Chapter 8: 8.10 Chapter 9: 9.1, 48 Pointers 9.2, 9.3, This pointer Chapter 9: Virtual functions Chapter 9: Pure virtual functions Chapter 9: 9.7 Chapter 7: 7.1, 52 Operator overloading 7.2, 7.3, 7.4 Chapter 7: 7.5, 53 Operator overloading 7.6, 7.7, Rules for Operator Overloading Chapter 7: 7.8

8 Lecture Hour UNIT V Description Reference With Chapter Chapter 10: 10.1, 55 C++ streams, Stream classes 10.2, Unformatted I/O Operations Chapter 10: Formatted console I/O Operations Chapter 10: Managing O/P with manipulators Chapter 10: 10.6 Chapter 13: 13.1, 59 Exception handling Basics of Exception handling Chapter 13:13.3

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY