Seth Jai Parkash Polytechnic, Damla

Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours): Lectures- 03, Practicals-06 Theory Practical Week Lect day Topic (including assignment/ test) Practical day Topic 1 2 1 2 3 4 5 6 Problem solving concept, top down and bottom up design, structured ming Concept of data types, variables and constants Concept of pointer variables and constants Introduction to data Structure( Linear, Non Linear, Primitive, Non Primitive) Concepts of Data Structure(Array, Linked List, Stack, Queue, Trees, graphs) Revision of previous chapter, Assignment and class test. Concept of Arrays Single dimensional array Two dimensional 1 st 2 nd Introduction to C language and data structures for practical exercises Input /Output statements in C, Various Header Files in C The addition of two 3 rd matrices using functions th 4 Inserting element in array

array: Representation of Two dimensional Array(Base Address, LB, UB) 3 7 8 Operations on arrays with Algorithms for searching Operations on arrays with Algorithms for traversing Operations on arrays with Algorithms for inserting Deletion of element in 5 th arrary th 6 Factorial of a given number using recursion 4 5 9 10 11 12 13 14 Operations on arrays with Algorithms for deleting Revision of previous chapter, Assignment and class test Introduction to linked list and double linked list Representation of linked lists in Memory, Comparison between Linked List and Array Traversing a linked list Searching linked list Insertion and deletion into linked list (At first Node, Specified Position, Last node Application of linked lists 7 th Practice of the s with functions th 8 th 9 th 10 Insertion and deletion of element from singly linked list Insertion and deletion of element from doubly linked list Searching of element in Linked list 15 Doubly linked lists 6 16 Traversing a doubly linked Traversing of singly and lists 11 th doubly linked list Insertion and deletion into doubly linked lists 17 18 Revision of previous 12 th

chapter, Assignment and class test Concatenation of linked list 7 19 20 21 Introduction to stacks Representation of stacks with array and Linked List Implementation of stacks Application of stacks Polish Notations Converting Infix to Post Fix Notation Evaluation of Post Fix Notation Tower of Hanoi Insertion and Deletion of 13 th elements in stack using pointers Conversion of infix to 14 th postfix 15 th Insertion and Deletion of elements in queue using pointers 8 9 10 22 Recursion: Concept and Comparison between recursion and Iteration Introduction to queues 23 Implementation of queues (array and Linked List with algorithm) 24 25 Circular Queues 26 De-queues Revision of previous chapter, Assignment and class test 27 28 Concept of Binary Trees (Complet e, Extended Binary Tree) Terms related to binary tree th 16 Insertion and Deletion of elements in circular queue using pointers 17 th Linear Searching 18 th Binary Searching 19 th Bubble sort Concept of representation of Selection sort Binary Tree 20 th 31 32 Concept of balanced Binary Tree Traversing Binary 21 th Quick sort

11 12 33 Trees (Pre order, Post order and In order) 34 Examples for traversal of tree 35 Searching, inserting deleting in binary search trees th 22 Insertion sort Insertion at specific 23 th location in linked list 36 13 37 14 15 Revision of previous chapter, Assignment and class test Introduction of Sorting and Deletion at specific 24 th location in linked list 25 th Insertion at specific location in doubly list Deletion at specific Searching 26 th location in doubly linked list 38 39 Linear Search algorithm 40 Binary Search Algorithm 41 Concept of sorting Bubble Sort, Insertion Sort 42 43 44 45 Selection Sort, Merge Sort Radix Sort, Heap Sort Revision of previous chapter, Assignment and class test 27 th Menu Driven to perform operations on stack Menu Driven to 28 th perform operations on queue th Revision and test of 29 practicals. th 30 Revision and test of practicals.

Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms. Meenu Gupta Discipline: Computer Engg. Semester: 4 th Subject: COMPUTER ORGANISATION Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours):lectures- 04 Week Theory Practical Lecture day Topic (including assignment/ test) Practical day Topic 1st 1 Introduction to basic Hardware organization of computer system 2 CPU organization : general register organization 3 CPU organisation: stack organization 4 Introduction to instruction and their formats 2nd 5 Types of instructions like three address, two address, one address, zero address 6 Introduction to CPU Addressing 7 Introduction to different types of Addressing modes 8 Immediate, register, direct, in direct, relative, indexed addressing modes. 3rd 9 CPU Design : Micro med vs hard wired control 10 Introduction to different instruction set computers 11 CISC characteristics, RISC characteristics, and their comparison.

