Lesson Plan for Even semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Sh. Praveen Kumar Discipline: Computer Engg. Semester: Subject: 4 th 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 Lecture day Topic (including assignment/ test) Practical day Topic 1st 1 2 3 Problem solving concept, top down and bottom up design, structured programming Concept of data types, variables and constants Concept of pointer Introduction to data Structure (Linear, Non Linear, Primitive, Non Primitive) 1st 2nd Introduction to'c' Language and data structures for practical exercises, Review of basic statement and data types used in 'C' language. Input /Output statements in C, Various Header Files in C 2nd 4 5 6 Concepts of Data Structure(Array, Linked List, Stack, Queue, Trees, graphs) Assignment-1 and review of the last chapter taught. Concept of Arrays Single dimensional array Two dimensional array: Representation of Two dimensional Array(Base Address, LB, UB) 3rd 4th The addition of two matrices using functions 3rd 4th 5th 7 8 9 10 11 12 13 14 15 Operations on arrays with Algorithms for searching Operations on arrays with Algorithms for traversing Operations on arrays with Algorithms for inserting Operations on arrays with Algorithms for deleting Assignment-2 and review of the last chapter taught. 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 5th 6th 7th 8th 9th 10th The multipication of two matrices using functions Push and pop operation in stack Conversion from in-fix notation
6th 7th 8th 9th 10th 11th 12th 13th 14th 15th 16 Doubly linked lists Traversing a doubly linked lists 17 Insertion and deletion into doubly linked lists 11th 18 Assignment-3 and review of the last chapter taught. 12th 19 Introduction to stacks Representation of stacks with array and Linked List 13th 20 Implementation of stacks Application of stacks - Polish Notations 21 - Converting Infix to Post Fix Notation - Evaluation of Post Fix Notation - Tower of Hanoi 22 15th Recursion: Concept and Comparison 23 between recursion and Iteration Introduction to queues 16th 24 Implementation of queues (array and Linked List with algorithm) 25 Circular Queues De-queues 26 Assignment-4 and review of the last chapter taught. 17th 27 Revision of previous chapter, Assignment and class test 18th 28 Concept of Binary Trees 29 Complete, Extended Binary Tree 19th 30 Concept of epresentation of Binary Tree 20th 31 Concept of balanced Binary Tree 32 Traversing Binary 21th 33 Trees (Pre order, Post order traversal) 22th 34 Trees (In order traversal) 35 Searching in binary search trees 36 Inserting and deleting in binary search trees 37 Assignment-5 and review of the last chapter taught. 38 Introduction of Sorting and Searching 39 40 Linear Search algorithm Binary Search algorithm 41 Concept of sorting 42 Bubble Sort, Insertion Sort 43 Selection Sort, Merge Sort 44 Radix Sort, Heap Sort 45 Assignment-6 and review of the last chapter taught. 14th 23th 24th 25th 26th 27th 28th 29th 30th The factorial of a given number using recursion Insertion and Deletion of elements in queue using pointers Insertion and Deletion of elements Insertion and Deletion of elements in linked list Insertion and Deletion of elements doubly linked list The linear search procedures to search an element in a given list The binary search procedures to search an element in a given list The bubble sort techniques The selection sort techniques Revision of practicals. Class Test of Practicals. in in
Lesson Plan for Even semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Ms. Indu Bala Semester: Subject: 4 nd COMPUTER ORGANIZATION Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018) Work Load (Lecture/ Practical) per week (in hours): Lectures- 04 Theory Week Lecture Topic (including assignment/ test) day 1st Introduction to CPU 2nd CPU organization 3rd General register organization 1st 4th Stack organization 5th Instruction format: three address 6th Two address,one address 7th Zero address instruction format 2nd 3rd 4th 5th 6th 7th 8th 8th 9th 10th 11th 12th 13th 14th 15th 16th 17th 18th 19th 20th 21st 22nd 23th 24th 25th 26th 27th 28th 29th 30th 31st 32nd RISK Instruction CPU design CISC CISC Characteristics RISC,Characteristics Comparison b/w RISC AND CISC TEST Memory organisation Assignment check RAM and ROM chips Associative memory Memory address map Associative memory Cache memory, virtual memory test Note book check Memory management hardware Basic i/o system Assignment check BIOS Function of BIOS Testing and initialization of BIOS Configuring the system Modes of data transfer Synchronous,asynchronous
9th 10th 11th 12th 13th 14th 15th 33rd 34th 35th 36th 37th 38th 39th 40th 41st 42nd 43rd 44th 45th 46th 47th 48th 49th 50th 51st 52nd 53rd 54th 55th 56th 57th 58th 59th 60th Diff b/n synchronous and asynchronous DMA data transfer test Note book check Parallel processing Forms of parallel processing pipelines Multiprocessor,basic characteristics Assignment check General purpose multiprocessors Interconnection networks: time shared common bus Multi port memory Cross bar switch Multi stage switching networks Hyper cube structures Test General purpose multiprocessors Attacks,hacking DES,RSA SSL,Digital signature Virous,worms and trojans firewall test Notebook check VPN IDS TEST TEST
Lesson Plan for Even Semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Sh. Susheel Kumar Semester: 4th 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, Practical-03) Week Theory Practical 1 st LectureDa y Topic (including assignment/test) Introduction to Database and its purpose 1 st Introduction to Database system Why Database 2 nd History of Database System Characteristics of the database approach Practical Day 1 st Topic Overview, Features and functionality, Application development in MS- Access 2 nd 7 th History of data base System Data models: (Physical Model, Object based Model, Record based Model 8 th Network Model, Heirachical Model) 3 rd schemas 3 rd 4 th th 13 5 th Advantages and disadvantages of 3 rd database systems Introduction to Conventional File System Concept of files,record, data, 4 th information retrieval. Comparison between Conventional System and DataBase System 5 th 6 th sub schemas instances, data base state. 9 th Case Study of models and schemas (examples student information System) The External level 2.2.2 The conceptual 10 th level 2.2.3 The internal level 2.2.4 Mappings 11 th Actors on the scene Database Administrators, Database Designers, End Users, System Analysts and Application Programmers Workers behind the scene (DBMS system designers and implementers, tool developers, operator and maintenance personnel) Data base Administrator and Administration, Database Management System Advantage and Disadvantage, Classification of DBMS, DBMS Interfaces Concept of centralized and Client 12 th /Server Architecture for DBMS: Single Tier, Two Tier and Three Tier Logical data Independence 2.5.2 Physical data Independence 14 th Revision & Feedback 15 th 1 st sessional test 2 nd 4 th 5 th Overview, Features and functionality, Application development in MS- Access Exercises on different forms of select statement, altering and droping of tables Exercises on different forms of select statement, altering and droping of tables Viva-voce
6 th 16 th DBMS Language 2.6.2 DBMS Interfaces Classification of Database Management 17 th Systems:Centralized, Distributed, parallel and Object based 18 th Data Models Classification : File based or primitive models, 7 th 20 th semantic data models th 19 Traditional data models. 21 st Entities and Attributes 22 nd Entity types and Entity sets 23 rd Key attribute and domain of attributes 8 th 8 th 24 th Relationship among entities 25 th Database design with E/R model Exercises on insertion of 9 th 26 th ER Design Issues 9 th data into tables 27 th Mapping Constraints 28 th Mapping Constraints Viva-voce 10 th 29 th Revision & Feedback 10 th 30 th 2 nd sessional test 31 st Relational Model Concepts: Domain, Attributes, Tuples, 11 th Cardinality Keys(Primary, Secondary, 32 nd foreign, Alternative Keys etc)and 11 th 33 rd Relations 12 th 34 th Data definition language 35 th Create, Alter, Drop commands] 36 th Data Manipulation Language (DML) 37 th Data Manipulation Language (DML) 13 th 38 th Select command with where clause using conditional expressions 13 th 39 th Boolean operators 40 th group by clause 14 th 41 st like operator. 14 th nd 42 Insert, Update commands Exercises on deletion of 12 th data using different conditions 43 rd Delete commands Viva-voce 15 th 44 th Revision & Feedback 15 th 45 th 3rd sessional test 6 th 7 th Exercises on creation of tables Exercises on creation of tables Exercises on insertion of data into tables Exercises on deletion of data using different conditions Exercises on UPDATE statement Exercises on UPDATE statement
Lesson Plan of Even Semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Sh. Pardeep Kumar Discipline: Computer Engg. Semester: Subject: Object Oriented Programming using C++ Lesson Plan Duration: 16 Weeks (From January, 2018 to April, 2018) Work Load (Lecture/Practical) per week (In Hours): Lectures-03, Practicals - 06) Theory Week Lecture Topic (Including assignment / Test) Practical Experiment Name Day Day 1 st Introduction and features of C++ 1st Write a function using variables as arguments to 1st swap the values of a pair of integers 2nd 4 th 2 nd Procedure oriented prog. Vs object oriented prog. 3 rd Oops concepts classes, reusability, encapsulation Polymorphism, dynamic binding, 4 th message passing 5 th Data hiding, applications of oops Language constructs of c and C++ 6 th 2nd Consider a shopping list of items for which we place an order with a dealer every month. The list includes such as the code number and price of each item we should like to perform operations such as adding an item to the list, deleting an item from the list and printing the total value of the order. 3rd 7 th Variables, data type 8 th Type declaration User defined data types 9 th 3rd Write a prog. To read name, roll number, internal-external marks using classes and display the same on the screen. 4th 10 th Increment and decrement operator 11 th Relational and logical operator If than else clause, Conditional 12 th expressions 4th Write a program of swapping of numbers by accessing private numbers using friend function. 5th 13 th a bank account using Input and output statements, loops 5th Define a class to represent constructor including the 14 th 15 th Switch case, arrays Union, functions following data members:- i) for single customer ii) for n customers a) Name of the depositors b) account number c) type of account d) balance amount in the account member functions:- -to assign initial values - to deposit an amount 16 th DB which store the value of distance. DM stores Pointers, pre-processors directives 6th Create 2 classes OM and Header files, Scope resolution operator distances in meters and 17 th Db in feet and inches. Write a program that can read values for the class
6th 18 th Mapping console i/o operations read values for the class objects and add 1 object OM with another object of DB. Use a friend function to carryout the addition operation the object that stores the results may be a DM object or a DB object, depending upon the units in which the result are required. The display should be in the format of feet and inches or meters and cms depending on the object on display. 7th 19 th 21 st C++ stream, formatted and unformatted console 20 th Creation and accessing class members Private vs public class 7th A books shop maintains the inventory of books that are being sold at the shop the list includes details such as author, title, publisher and stock position. Whenever a customer wants the book, the sales person inputs the title and author and the system search the list and display whether it is available, the total cost of the required copies is displayed, otherwise the message Required copies not in stock is displayed. Design a system using a class called books with suitablemember functions and constructors. Use new operator in constructor to allocate memory space require.
8th 9th 10th 22 nd Constructor and destructor with and without arguments 23 rd Object creation and accessing 24 th Dynamic memory allocation with new and delete operator 25 th Intro to member functions and method definition 26 th Inline function implementation 27 th Constant member functions 28 th Static function, this pointer 29 th Friend function and its characteristics Programming Exercise on hybrid inheritance. Introduction to operator overloading, 30 th need of operator overloading 8th 9th 10th Define a class string that could work as a user defined string type include constructors that will enable us to create an uninitialized Create a class string. float that contains 2 float data members. Over load all the 4 arithmetic operators so that do operate on the 11th 31 st Prefix and postfix notation, binary operator overloading 32 nd Type conversion, rules of operator overloading Comparison between function overloading and overriding 33 rd 11th Define 2 classes POLAR and RECTANGLE to represent points in the POLAR and RECTANGLE systems. Use conversion routines to convert from one system to the other. 12th Introduction to inheritance, types of 34 th inheritance 35 th Single, hierarchical, multiple and hybrid 36 th Protected data, public data and private data 12th Create a base class called shape, use this class to store two double type values that could be used to compute the area of fig. Derive the specific class called TRIANGLE and RECTANGLE from the data shape. Add to base class a member function get_data() to initialize base class data members and another member and another member function display_area() to compute and display the area of the fig. make display_area() as a virtual function and redefine function in the derived classes to suit their requirements. 37 th Inheriting constructors and destructors, constructor for virtual base classes 13th Exercise on file handling. 13th 14th 15th 38 th Constructors and destructors of derived classes and virtual functions 39 th Size of a drived class, order of invocation 40 th Introduction to Polymorphism and virtual functions, importance of V.F. 41 st Function call binding, virtual function 42 nd Implementing late binding, need for virtual function 43 rd Abstract base classes and pure virtual function 44 th Virtual destructor 45 th Introduction to file and streams, components of a file 46 th Different operation of the file, communication in files Continue
16th Creation of file streams, stream classes, 47 th header files and updating of file 48 th File pointers, function manipulation and detecting end of file
Lesson Plan for Even semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Sh. Ram Niwas Semester: 4th Subject: Microprocessors and Peripheral Devices 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 1 1 Evolution of Microprocessor : Typical organization of a microcomputer system 1 Prelude of 8085 microprocessor 2 Functions of its various blocks 3 Microprocessor, its evolution 4 Function and impact on modern society 2 5 Architecture of a Microprocessor (With 2 reference to 8085 microprocessor) : Concept of Bus Familiarization of different keys of 8085 microprocessor kit and its 6 Bus organization of 8085 memory map 7 Functional block diagram of 8085 8 Function of each block 3 9 Function of each block (continued) 3 Steps to enter, modify 10 Pin details of 8085 and related signals data/program and to execute a programme on 11 Pin details of 8085 and related signals (continued) 8085 kit 12 De-multiplexing of address/data bus 4 13 Generation of read/write control signals 4 Writing and execution of ALP for addition and sub 14 Steps to execute a stored programme station of two 8 bit numbers 15 Steps to execute a stored Programme (continued) 16 Instruction Timing and Cycles : Instruction cycle 5 17 Instruction cycle (continued) 5 Writing and execution of 18 machine cycle and T-states ALP for addition and sub 19 machine cycle and T-states (continued) station of two 8 bit numbers (continued) 20 Fetch and execute cycle 6 21 Fetch and execute cycle (continued) 6 Writing and execution of 22 23 Mid-Term Test I Programming (with respect to 8085 microprocessor) : ALP for multiplication and division of two 8 bit numbers Brief idea of machine and assembly languages 24 Machines and Mnemonic codes 7 25 Instruction format 7 Writing and execution of 26 Addressing mode ALP for multiplication 27 Addressing mode and division of two 8 bit 28 Identification of instructions as to which addressing mode they belong numbers (continued)
8 29 Concept of Instruction set 8 Writing and execution of 30 Explanation of the instructions of the following groups of instruction set: Data transfer group ALP for arranging 10 numbers in ascending/descending 31 Arithmetic Group, Logic Group order 32 Stack, I/O and Machine Control Group 9 33 Programming exercises in assembly language 9 Writing and execution of ALP for 0 to 9 BCD counters (up/down counter according to choice stored in memory) 34 Memories and I/O interfacing : Concept of memory mapping 35 Partitioning of total memory space 36 Address decoding 37 Concept of peripheral mapped I/O and memory mapped I/O 38 Interfacing of memory mapped I/O devices 39 Mid-Term Test II 40 Interrupts : Concept of interrupt, Maskable and non-maskable 41 Edge triggered and level triggered interrupts 42 Software interrupt 43 Restart interrupts and its use 44 Various hardware interrupts of 8085 45 Servicing interrupts 10 10 Interfacing exercise on 8255 like LED display control 11 11 Interfacing exercise on 8253 programmable interval timer 12 12 Interfacing exercise on 8279 programmable 46 47 Extending interrupt system Data Transfer Techniques : Concept of programmed I/O operations KB/display interface like to display the hex code of key pressed on display (continued) 48 Sync data transfer 13 49 Async data transfer (hand shaking) 13 Interfacing exercise on 8279 programmable 50 Interrupt driven data transfer KB/display interface like 51 DMA to display the hex code of 52 Serial output data, Serial input data key pressed on display 14 53 Peripheral devices : 8255 PPI 14 Use of 8085 emulator for 54 8253 PIT hardware testing 55 8257 / 8237 DMA controller 56 8279 Programmable KB/Display Interface 15 57 8251 Communication Interface Adapter 15 Use of 8085 emulator for 58 8251 Communication Interface Adapter (continued) hardware testing (continued) 59 Mid-Term Test III 60 Revision of challenging concepts