Lesson Plan for Even semester

Size: px

Start display at page:

Download "Lesson Plan for Even semester"

Everett William Blair
5 years ago
Views:

1 Lesson Plan for Even semester Govt. Polytechnic, Ambala City Name of e Faculty: Discipline: Semester: Subject: Sh. Munish Gupta (Theory + Pract.) & Dr. Surender Kumar (Practical) Computer Engg. 4 DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2019 to April, 2019) Work Load (Lecture/ Practical) per week (in hours):lectures- 03, Practicals-06 Theory Practical Week Lecture day Topic (including assignment/ test) Practical day Topic 1 st nd Problem solving concept, top down and bottom up design, structured programming 1.2 Concept of data types, variables and constants 1.3 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 2.2 Single dimensional array 2.3 Two dimensional 1 st Introduction to C language and data structures for practical exercises 2 nd statements in C, Various Header Input /Output Files in C rd 3 4 The addition of two matrices using functions No 1

2 3 rd array: Representation of Two dimensional Array(Base Address, LB, UB) Operations on arrays wi Algorims for searching Operations on arrays wi Algorims for traversing Operations on arrays wi Algorims for inserting Operations on arrays wi Algorims 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 3.4 Searching linked list Insertion and deletion into linked list (At first Node, Specified Position, Last node 3.6 Application of linked lists Doubly linked lists 3.8 Traversing a doubly linked lists 5 The multipication of two matrices using functions 6 No 2. 7 Push and pop operation in stack No 3 Conversion from in-fix notation No 4 The factorial of a 11 given number using recursion Insertion and deletion into doubly 17 linked lists 18 Revision of previous 12

3 chapter, Assignment and class test Introduction to stacks 4.2 Representation of stacks wi 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 Recursion: Concept and Comparison between recursion and Iteration 4.6 Introduction to 23 queues Implementation of queues (array and Linked List wi 24 algorim) 25 Circular Queues 26 De-queues Revision of previous chapter, Assignment and class test Concept of Binary Trees (Complete, Extended Binary 29 Tree) No Deletion of elements in queue Insertion and using pointers 14 No 6. Insertion and Deletion of 15 elements in circular queue using pointers 16 No Deletion of elements in linked Insertion and list No 8. Insertion and 19 Deletion of elements in doubly linked list Concept of representation of Binary Tree No 9. Binary Tree 21 procedures to Traversing Binary search an element Concept of balanced The linear search 32 in a given list

4 12 Trees (Pre order, Post order and In order) Searching, inserting and deleting in binary search trees Revision of previous chapter, Assignment and class test Introduction of Sorting and No 10. procedures to search an element The binary search in a given list No The bubble sort techniques Searching No Search algorim 40 (Linear and Binary) 41 Concept of sorting 27 The selection sort techniques Bubble Sort, Insertion Sort Selection Sort, Merge Sort Radix Sort, Heap Sort Revision of previous chapter, Assignment and class test 28 No 13. Revision and test 29 of practicals. 30 Revision and test of practicals.

5 Name Mr. Ajay Singh LESSON PLAN Disciplin Computer Engineering, Govt. Polytechnic, Ambala City e Semester 4 Subject Object Oriented Programming using Java Duration 16 WEEKS(January April 2019) Work Load Lecture 3 Lecture per week (I hour /day) Practica 6 hours Lab per week (3 hours/day) Week l Theory Practical Day Topic Day Topic 1st 1st Fundamentals of object oriented programming :procedure oriented programming Vs. object oriented programming (OOP) 1st Creating Classes and Objects 2nd 3rd Object oriented programming concepts Classes, object object reference, abstraction, encapsulation, inheritance, polymorphism 2nd Practice Classes and Objects 2nd 4 Introduction of eclipse (IDE) for developing programs in Java 5 Review of constructs of C used in JAVA : variables, types and type declarations 1st Practice Classes and Objects 2nd Practice Classes and Objects 6 data types, pointers 3rd 7 Functions, structure and unions 1st Practice Classes and Objects 8 increment and decrement operators, 2nd Practice Classes and Objects 9 relational and logical operators 4 10 if en else clause, conditional expressions 1st Practice Classes and Objects 11 input using scanner class and output statement 2nd Practice Classes and Objects 12 input using scanner class and output statement 5 13 loops, switch case, 1st Experiment 1 of Practical List 14 arrays, meods 2nd Continue Previous Experiment 15 Creation of class and objects, accessing class members 6 16 Private data members and functions 1st Continue Previous Experiment 17 Public data members and functions 2nd Practice Classes and Objects 18 Protected data members and functions,default data members and functions 7 19 Comparision: Private Vs Public Vs Protected Vs Default 1st Practice Classes and Objects 20 Constructors, Destructors 2nd Experiment 2 of Practical List 21st Object & Object Reference 8 22nd Definition of inheritance and its types 1st Experiment 3 of Practical List 23rd protected data, private data, public data 2nd Continue Previous Experiment 24 constructor chaining, order of invocation of constructors and destructors 9 25 Class test of Inheritance of constructors and 1st Practice Inheritance examples destructors 26 types of inheritance 2nd Experiment 4 27 single inheritance, multilevel inheritance

6 10 28 hierarchical inheritance 1st Practice Inheritance examples 29 hybrid inheritance 2nd Experiment 6 30 Class test of Inheritance 11 31st Introduction to polymorphism and its types: Runtime and 1st Experiment 7 32nd Compile Uses of Polymorphism Time 2nd Experiment 8 33rd Meod & constructor overloading, meod overriding up-casting and down-casting 1st Experiment 8 35 practicing polymorphsim examples 2nd Practice Inheritance examples 36 Revision and problem Key points of Abstract class 1st Practice abstract Class 38 Key points of Interface 2nd Practice Interface 39 difference between an abstract class & interface Multiple inheritance in Java 1st Experiment 9 41st Need of Interface 2nd Experiment 9 42nd implementation of multiple inheritance rough interface 15 43rd Definition of exception handling 1st Experiment Why Exception handling needed? Introduction to try & catch implementation of keywords like try, catch 2nd Experiment implementation of finally, row & rows 1st Practice Exception handling programs Revision of Try, Catch, Finally, Throw and rows importance of exception handling in practical implementation of live projects 2nd Practice Exception handling programs

7 Lesson Plan for Even semester Govt. Polytechnic, Ambala City Name of e Faculty: Discipline: Semester: Subject: Dharmvir Saini Computer Engineering 4 COMPUTER ORGANIZATION Lesson Plan Duration: 15 weeks (from January, 2019 to April, 2019) Work Load (Lecture/ Practical) per week (in hours): Lectures- 04 Theory Practical Week Lecture day Topic (including assignment/ test) Practical day Topic 1 st Introduction to basic Hardware organization of computer system 2 nd CPU organization : 1 st general register organization 3 rd CPU organisation: stack organization 4 Introduction to instruction and eir formats 5 Types of instructions like ree address, two address, one address, zero address 6 Introduction to CPU Addressing 2 nd 7 Introduction to different types of Addressing modes 8 Immediate, register, direct, in direct, relative, indexed addressing modes. 3 rd programmed vs hard 9 CPU Design : Micro wired control

8 Introduction to different instruction set computers 11 CISC characteristics, RISC characteristics, and eir comparison. 12 Assignment & revision of 1 st Chapter 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 17 Memory connections to CPU 18 Brief about Auxiliary memory 19 Introduction to Magnetic disks 20 Brief about Magnetic tapes 21 st Introduction to Associative memory 22 nd Brief about Associative memory 23 Introduction to Cache memory 24 Brief about Cache memory 25 Introduction to Virtual memory 26 Brief about Virtual memory 27 Revision of All types of memory in detail 28 Basics Memory management hardware 29 Brief about Memory management

9 hardware 30 Assignment & revision of 2nd Chapter 31 st Test Chapter 1 and revision 32 nd Test Chapter 2 and revision 33 rd I/O organization of a computer 34 Basis Input output 9 system(bios) 35 Function of BIOS 36 Testing and initialization of BIOS 37 Configuring e system wi BIOS 38 Different Modes of Data Transfer Brief about Programmed I/O Data Transfer 40 Brief about Synchronous 41 st Brief about asynchronous Data Transfer 42 nd Brief about interrupt initiated Data 11 Transfer 43 rd Brief about DMA data transfer 44 Difference between e different types of data transfer 45 Assignment & revision of 3rd Chapter 46 Introduction to Architecture of 12 multiprocessor systems 47 Different forms of parallel processing 48 Introduction to Parallel processing and pipelines Basic characteristics

10 14 15 of multiprocessor 50 Brief about General purpose multiprocessors 51 st Introduction to Interconnection networks 52 nd Brief about time shared common bus 53 rd Brief about Multi port memory 54 cross bar switch 55 Introduction to multi stage switching networks 56 hyper cube structures 57 Assignment & revision of 4h Chapter 58 Test of unit 4 59 Revision of ALL chapters 60 Revision along wi problem solving session

11 Name of e Faculty Discipline Department Semester : 4 Lesson Plan (Even Semester) : Krishan Singh : Computer Engg. : Computer Engg. Subject : DataBase Management System Lesson Plan Duration : 15 weeks ( from january, 2019 to April, 2019) **Work load (Lecture / Practical) per week(in hours): Lectures-03, practicals -03 Week 1st 2nd Lecture day 1st 2nd 3rd Theory Topic (Including assignment / test) 1. Introduction: Database Systems; Database and its purpose, Characteristics of e database approach, Advantages and disadvantages of database systems Classification of DBMS Users; Actors on e scene, Database Administrators, Database Designers, End Users, System Analysts and Application Programmers, Workers behind e scene (DBMS system designers and implementers, tool developers, operator and maintenance personnel) 2. Database System Concepts and Architecture : Data models, schemas, instances, data base state. DBMS Architecture; The External level, The conceptual level, The internal level, Mappings. Data Independence; Logical data Independence, Physical data Independence. Database Languages and Interfaces; DBMS Language, DBMS Interfaces. Classification of Database Management Systems- Centralized, Distributed, parallel and object based. Practi cal 1st 2nd Practical Topic Exercises on creation and modification of structure of tables. Exercises on creation and modification of structure of tables. 3rd Data Modeling using E.R. Model (Entity Relationship Model) Data Models Classification; File based or primitive models Traditional data models, semantic data models 3rd Exercises on inserting and deleting values from tables Entities and Attributes, Entity types and Entity sets, Key attribute and domain of attributes, Relationship among entities, Database design wi E/R model Relational Model: Relational Model Concepts: Domain, Attributes, Tuples cardinlity, Keys(Primary, Secondary, foreign, alternative keys) and Relations. Relational constraints and relational database schemes; Domain constraints, Key constraints and constraints on Null. Relational databases and relational database schemes, 4 5 Exercises on inserting and deleting values from tables. Exercises on querying e table (using select command) Entity integrity, referential integrity and foreign key.

12 Week Lecture day st 22nd 23rd st 32nd 33rd st 42nd 43rd Topic (Including assignment / test) Comparison b/w E/R model and Relational model. 5. Normalization :Trivial and non-trivial dependencies. Non-loss decomposition and functional dependencies First, Second normal form Third normal forms, Boyce/Codd normal form, denormalization 6. Database Access and Security: Creating and using indexes Creating and using indexes Creating and using views. Creating and using views. Database security, process controls, database protection Grant and revoke 7. MYSQL/SQL (Structured Query Language) SQL* DDL (Data Definition Languages): Creating Tables Creating a table wi data from anoer table Creating a table wi data from anoer table Inserting values into a table, Updating columns of a Table, Deleting Rows, Dropping a Table DML (Data Manipulation Language): Database Security and Privileges, Grant and Revoke Command, Maintaining Database Objects, Commit and Rollback Various types of select commands Various types of select commands Various types of joins Various types of joins Sub query Aggregate functions Aggregate functions, Challenges of My SQL. Introduction to Big Data. Understanding Big Data wi samples. Pract i cal Topic 6 Exercises on querying e table (using select command) Exercises on using various types of joins. Exercises on using various types of joins. Exercises on using functions provided by database package. Exercises on using functions provided by database package. Exercises on commands like Grant, Revoke, Commit and Rollback etc. Exercises on commands like Grant, Revoke, Commit and Rollback etc. Design of database for any application. Design of database for any application. Design of database for any application.

13 Lesson Plan for Even semester Govt. Polytechnic, Ambala City Name of e Faculty: Discipline: Semester: Subject: Sh. Rajinder Kumar Computer Engineering 4 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 Theory Practical Week Lecture day Topic (including assignment/ test) Practical day Topic 1 st 1 st Typical organization of a microcomputer system. nd 2 Functions of its various blocks. rd 3 Microprocessor and its evolution. 4 Function and impact of microprocessor on modern society. 5 Concept of Bus. st 1 A brief history of Microprocessor. How Microprocessor works and its various features. 2 nd 3 rd 6 Bus organization of Functional block diagram of 8085 and function of each block. 8 Pin details of 8085 and related signals. 9 Demultiplexing of address/data bus generation of read/write control signals. 10 Steps to execute a stored Programme. nd 2 3 rd Familiarization of different keys of 8085 microprocessor kit. Familiarization of memory map of 8085.

14 11 Instruction cycle, machine cycle and T-states. 12 Fetch and execute cycle. 13 Revision and 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 ey belong. 17 Concept of Instruction set and Explanation of e instructions of e following groups of instruction set. 18 Data transfer group 19 Revision and Steps to enter 4 data/program on 8085 kit. 5 Steps to modify data/program on 8085 kit 6 20 TEST 21 st Arimetic Group, Logic Group 22 nd Stack, I/O and Machine Control Group 23 Revision and 6 Steps to execute a programme on 8085 kit TEST 25 Programming exercises in assembly language 26 Concept of memory 7 Writing and execution of ALP for addition of two 8 bit numbers.

15 mapping 27 Partitioning of total memory space 28 Revision and Revision and 30 TEST st 31 Address decoding 32 nd Concept of peripheral mapped I/O 33 rd Concept of memory mapped I/O 34 Interfacing of memory mapped I/O devices 35 Revision and 8 9 Writing and execution of ALP for subtraction of two 8 bit numbers. Writing and execution of ALP for multiplication and division of two 8 bit numbers TEST 37 Concept of interrupt 38 Maskable and nonmaskable 39 Edge triggered and level triggered interrupts 40 Software interrupt 41 st Restart interrupts and its use nd 42 Various hardware interrupts of 8085 rd 43 Servicing interrupts 44 Revision and Writing and execution of ALP for arranging 10 numbers in ascending/descending order. Writing and execution of ALP for 0 to 9 BCD counters (up/down counter according to choice stored in memory) extending interrupt system 46 Concept of programmed I/O operations 47 synchronous data transfer, asynchronous data 12 Interfacing exercise on 8255 like LED display control and 8253 programmable interval timer.

16 13 transfer (hand shaking) 48 Interrupt driven data transfer 49 DMA 50 Serial output data, Serial input data 51 st 8255 PPI 52 nd 8253 PIT 13 Interfacing exercise on 8279 programmable KB/display interface like to display e hex code of key pressed on display rd 8257 / 8237 DMA controller, 54 Programmable KB/Display Interface, Communication Interface Adapter. 56 Revision and 14 Use of 8085 emulator for hardware testing. 57 Revision and Revision and 59 Revision and 15 Revision and Problem Solving. 60 Revision and

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