12 Assignment & revision of 1st Chapter 4th 13 Introduction to different types of memory and Memory organization 14 Memory Hierarchy 15 RAM and ROM chips, 16 Memory address map and mapping schemes 5th 17 Memory connections to CPU 18 Brief about Auxiliary memory 19 Introduction to Magnetic disks 20 Brief about Magnetic tapes 6th 21 Introduction to Associative memory 22 Brief about Associative memory 23 Introduction to Cache memory 24 Brief about Cache memory 7th 25 Introduction to Virtual memory 26 Brief about Virtual memory 27 Revision of All types of memory in detail 28 Basics Memory management hardware 8th 29 Brief about Memory management hardware 30 Assignment & revision of 2nd Chapter 31 Test Chapter 1 and revision 32 Test Chapter 2 and revision

9th 33 I/O organization of a computer 34 Basis Input output system(bios) 35 Function of BIOS 36 Testing and initialization of BIOS 10th 37 Configuring the system with BIOS 38 Different Modes of Data Transfer 39 Brief about Programmed I/O Data Transfer 40 Brief about Synchronous 11th 41 Brief about asynchronous Data Transfer 42 Brief about interrupt initiated Data Transfer 43 Brief about DMA data transfer 44 Difference between the different types of data transfer 12th 45 Assignment & revision of 3rd Chapter 46 Introduction to Architecture of multiprocessor systems 47 Different forms of parallel processing 48 Introduction to Parallel processing and pipelines 13th 49 Basic characteristics of multiprocessor 50 Brief about General purpose multiprocessors 51 Introduction to Interconnection networks

52 Brief about time shared common bus 14th 53 Brief about Multi port memory 54 cross bar switch 55 Introduction to multi stage switching networks 56 hyper cube structures 15th 57 Assignment & revision of 4h Chapter 58 Test of unit 4th 59 Revision of ALL chapters 60 Revision along with problem solving session

Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Sh. Rohit Mandhar Discipline: Computer Engg. Semester: 4 th Subject: DATA BASE MANAGEMENT SYSTEM Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours):lectures- 03, Practicals-03 Week 1 Lecture Day 1 2 Theory Topic ( Including assignment/test) Database Systems : Introduction to Database and its purpose and Introduction to Database system Introduction to Database and its purpose and Introduction to Database system Why Database and History of Database System Practical Day 1 Practical Day Topic Introduction to Database and overview of the different database available and brief about MS-Access 3 Characteristics of the database approach And Advantages and disadvantages of database systems 4 Introduction to Conventional File System, Concept of files, record, data, information retrieval 2 5 Comparison between Conventional System and Database System, Classification of DBMS users : Actors on the scene Database Administrators, Database Designers 2 Overview, Features and functionality, Application development in MS- Access 6 End Users, System Analysts and Application Programmers, workers behind the scene (DBMS system designers and implementers, tool developers 3 7 Operator and maintenance personnel and History of data base System 3 Overview, Features and functionality, Application development in MS- Access-

8 Database system concepts and architecture and models: (Physical Model, Object based Model, Record based Model Network Model, Hierarchical Model) Continues 9 schemas, sub schemas instances, data base State. Case Study of models and schemas (examples student information System) 10 DBMS Architecture: Three Level of Architectures 4 11 The External level, the conceptual level and The internal level 4 Exercises on different forms of select statement, altering and droping of tables 12 Mappings and types of mappings 13 Data base Administrator and Administration 5 14 Database Management System Advantage and Disadvantage 5 Exercises on different forms of select statement, altering and droping of tablescontinues 15 Classification of DBMS, DBMS Interfaces 16 Concept of centralized and Client /Server Architecture for DBMS 6 17 Single Tier, Two Tier and Three Tier architecture 6 Exercises on creation of tables 18 Data Independence 7 19 Logical data Independence And Physical data Independence 7 Exercises on creation of tables- continues

20 Database Languages and Interfaces 21 22 Classification of Database Management Systems: Centralized, Distributed, parallel and Object based 8 23 Data Models Classification : File based or primitive models, traditional data Models, semantic data models. 8 Exercises on insertion of data into tables 24 Entities and Attributes, Entity types and Entity sets 25 Key attribute and domain of attributes Relationship among entities 9 26 Database design with E/R model 9 Exercises on insertion of data into tables- continues 27 ER Design Issues And Mapping Constraints 28 Revision and Assignment along with problem solving 10 29 Relational Model Concepts 10 Exercises on deletion of data using different conditions 30 Domain, Attributes, Tulles, Cardinality 31 Keys(Primary, Secondary, foreign, Alternative Keys etc)and Relations 11 32 Revision and Assignment along with problem solving 11 Exercises on deletion of data using different conditionscontinues 33 Introduction to Structured Query Language 12 34 Data definition language : Create, Alter, Drop commands 12 Exercises on UPDATE statement

35 36 Data Manipulation Language (DML) like select, elete, update and insert command. Data Manipulation Language (DML) like select, delete, update and insert command. 37 Select command with where clause 13 38 Select command with where clause using Conditional expressions and Boolean operators 13 Exercises on UPDATE statement- continues 39 Select command with group by clause 14 40 Select command with like operator 41 Insert, Update and Delete commands 14 Revision of all the commands already done in the practical/labs. 42 43 Revision and Assignment on all the SQL commands 15 44 Test of Chapter 5th 15 Test of different commands and with problem solving session 45 Revision of all the syllabus with problem solving

Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Sh. Gaurav Mehta Discipline: Computer Engg. Semester: 4 th Subject: OBJECT ORIENTED PROGRAMMING USING C Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours):lectures- 03, Practicals-06 Week Theory Practical Lecture Day Topic(Including assignment/test) Practical Day Topic 1st 1 Fundamentals of object oriented ming procedure oriented ming Vs. object oriented ming (OOP) 2 Object oriented ming concepts Classes 3 reusability, encapsulation, inheritance, polymorphism 1st 2nd Basics of ming with C++ Input /Output statements in C++ 2nd 4 dynamic binding, message passing, Data Hiding 3rd Header Files in C++ 5 Benefits of OOPs and its Application 4th Program to Print Hello in C++ 6 Review of constructs of C used in C++: variables, types and type declarations 3rd 7 user defined data types 5th Program No. 1 of Syllabus 8 increment and decrement operators, relational and logical operators 9 if then else clause; conditional expressions 6th Checking and 4th 10 input and output statement, Loops 7th Program to Print days of week using if then else clause

11 Switch case, arrays 8th Checking and 12 Structure, unions 5th 13 functions 9th Program to Print days of week using switch case 14 pointers; preprocessor directives and Header Files 15 Scope Resolution Operator Managing Console I/O Operations 10th Checking and 6th 16 C++ Stream 11th Program No. 2 of Syllabus 17 Unformatted and Formatted Console I/O 18 Creation, accessing class members 12th Checking and 7th 19 Private Vs Public 13th Program No. 3 of Syllabus 20 Constructor and Destructor with and without Arguments 21 Objects 14th Checking and 8th 22 Dynamic memory Allocation with new and Delete Operator 15th Program No. 4 of Syllabus 23 Method definition 16th Checking and 24 Inline Implementation, Constant member functions

9th 25 Static Function, This Pointer 17th Program No. 5 of Syllabus 26 Friend Function and its Characteristics 18th Checking and 27 Introduction to Operator Overloading, Need of operator overloading 10th 28 prefix and postfix, overloading binary operators instream /outstream operator overloading 29 Constructor Overloading, Type Conversion 30 Rules of Operator Overloading, Comparison between Function Overloading and overriding 11th 31 Definition of inheritance, Types of inheritance 19th 20th 21th Program No. 6 of Syllabus Checking and Program No. 7 of Syllabus 32 Single inheritance, hierarchical inheritance, multiple inheritance, hybrid inheritance 33 protected data, private data, public/data 22th Checking and 12th 34 inheriting constructors and destructors, constructor for virtual base classes 23th Program No. 8 of Syllabus 35 constructors and destructors of derived classes, and virtual functions 36 size of a derived class, order of invocation, 24th Checking and 13th 37 Importance of virtual function, function call binding 25th Program No. 9 of Syllabus 38 virtual functions, implementing late binding 26th Checking and testing of the above

39 need for virtual functions testing of the above 14th 40 abstract base classes and pure virtual functions, virtual destructors 27th Program No. 10 of Syllabus 41 Components of a file, different operation of the file 42 communication in files, creation of file streams 28th Checking and 15th 43 stream classes, header files, updating of file, opening and closing a file 29th Program No. 11 of Syllabus 44 file modes and file pointers and their manipulations 45 functions manipulation of file pointers, Detecting end-of-file. 30th Program No. 12 & 13 of Syllabus Checking and

Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms. Richa Kharbanda (Theory) Ms. Meenu Gupta (Practical) Discipline: Computer Engg. Semester: 4 th Subject: MICROPROCESSOR AND PERIPHERAL DEVICES Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours):lectures- 04, Practicals-03 Week Theory Practical Lecture day Topic (including assignment/ test) 1st 1 Typical organization of a microcomputer system. 2 Functions of its various blocks. Practical day Topic 1 A brief history of Microprocessor. How Microprocessor works and its various features. 3 Microprocessor and its evolution. 4 Function and impact of microprocessor on modern society. 2nd 5 Concept of Bus. 2 Familiarization of different keys of 8085 microprocessor kit. 6 Bus organization of 8085. 7 Functional block diagram of 8085 and function of each block. 8 Pin details of 8085 and related signals. 3rd 9 Demultiplexing of address/data bus generation of read/write control signals. 3 Familiarization of memory map of 8085.

10 Steps to execute a stored Programme. 11 Instruction cycle, machine cycle and T-states. 12 Fetch and execute cycle. 4th 13 Revision and 4 Steps to enter data/ on 8085 kit. 14 TEST 15 Brief idea of machine and assembly languages, Machines and Mnemonic codes, Instruction format and Addressing mode. 16 Identification of instructions as to which addressing mode they belong. 5th 17 Concept of Instruction set and Explanation of the instructions of the following groups of instruction set. 18 Data transfer group 5 Steps to modify data/ on 8085 kit 19 Revision and 20 TEST

6th 21 Arithmetic Group, Logic Group 6 Steps to execute a me on 8085 kit. 22 Stack, I/O and Machine Control Group 23 Revision and 24 TEST 7th 25 Programming exercises in assembly language 26 Concept of memory mapping 7 Writing and execution of ALP for addition of two 8 bit numbers. 27 Partitioning of total memory space 28 Revision and 8th 29 Revision and 30 TEST 8 Writing and execution of ALP for subtraction of two 8 bit numbers. 31 Address decoding 32 Concept of peripheral mapped I/O 9th 33 Concept of memory mapped I/O 9 Writing and execution of ALP for multiplication and

34 Interfacing of memory mapped I/O devices division of two 8 bit numbers. 35 Revision and 36 TEST 10th 37 Concept of interrupt 10 Writing and execution of ALP for arranging 10 38 Maskable and nonmaskable numbers in ascending/descending order. 39 Edge triggered and level triggered interrupts 40 Software interrupt 11th 41 Restart interrupts and its use 42 Various hardware interrupts of 8085 11 Writing and execution of ALP for 0 to 9 BCD counters (up/down counter according to choice stored in memory). 43 Servicing interrupts 44 Revision and 12th 45 extending interrupt system 46 Concept of med I/O operations 12 Interfacing exercise on 8255 like LED display control and 8253 mable interval timer.

47 synchronous data transfer, asynchronous data transfer (hand shaking) 48 Interrupt driven data transfer 13th 49 DMA 13 Interfacing exercise on 8279 mable 50 Serial output data, Serial input data 51 8255 PPI KB/display interface like to display the hex code of key pressed on display. 52 8253 PIT 14th 53 8257 / 8237 DMA controller, 14 Use of 8085 emulator for hardware testing. 54 Programmable KB/Display Interface, 55 8251 Communication Interface Adapter. 56 Revision and 15th 57 Revision and 15 Revision and Problem Solving. 58 Revision and 59 Revision and

60 Revision and