3 rd What is hacking? Attacker, phreaker etc. parameters of firewall.

Transcription

1 Name of the Faculty : MISS. SONICA UPADHYAY Discipline : Computer Engg. Lesson Plan Semester : 6 th Subject : Network Security Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Practical Lecture Topic (including assignments /tests) Practical Topic Day Day 1 st Week 1 st Introduction: Need for securing a network 1st -G1 Installation and comparison of various anti virus software nd Principles of Security nd - G Installation and comparison of various 3rd Type of attacks anti virus software Week 1 st Introduction to 1st -G1 Installation and study of various cyber crime & cyber law-indian Perspective (IT Act parameters of firewall. 000 and amended 008), nd Cyber ethics & ethical hacking nd - G Installation and study of various 3 rd What is hacking? Attacker, phreaker etc. parameters of firewall. Week 3 1 st Assignment on Cyber crime 1 st -G1 Practice nd Securing Data over Internet: Introduction to basic encryption and decryption 3 rd Concept of symmetric and asymmetric key nd - G Practice cryptography Week 4 1 st Assignment on cryptography 1st -G1 Practice of C language nd Test 3 rd Overview of DES, RSA and PGP nd - G Practice of C language Week 5 1 st Introduction to Hashing: MD5, SSL 1 st -G1 Practice of C language nd Introduction to Hashing: MD5, SSL, SSH, HTTPS, 3 rd Digital Signatures, Digital certification nd - G Practice of C language Week 6 1 st Digital Signatures, Digital certification, IPSec 1st -G1 Writing program in C to Encrypt using nd Assignment on Hashing XOR key. 3 rd Test nd - G Writing program in C to Encrypt using XOR key. Week 7 1 st Virus, Worms and Trojans: Introduction & 1st -G1 Writing program in C to Decrypt using Definition XOR key. nd preventive measures access central 3 rd checksum verification & process configuration nd - G Writing program in C to Decrypt using XOR key. Week 8 1 st Assignment on Virus, Worms and Trojans 1st -G1 Study of VPN. nd Virus scanners & Heuristic scanners 3 rd Application level virus scanners nd - G Study of VPN. Week 9 1 st Deploying virus protection 1st -G1 Study of VPN. nd Assignment & Test 3 rd Firewalls: Definition and types of firewalls nd -G Study of VPN. Week 1 Firewall configuration st 1st -G1 Practice 10 nd Limitations of firewall. 3 rd Assignment & Test nd - G Practice Week 1 st Intrusion Detection System (IDS) : Introduction & 1st -G1 Study of various hacking tools. 11 IDS limitations nd Teardrop attacks, counter measures; Host based IDS set up 3rd Handling Cyber Assets- Configuration policy as nd - G Study of various hacking tools. per standards Week 1 st Disposable policy 1st -G1 Study of various hacking tools. 1 nd Virtual Private Network (VPN) : Basics, setting of VPN, 3 rd VPN diagram & Configuration of required objects nd - G Study of various hacking tools. Week 1 st Exchanging keys, modifying security policy 1st -G1 Practice 13 nd Assignment 3 rd Test nd - G Practice

2 Week 14 1 st Disaster and Recovery: Disaster categories 1st -G1 Practical applications of digital nd Network disasters cabling, topology signature. 3 rd Single point of failure, save configuration files nd - G Practical applications of digital signature. Week 15 1 st Server disasters UPS, RAID, Clustering 1 st -G1 Practice & Viva nd Backups, server recovery 3 rd Assignment & Test nd - G Practice & Viva

3 Lesson Plan Name of the Faculty : MISS. AARTI MOR Discipline : Computer Engg. Semester : 6 th Subject : Distributed Computing Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Lecture Day Topic (including assignments /tests) 1 st Week 1st Cloud Computing :Overview of Cloud Computing nd Overview of Cloud Computing 3rd Characteristics of Cloud Computing Week 1 st Advantages of Cloud Computing nd Assignment 3 rd Challenges of Cloud Computing Week 3 1st Challenges of Cloud Computing nd Applications of Cloud Computing 3 rd Applications of Cloud Computing Week 4 1st Assignment nd Test 3rd Cloud Computing Service Models and deployment Models : Introduction Week 5 1 st Service Model- Saas nd Service Model- Paas 3rd Service Model- Laas Week 6 1st Assignment nd Deployment Models : Private Cloud 3rd Deployment Models : Public Cloud Week 7 1st Deployment Models : Hybrid Cloud nd Deployment Models : Community Cloud 3rd Assignment Week 8 1st Test nd Grid Computing :- Overview 3rd Advantages Week 9 1st Virtual Organizations nd Virtual Organizations 3rd Assignment Week 10 1st Applications nd Applications 3 rd Assignment Week 11 1st Test nd Other Technologies : Introduction 3rd Cluster Computing Week 1 1st Peer to Peer Networks nd Utility Computing rd Assignment 3 Week 13 1 st Test nd Utility Computing 3rd Ubiquitous Computing -- Comparison of Grid, Week 14 1st Assignment nd Ubiquitous Computing -- Comparison of Grid 3 rd Ubiquitous Computing -- Comparison of Grid Week 15 1 st Cluster and Cloud Computing nd Assignment rd Revision & Test 3

4 Lesson Plan Name of the Faculty : Mr.PRASHANJIT KUMAR Discipline : Computer Engineering Semester : VI Subject : Programming In Java Lesson Plan Duration : 15 weeks (From January, 018 to April,018) Work Load (Lecture /Practical) per week (in hours): Lectures 03, Practical 03) Note: G1 and G are the respective Groups of students Week Theory Practical Lecture Topic (Including Assignment/ Test) Practical Topic Day Day 1 st 1 st Unit 1:Introduction to Java 1 st 1 a) Write a program which tells A brief history, how Java works?, Java G1 whether a number is even or odd. Take Virtual Machine (JVM), Java In Time a range (JIT) from 1 50 compiler b) Display the output which is given below: * * * * * * nd Java features, using Java with other nd 1 a) Write a program which tells tools, native code, Java application G whether a number is even or odd. Take types, a range from rd comparison with C and C++ b) Display the output which is given below: * * * * * * nd 1 st Unit : 1 Working with data types, control flow statements st 1 a) Write a program which tells whether a number is even or odd. Take a range from 1 50 b) Display the output which is given below: * * * * * * nd Arrays, casting nd 1 a) Write a program which tells whether a number is even or odd. Take 3 rd command line a range arguments from 1 50 b) Display the output which is given below: * * * * * * 3 rd 1 st Revision 1 G1 st c) Write a program which sorts an array of type integer d) Write a programme to determine the sum of the following harmonic series for a given value of n: 1+1/+1/3..+1/n the value of n should be given interactively through the keyboard nd Revision nd c) Write a program which sorts an array G of type integer 3 rd Unit 3: Java Classes and Memory management d) Write a programme to determine the Introduction to Classes, inheritance sum of the following harmonic series for a given value of n: 1+1/+1/3..+1/n the value of n should be given interactively through the keyboard

5 4 th 1 st Encapsulation and polymorphism 1st Write a programme to convert the G1 given temperature in Fahrenheit to Celsius using the following conversion formula C = F.3/1.8 and display the value in a tabular form nd Constructors and nd finalizers G Write a programme to convert the 3rd Garbage collection, access specifier given temperature in Fahrenheit to Celsius using the following conversion formula C = F.3/1.8 and display the value in a tabular form 5 th 1 st Revision 1 G1 st Write a programme to find all the numbers and sum of all integers greater than 100 less than 00 that are divisible by 7 nd Unit 4: Interfaces and Packages: nd Write a programme to find all the Using Java interface G numbers and sum of all integers greater 3rd Using Java packages than 100 less than 00 that are divisible by 7 6 th 1 st Revision 1 G1 st Given a list of marks ranging from 0 to 100, write a programme to compute and print the number of student should have obtained marks (a) in the range 81 to 100 (ii) in the range 61 to 80 (c) in the range 41 to 60 (d) in the range 0 to 40. The programme should use a minimum number of if statement nd Unit 5: Exception Handling and stream files nd Given a list of marks ranging from 0 to Over view of exception handling G 100, write a programme to compute and 3 rd Method to use exception handling print the number of student should have obtained marks (a) in the range 81 to 100 (ii) in the range 61 to 80 (c) in the range 41 to 60 (d) in the range 0 to 40. The programme should use a minimum number of if statement 7 th 1 st Method available to 1st Admission to a professional course is exceptions (The throw statement, the G1 subject to the following conditions: throws class, finally class), a) Marks in mathematics >=60 b) Marks in physics >=50 c) Marks in chemistry >=40 d) Total in all 3 subjects >=00 (OR) Total in mathematics and physics >=150 given the marks in the 3 subjects. Write the programme to process the application to list the eligible candidates nd Creating your own nd Admission to a professional course is exception classes G subject to the following conditions: a) Marks in mathematics >=60 3 rd Revision b) Marks in physics >=50 c) Marks in chemistry >=40

6 d) Total in all 3 subjects >=00 (OR) Total in mathematics and physics >=150 given the marks in the 3 subjects. Write the programme to process the application to list the eligible candidates 8 th 1 st Unit 6:Threads and multi threading 1st The number in the sequence Overview, thread basics creating and G Are called Fibonacci running a thread, numbers. Write programme using a do.. while loop to calculate and print the first m ibonacci numbers (Hint: after the first numbers in the series, each number is the sum of the preceding the numbers) The thread control methods nd nd The number in the sequence Are called Fibonacci 3 rd The numbers. Write programme using a do threads life cycle and synchronization.. while loop to calculate and print the first m ibonacci numbers (Hint: after the first numbers in the series, each number is the sum of the preceding the numbers) 9 th 1 st Revision 1 G nd Revision G G st Write a programme to evaluate the following investment equation V=P (1+r)n and print the tables which would give the value of V for various combination of the following values of P, r and n. nd Write a programme to evaluate the following investment equation V=P 3 rd Unit 7. Introduction to Applet, Application and (1+r)n and JDK print the tables which would give the value of V for various combination of Java applets Vs Java applications the following values of P, r and n. 10 th 1 st Building application with JDK 1st Write a program which will store the G1 students roll no. names and total marks in the database nd Building applets with JDK nd G Write a program which will store the students roll no. names and total marks 3 rd Building applets with JDK in the database 11 th 1 Building applets with JDK st 1st Write a program which will display all G1 those records whose marks are above 75% nd Building applets with JDK nd Write a program which will display all G those records whose marks are above 3 rd HTML for Java applets 75% 1 th 1 st HTML for Java applets 1st Write a program to draw the following G1 using Applet: nd HTML for Java applets nd Write a program to draw the following G using Applet: 3rd HTML for Java applets 13 th 1 st Managing input 1st Exercises on implementing Java Classes. G1

7 nd Managing input nd Exercises on implementing Java G Classes. 3rd Managing input 14 th 1 st Managing input 1st Exercises on exceptional handling G1 nd Managing input nd Exercises on exceptional handling 3rd Revision 15 th 1 st Revision 1 G1 nd Revision G 3rd Revision G st Exercises on creating and running threads nd Exercises on creating and running threads

8 Name of the Faculty : MISS.SONICA UPADHYAY Discipline : Computer Engg. Lesson Plan Semester : 4 th Subject : DBMS Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Practical Lecture Topic (including assignments /tests) Practical Topic Day Day 1 st Week 1 st Database Systems : Introduction to Database and its purpose & Database 1st -G1 Overview, Features and functionality System nd Why Database & History of Database nd - G Overview, Features and functionality System 3rd Characteristics of the database approach & Advantages and disadvantages of database systems Week 1 st Introduction to Conventional File System & Concept of files, record, data, information 1st -G1 Application development in MS-Access retrieval Comparison between Conventional System and DataBase System nd Classification of DBMS Users - Actors on the scene & Database Administrators, nd - G Application development in MS-Access Database Designers, End Users, System Analysts and Application Programmers 3rd Workers behind the scene (DBMS system designers and implementers, tool developers, operator and maintenance personnel) History of data base System Week 3 1 st Assignment on Database system 1st -G1 Exercises on different forms of select statement nd Test 3 rd Data models: (Physical Model, Object nd - G Exercises on different forms of select based Model, Record based Model statement Network Model, Heirachical Model) Week 4 1 st Schemas, sub schemas instances, data base state. Case Study of models and schemas 1st -G1 Exercises on altering of Tables (examples student information System) nd DBMS Architecture: Three Level of Architecures 3 rd Data base Administrator and Administration, Database Management nd - G Exercises on altering of Tables System Advantage and Disadvantage, Classification of DBMS, DBMS Interfaces Week 5 1 st Concept Architecture of centralized for DBMS: Single and Client Tier, /Server Two 1st -G1 Exercises on dropping of Tables Tier and Three Tier nd Data Independence Logical data Independence, Physical data Independence 3 rd Database Languages and Interfaces nd - G Exercises on dropping of Tables DBMS Language & DBMS Interfaces Week 6 1 st Classification of Database Management Systems: Centralized, Distributed, parallel 1st -G1 Exercises on creation of tables and Object based nd Assignment on Database Architecture 3 rd Test nd - G Exercises on creation of tables Week 7 1 st Data Modeling using E.R. Model: Data 1st -G1 Exercises on insertion of data into Modeling using E.R. Model (Entity tables Relationship Model nd Data Models Classification : File based or primitive models, traditional data models, semantic data models 3 rd Entities and Attributes nd - G Exercises on insertion of data into tables Week 8 1 st Entity types and Entity sets 1st -G1 Exercises on deletion of data nd Key attribute and domain of attributes

9 3 rd Relationship among entities nd - G Exercises on deletion of data Week 9 1 st Database design with E/R model 1st -G1 Exercises on deletion of data using nd ER Design Issues different conditions 3 rd Mapping Constraints nd -G Exercises on deletion of data using different conditions Week 1 st Assignment on Entity Relationship Model 1st -G1 Exercises on UPDATE statement 10 nd Test 3 rd Relational Model Concepts: Domain, nd - G Exercises on UPDATE statement Attributes, Tuples Week 1 st Cardinality Keys- Primary, Secondary 1st -G1 Exercise on structured query Language 11 nd foreign, Alternative Keys etc and Relations 3rd Assignment on Relational Model nd - G Exercise on structured query Language Week 1 st Test 1st -G1 Exercise on Select Command with 1 nd Structured Query Language Data definition language : Create where clause Command 3 rd Data definition language : Alter & Drop nd - G Exercise on Select Command with commands where clause Week 1 st Data Manipulation Language (DML) 1st -G1 Exercise on Select Command using 13 nd Select command with where clause using conditional expressions and Boolean conditional expressions operator 3 rd Boolean operators nd - G Exercise on Select Command using conditional expressions and Boolean operator Week 14 1 st Group by clause & like operator 1st -G1 Exercise on Select Command with nd Insert Command group by clause and Like operator 3 rd Update and Delete commands nd - G Exercise on Select Command with group by clause and Like operator Week 1 st Assignment on DDL 1st -G1 Practice exercises on MS Access and 15 nd Assignment on DML SQL 3 rd Test nd - G Practice exercises on MS Access and SQL

10 Lesson Plan Name of the Faculty : MR. VIKRAM KUMAR Discipline : Computer Engg. Semester : nd Subject : Desktop Publishing Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Practical Day Topic Practical 1st Week 1st Overview of Desktop Publishing (DTP)/ Page Maker /Publisher/Scribus nd Overview of Desktop Publishing (DTP)/ Page Maker /Publisher/Scribus 3rd Using windows explorer and other windows elements & Creating and opening a document in page maker/publisher/scribus 4th Using windows explorer and other windows elements & Creating and opening a document in page maker/publisher/scribus Week 1st Formatting and editing a document & Saving and printing a given document nd Formatting and editing a document & Saving and printing a given document 3rd Insertion of text and graphics in a given document from external source 4th Insertion of text and graphics in a given document from external source Week 3 1st Using columns utility, to give the document column look & Using various fonts and styles to make a document more beautiful nd Using columns utility, to give the document column look & Using various fonts and styles to make a document more beautiful 3 rd Practice 4 th Practice Week 4 1 st Use of page maker to make transparencies nd Use of page maker to make transparencies 3 rd Formatting a given file by using undo/redo, repeat, cut, copy, paste, delete, duplicate and clone utilities 4 th Formatting a given file by using undo/redo, repeat, cut, copy, paste, delete, duplicate and clone utilities Week 5 1st Inserting objects in the drawing, aligning, ordering, grouping and ungrouping of those objects nd Inserting objects in the drawing, aligning, ordering, grouping and ungrouping of those objects 3 rd Use of combine, break apart, weld, intersection, trim and separate tools in a given drawing 4th Use of combine, break apart, weld, intersection, trim and separate tools in a given drawing Week 6 1 st Practice nd Practice 3 rd VIVA 4 th Viva Week 7 1 st Introduction - exploring Corel Draw screen - using dialog boxes, using roll ups, create/open file, save file -, import/export files, print file nd Introduction - exploring Corel Draw screen using dialog boxes, using roll ups, create/open file, save file, import/export files, print file 3 rd Use of ribbon bar, use of tool box, select object, shaping objects using zoom tool Week 8 4th Use of ribbon bar, use of tool box, select object, shaping objects using zoom tool 1 st setting multi-page document, undo/redo mistakes, repeat, cut, copy, paste, delete, duplicate, clone nd drawing, setting multi-page document, undo/redo mistakes, repeat, cut, copy, paste, delete, duplicate, clone 3rd Insert object, paste special, copy attributes from select all, drawing of layers, roll up, grid and scale set up, guideline set up 4th Insert object, paste special, copy attributes from select all, drawing

11 Week 9 1 st Practice nd Practice roll up, grid and scale set up, guideline set up 3rd Use of mode edit tools i.e. to line, to curve, to stretch, and rotate 4th Use of mode edit tools i.e. to line, to curve, to stretch, and rotate Week 10 1st Creating special effects i.e. transform roll-up, envelop roll up, nd Creating special effects i.e. transform roll-up, envelop roll up, 3rd Creating special effects i.e. add perspective, extrude roll up, contour roll up 4th Creating special effects i.e. add perspective, extrude roll up, contour roll up Week 11 1st Creating special effects i.e. power line, power clip, clear effects nd Creating special effects i.e. power line, power clip, clear effects 3rd Practice & VIVA 4th Practice & VIVA Week 1 1st To insert character and paragraph text in a drawing and frame nd To insert character and paragraph text in a drawing and frame 3rd Setting of tabs, indents, bullets and spacing in paragraph text 4th Setting of tabs, indents, bullets and spacing in paragraph text Week 13 1st Filling of text to a given path, aligning it to base line, straighten text and edit text nd Filling of text to a given path, aligning it to base line, straighten text and edit text 3rd Practice 4th Practice Week 14 1st Using tools such as spell checker, and thesaurus nd Using tools such as spell checker, and thesaurus 3rd Using find and replace text utility and type assist 4th Using find and replace text utility and type assist Week 15 1st Adding various symbols to a drawing and creating different patterns. nd Adding various symbols to a drawing and creating different patterns. 3rd Practice & VIVA 4 th Practice & VIVA

12 Name of the Faculty : MR. HIMANSHU KUMAR Discipline : Computer Engg. Lesson Plan Semester : 6 th Subject : EDM Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Lecture Day Topic (including assignments /tests) 1 st Week 1st Concept /Meaning and its need of Entrepreneurship nd Qualities and functions of entrepreneur 3rd Barriers in entrepreneurship Week 1 st Sole proprietorship and partnership forms of business organisations nd Schemes of assistance by entrepreneurial support agencies at National, State, KVIB, 3rd District level: NSIC Week 3 1st District level: NRDC & DC:MSME nd District level: SIDBI & NABARD, 3rd District level: Commercial Banks, SFC s TCO, KVIB, &DIC Week 4 1st Technology Business Incubator (TBI) and Science and Technology Entrepreneur Parks (STEP). nd Assignment on Entrepreneurship 3rd Test Week 5 1st Market Survey and Opportunity Identification nd Scanning of business environment 3rd Salient features of National and State industrial policies and resultant business opportunities Week 6 1st Types and conduct of market survey nd Assessment of demand and supply in potential areas of growth 3rd Identifying business opportunity Week 7 1st Considerations in product selection nd Assignment on Market Survey 3rd Test Week 8 1st Project report Preparation nd Preliminary project report 3rd Detailed project report including technical & economic feasibility Week 9 1st Detailed project report including market feasibility nd Common errors in project report preparations 3rd Exercises on preparation of project report Week 10 1st Assignment on project report nd Test 3 rd Introduction to Management: Definitions and importance of management Week 11 1st Functions of management: Importance and Process of planning, organising, staffing, directing and controlling nd Principles of management (Henri Fayol, F.W. Taylor) Concept and structure of an organisation Types of industrial organisations : a) Line organisation b) Line and staff organisation c) Functional Organisation 3rd Test Week 1 1st Leadership Definition and Need Qualities and functions of a leader Manager Vs leader Types of leadership nd Motivation : Definitions and characteristics Factors affecting motivation Theories of motivation (Maslow, Herzberg, McGregor) 3rd Assignment on Leadership & Motivation Week 13 1 st Test nd Management Scope in Different Areas : Human Resource Management Introduction and objective Introduction to Man power planning, recruitment and selection Introduction to performance appraisal methods 3rd Material and Store Management Introduction functions, and objectives ABC Analysis and EOQ Week 14 1st Marketing and sales

13 Introduction, importance, and its functions Physical distribution Introduction to promotion mix Sales promotion nd Financial Management Introductions, importance and its functions Elementary knowledge of income tax, sales tax, excise duty, custom duty and VAT 3 rd Assignment on Management Scope in Different Areas Week 15 1st Miscellaneous Topics : Customer Relation Management (CRM) nd Total Quality Management (TQM) Statistical process control Total employees Involvement Just in time (JIT) 3 rd Intellectual Property Right (IPR): Introductions, definition and its importance Infringement related to patents, copy right, trade mark

14 Name of the Faculty : MR. PRIYANK TYAGI Discipline : Computer Engg. Lesson Plan Semester : 4 th Subject : CO Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Lecture Day Theory Topic (including assignments /tests) 1 st Week 1st Hardware organisation of computer systembasic Principle: Basic about Computer System nd CPU organization : general register organisation rd Stack organization 3 4th Instruction formats : Introduction Week 1st three address, two address, nd one address, zero address 3rd RISC instruction 4th Addressing modes: Immediate, register Week 3 1st Direct, in direct,. nd relative, indexed 3rd CPU Design: Microprogrammed vs hard wired control. 4th CPU Design: Microprogrammed vs hard wired control. Week 4 1st Reduced instruction set computers Reduced instruction set computers nd Reduced instruction set computers Reduced instruction set computers 3rd CISC characteristics 4th RISC characteristics, Week 5 1st Comparison between CISC & RISC nd Assignment on CPU Organization 3rd Assignment on CPU Design 4th Discussion on unit 1 Week 6 1st Memory organization: Basics About Memory nd Memory Hierarchy 3rd RAM and ROM chips 4th Memory address map Week 7 1st Memory connections to CPU nd Auxillary memory : Magnetic disks 3rd Auxillary memory : magnetic tapes 4th Associative memory Week 8 1st Cache memory nd Virtual memory 3 rd Memory management hardware 4th Assignment on Memory Hierarchy Week 9 1st Assignment on Auxillary memory nd Test 3rd I/O organization: Basis Input output system(bios) 4th Function of BIOS Week 10 1st Testing and initialization nd Configuring the system 3rd Assignment on BIOS 4th Modes of Data Transfer Week 11 1st Programmed I/O nd Synchronous, asynchronous and interrupt initiated 3rd Synchronous, asynchronous and interrupt initiated 4th DMA data transfer Week 1 1st Assignment on modes of Data Transfer nd Test 3rd Architecture of multi processor systems : Introduction about Multi processor systems 4th Architecture of multi processor systems Week 13 1st Forms of parallel processing nd Parallel processing and pipelines 3rd Basic characteristics of multiprocessor 4th Assignment on multiprocessor System Week 14 1st General purpose multiprocessors nd Interconnection networks : time shared common bus 3rd multi port memory 4th cross bar switch Week 15 1st multi stage switching networks and hyper cube structures nd multi stage switching networks and hyper cube structures

15 3rd Assignment on Interconnection networks 4th Test

16 Name of the Faculty : MR.VIKRAM KUMAR Discipline : Computer Engg. Lesson Plan Semester : nd Subject : Computer Workshop Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Practical Day Topic Practical 1 st Week 1st Part-A (Hardware): Identify various computer components & Define various parts of computer. S nd Part-A (Hardware): Identify various computer components & Define various parts of computer. 3rd Describe and differentiate various Motherboard Processors, RAM, Secondary storage devices 4th Describe and differentiate various Motherboard Processors, RAM, Secondary storage devices Week 1st Install various components of computer &Maintain and repair (troubleshoot) various computer components. nd Install various components of computer &Maintain and repair (troubleshoot) various computer components. 3rd Serial and parallel ports, inkjet, USB Ports, SATA Fire wire 4th Serial and parallel ports, inkjet, USB Ports, SATA Fire wire Week 3 1st Bluetooth, Modems, connectors and cables nd Bluetooth, Modems, connectors and cables 3rd Dot matrix and Laser printers 4th Dot matrix and Laser printers Week 4 1st Assemble and de-assemble computer system. nd Assemble and de-assemble computer system. 3rd Identify various cables used for connection 4th Identify various cables used for connection Week 5 1st Practice nd Practice 3rd VIVA 4th VIVA Week 6 1st Introduction to Free and Open-Source Software nd Introduction to Free and Open-Source Software 3rd Install operating system MS-Window 4th Install operating system MS-Window Week 7 1st Install operating system Linux. nd Install operating system Linux. 3rd Diagnose the various faults in computer system i.e. SMPS 4th Diagnose the various faults in computer system i.e. SMPS Week 8 1st Diagnose the various faults in computer system i.e. HDD, RAM. nd Diagnose the various faults in computer system i.e. HDD, RAM. 3 rd Installation of latest version of application software MS-Office/open office.

17 4th Installation of latest version of application software like MS-Office/open office. Week 9 1st Practice nd Practice 3rd Installation of latest version of application software proprietary/free like Adobe Photoshop, Corel Draw 4th Installation of latest version of application software proprietary/free like Adobe Photoshop, Corel Draw Week 10 1st Installation of latest version of application software proprietary/free like Macromedia Flash etc. nd Installation of latest version of application software proprietary/free like Macromedia Flash etc. 3rd Viva 4th Viva Week 11 1st Installation and configuration of latest version of database software like Oracle/ MySQL/ SQL Server etc nd Installation and configuration of latest version of database software like Oracle/ MySQL/ SQL Server etc 3rd Installation and configuration of latest version of database software like Oracle/ MySQL/ SQL Server etc 4th Installation and configuration of latest version of database software like Oracle/ MySQL/ SQL Server etc Week 1 1st Introduction to Virus/Spyware/Worm/Trojan Horse nd Introduction to Virus/Spyware/Worm/Trojan Horse 3rd Introduction to Virus/Spyware/Worm/Trojan Horse & their detection 4th Introduction to Virus/Spyware/Worm/Trojan Horse & their detection Week 13 1st Introduction to Virus/Spyware/Worm/Trojan Horse, their detection, prevention and cure nd Introduction to Virus/Spyware/Worm/Trojan Horse, their detection, prevention and cure 3rd Installation, uninstallation and use of Antivirus software 4th Installation, uninstallation and use of Antivirus software Week 14 1st Practice nd Practice 3rd Viva 4th Viva Week 15 1st Visit to computer manufacturing industry nd Visit to computer manufacturing industry 3rd Workshop exercise 4 th Workshop exercise

18 Lesson Plan Name of the Faculty : Sh. MAHESH KUMAR Discipline : Computer Engg. Semester : 4 th Subject : Data Structure using C Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Practical Lecture Topic (including assignments /tests) Practical Topic Day Day 1 st Week 1 st Problem solving concept, Top-down 1 st G1 Exercise of C Programme and bottom-up design, structured programming nd Concept of data type, variables and nd - G Exercise of C Programme constants 3rd Introduction to data Structure( Linear, Non Linear, Primitive, Non Primitive)) Week 1 st Concept of Data Structure (Array, 1 st G1 Exercise of C Programme Linked List, Stack, Queue, Trees, Graphs) nd Concept of Arrays nd - G Programme regarding Array 3rd One dimensional Array, Two Dimensional Array: Representation of Two dimensional Array ( Base address, LB, UB ) Week 3 1 st Operational on Arrays with Algorithms 1 st G1 Programme regarding Array (inserting, deleting ) nd Operational on Arrays with Algorithms (Searching, Traversing 3 rd Introduction to linked list and double linked list, Representation of Linked list nd - G Programme regarding Array in Memory Week 1 st Describe and Comparison between 4 Linked list and Array 1st G1 Programme of Matrices nd Traversing and Searching Linked List 3 rd Insertion and deletion into Linked list nd - G Programme of Matrices Week 1 st Application of Linked List and Explain 1st G1 Programme of addition of two 5 Doubly Linked List Matrices using function nd Traversing, Insertion and deletion into doubly Linked List 3 rd Introduction to Stack, Representation nd - G Programme of addition of two of Stacks With Array and Linked list Matrices using function Week 1 st Implementation of Stacks 1st G1 Programme of inserting and deleting 6 elements in array nd Application of stack ( Polish Notation, Converting Infix to Post Fix Notation) 3 rd Evaluation of Post fix Notation and nd - G Programme of inserting and deleting Tower of Hanoi elements in array Week 1 st Recursion : Concept and Comparison 1st G1 Programme of Push and POP 7 between recursion and Iteration Operation in stack nd Introduction of Queues and Implementation of queues ( array and Linked list with algorithm) 3 rd Introduction of Queues and nd - G Programme of Push and POP Implementation of queues ( array and Operation in stack Linked list with algorithm) Week 1 st Explain Circular Queues and De-Queues 1st G1 Programme of Conversion from in-fix 8 nd Introduction of Trees and Concept of notation Binary Trees 3 rd Explain Complete and Extended Binary nd - G Programme of Conversion from in-fix Tree notation Week 1 st Concept of representation of Binary 1st G1 Programme of the Factorial of given 9 Tree number using recursion nd Concept of representation of balanced Binary Tree

19 3 rd Explain Traversing Binary Trees (Pre nd - G Programme of the Factorial of given Order, Post Order and In Order) number using recursion Week 1 st Explain Searching, inserting and 1st G1 Insertion and Deletion of elements in 10 deleting in binary seary trees Queue and Circular Queue using nd Explain Searching, inserting and Pointer deleting in binary seary trees 3 rd Problems Solution nd - G Insertion and Deletion of elements in Queue and Circular Queue using Pointer Week 1 st Test 1st G1 Insertion and Deletion of elements in 11 nd Problems Solution Linked List and doubly Linked list 3rd Previous topic Explain nd - G Insertion and Deletion of elements in Linked List and doubly Linked list Week 1 st Introduction of Sorting and Searching 1st G1 Programme of Linear Search 1 nd Search algorithm( Linear and Binary) procedures to search an element in given list 3 rd Search algorithm( Linear and Binary) nd - G Programme of Binary Search procedures to search an element in given list Week 1 st Concept and uses of Sorting 1st G1 Previous Problems solution 13 nd Sorting Algorithm (Bubble sort ) 3 rd Sorting Algorithm (Insertion sort ) nd - G Previous Problems solution Week 1 st Sorting Algorithm (Selection sort ) 1st G1 Programme of Bubble Sort 14 nd Sorting Algorithm (Merge Sort ) 3 rd Sorting Algorithm (Radix sort ) & nd - G Programme of Bubble Sort Sorting Algorithm ( Heap Sort ) Week 1 st Problems Solution 1st G1 Programme of Selection Sort 15 nd Problems solution 3 rd Test nd - G Programme of Selection Sort

20 Lesson Plan Name of the Faculty : MISS. AARTI MOR/ SUSHIL KUMAR Discipline : Computer Engg. Semester : 4 th Subject : MPD Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Theory Practical Lecture Topic (including assignments /tests) Practical Topic Day Day 1 st Week 1 st Evolution of Microprocessor : 1st G1 Familiarization of different keys of Typical organization of a microcomputer 8085 microprocessor kit and its system and functions of its various memory map blocks. nd Microprocessor, its evolution & function 3 rd Its impact on modern society nd - G Familiarization of different keys of 4th Assignment on organization of 8085 microprocessor kit and its microcomputer & Test memory map Week 1 st Architecture of a Microprocessor : 1st G1 Steps to enter, modify Concept of Bus, bus organization of 8085 data/program and to execute a nd Functional block diagram of 8085 programme on 8085 kit 3 rd function of each block nd - G Steps to enter, modify 4th Pin details of 8085 data/program and to execute a programme on 8085 kit Week 3 1 st Pin details of 8085 and related signals, 1st G1 Writing and execution of ALP for nd Demultiplexing of address/data bus addition and sub station of two 8 bit numbers 3 rd Generation of read/write control signals nd - G Writing and execution of ALP for 4th Steps to execute a stored Programme addition and sub station of two 8 bit numbers Week 4 1 st Revision of Functional block diagram of 1st G1 Writing and execution of ALP for 8085 multiplication nd Revision of Pin diagram 3 rd Revision of Pin details nd - G Writing and execution of ALP for th Test multiplication 4 Week 5 1 st Instruction Timing and Cycles : 1st G1 Writing and execution of ALP for Instruction cycle, machine cycle and T- division of two 8 bit numbers states nd Fetch and execute cycle 3 rd Revision &Test nd - G Writing and execution of ALP for 4th Programming (with respect to 8085 microprocessor) : Brief idea of machine division of two 8 bit numbers and assembly languages Week 6 1 st Machines and Mnemonic codes 1st G1 Writing and execution of ALP for nd Instruction format and Addressing mode arranging 10 numbers in ascending order 3 rd Identification of instructions as to which nd - G Writing and execution of ALP for addressing mode they belong. arranging 10 numbers in ascending 4th Concept of Instruction set. Explanation of the instructions order of the following groups of instruction set Week 7 1 st Data transfer instructions 1st G1 Writing and execution of ALP for nd Arithmetic instructions arranging 10 numbers in descending order 3 rd Arithmetic instructions nd - G Writing and execution of ALP for 4th Logical arranging 10 numbers in Instructions descending order Week 8 1 st Logical 1st G1 Writing and execution of ALP for 0 Instructions to 9 BCD counters (up/down nd Stack related instructions counter according to choice stored in memory) 3 rd Machine Control Group nd - G Writing and execution of ALP for 0 to 9 BCD counters (up/down 4 th Programming exercises in assembly counter according to language. choice stored in memory) Week 9 1 st Programming exercises in assembly 1st G1 Interfacing exercise on 855 like

21 language. LED display control nd Assignment on Assembly Language Programming 3 rd Revision & Test nd - G Interfacing exercise on 855 like 4th Memories and I/O interfacing : Concept of memory mapping LED display control Week 10 1 st Partitioning of total memory space 1st G1 Interfacing exercise on 853 nd Address decoding programmable interval timer 3 rd Address decoding nd - G Interfacing exercise on 853 4th concept of peripheral mapped I/O and programmable interval timer memory mapped I/O Week 11 1 st Interfacing of memory 1st G1 Interfacing exercise on 879 mapped I/O devices. programmable KB/display interface like to display the hex nd Interfacing of memory code of key pressed on display mapped I/O devices. 3 rd Assignment on Memory Mapping with nd - G Interfacing exercise on 879 different examples programmable KB/display interface 4th Test like to display the hex code of key pressed on display Week 1 1 st Interrupts : Concept of interrupt 1st G1 Use of 8085 emulator for hardware nd Maskable and non-maskable testing 3 rd Edge triggered and level triggered nd - G Use of 8085 emulator for hardware Interrupts testing 4th Software interrupt & Various hardware interrupts of 8085 Week 13 1 st Restart interrupts and its use 1st G1 Writing and execution of ALP for nd Servicing interrupts 1 s & s complement of an 8 bit number 3 rd extending interrupt system nd - G Writing and execution of ALP for 4th Data Transfer Techniques : Concept of 1 s & s complement of an 8 bit programmed I/O operations number Week 14 1 st sync data transfer, async data transfer 1st G1 Writing and execution of ALP shift (hand left & right of an 8 bit number by shaking) 1bit nd Interrupt driven data transfer & DMA 3 rd Serial output data & Serial input data nd - G Writing and execution of ALP shift 4th Peripheral devices : 855 PPI left & right of an 8 bit number by 1bit Week 15 1 st 853 PIT 1st G1 Addition and subtraction of two 16- nd 857 / 837 DMA controller bit numbers 3 rd 879 Programmable KB/Display nd - G Addition and subtraction of two 16- Interface bit numbers 4th 851 Communication Interface Adapter

22 Lesson Plan Name of the Faculty : MISS. AARTI MOR Discipline : Computer Engg. Semester : 6 th Subject : Project Lesson plan duration : 15 weeks (from January, 018 to April, 018) Week Practical Day Topic 1 st Week 1 st -G1 Selection of Project nd - G Selection of Project Week 1 st -G1 Finalization of Project Practical nd - G Finalization of Project Week 3 1 st -G1 Outline of Project nd - G Outline of Project Week 4 1 st -G1 Planning of Project nd - G Planning of Project Week 5 1 st -G1 Execution of Project nd - G Execution of Project Week 6 1 st -G1 Execution of Project nd - G Execution of Project Week 7 1 st -G1 Execution of Project nd - G Execution of Project Week 8 1 st -G1 Execution of Project nd - G Execution of Project Week 9 1 st -G Execution of Project nd -G Execution of Project Week 10 1 st -G1 Providing Solution of Problems nd - G Providing Solution of Problems Week 11 1 st -G1 Production of Final Executed project nd - G Production of Final Executed project Week 1 1 st -G1 Checking of Final Project nd - G Checking of Final Project Week 13 1 st -G1 Report writing nd - G Report writing Week 14 1 st -G1 Seminar nd - G Seminar Week 15 1 st -G1 Viva-Voce nd - G Viva-Voce

23 Name of the Faculty Discipline Semester : MISS. AARTI MOR : Computer Engineering : IV Lesson Plan Work Load (Lecture /Practical) per week (in hours): Lectures 03, Practical 06) Note: G1 and G are the respective Groups of students Subject : OBJECT ORIENTED PROGRAMMING USING C++ Lesson Plan Duration : 15 weeks (From January, 018 to April,018) Week Theory Practical Lecture Topic (Including Assignment/ Test) Practical Topic Day Day 1 st 1 st Unit 1: Introduction and Features 1st (G1) Write a function using variables as arguments 1 Fundamentals of object oriented programming to swap the values of a pair of integers procedure oriented programming Vs. object oriented programming (OOP) nd Object oriented programming concepts nd Write a function using variables as arguments Classes, reusability, encapsulation, to swap the values of a pair of integers inheritance, polymorphism, dynamic binding, message passing, Data Hiding 3 rd Benefits of OOPs and its Application 3rd (G1) 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 would 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. 4 th 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 would 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. nd 1 st Unit : Language Constructs 1st (G1) 1. Write a program to read name, roll Review of constructs of C used in C++: no,internal external marks using variables, types and type declarations, user classes and display the same on the defined data types screen. nd increment and decrement operators, relational nd 1. Write a program to read name, roll and logical operators no,internal external marks using classes and display the same on the screen. 3 rd if then else clause; conditional expressions, input 3rd (G1) Write a program of swapping of numbers by accessing private numbers using friend and output statement function. 4 th Write a program of swapping of numbers by accessing private numbers using friend function. 3 rd 1 st loops, arrays, switch structure, case, unions, functions, pointers; 1st (G1) Define a class to represent a bank account using constructor including the following preprocessor directives and Header Files members:- 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 function - To assign initial values - To deposit an amount - To withdraw an amount after checking the balance - To display the name and balance.

24 nd Scope Resolution Operator Managing Console nd Define a class to represent a bank account I/O Operations; C++ Stream using constructor including the following members:- 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 function - To assign initial values - To deposit an amount - To withdraw an amount after checking the balance - To display the name and balance. 3 rd Unformatted and Formatted Console I/O 3rd (G1) Create classes OM and DB which store the value of distance. DM store distances in Meters and cm and DB in feet and inches. Write a program that can read values for the class objects and add 1 object OM with another object of DB. Use a friend function to carry out 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 results are required. The display should be in the format of feet and inches or meters and cms depending on the object on display. 4th Create classes OM and DB which store the value of distance. DM store distances in Meters and cm and DB in feet and inches. Write a program that can read values for the class objects and add 1 object OM with another object of DB. Use a friend function to carry out 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 results are required. The display should be in the format of feet and inches or meters and cms depending on the object on display. 4 th 1 st Revision of Unit 1 and Unit 1st A book shop maintains the inventory of books (G1) that are being sold at the shop the list includes details such as author, title and 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 ornot. If it is not, a appropriate message is displayed, if it is, then the system displays the book details and requests for the number of copies require. If the requested are 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 suitable member functions and constructors. Use new operator in constructor to allocate memory space require. nd Unit 3: Classes and Objects nd A book shop maintains the inventory of books Creation, accessing class members, Private Vs that are being sold at the shop the list Public includes details such as author, title and 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 ornot. If it is not, a appropriate message is displayed, if it is, then the system displays the book details and requests for the number of copies require. If the requested are 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 suitable member functions and constructors. Use new operator in constructor to allocate

25 memory space require. 3 rd Constructor and Destructor with and without 3rd Previous program Continued Arguments, Objects (G1) 4th Previous program Continued 5 th 1 st Dynamic memory Allocation with new and 1st Define a class string that could work as a user Delete Operator (G1) defined string type include constructors that will enable us to create an.un-initialized string String s1; :/ string with length 0 And also to initialize an object with string constant at the time of creation like String s("well done");. Include a function that adds two strings to make a third string. nd Revision nd Define a class string that could work as a userdefined string type include constructors that will enable us to create an.un-initialized string String s1; :/ string with length 0 And also to initialize an object with string constant at the time of creation like String s("well done");. Include a function that adds two strings to make a third string. 3 rd Revision 3rd Previous program Continued (G1) 4th Previous Program Continued 6 th 1 st Unit 4: Member Function 1st Create a class float that contains float data (G1) member. Over load all the 4 arithmetic operators so that do operate on the objects of float. nd Method definition nd Create a class float that contains float data member. Over load all the 4 arithmetic operators so that do operate on the objects of float. 3 rd Inline Implementation, Constant member 3rd Previous Program Continued functions (G1) 4th Previous Program Continued 7 th 1 st Static Function, This Pointer 1st Programming Exercise on Hybrid Inheritance (G1) nd Friend Function and its Characteristics nd Programming Exercise on Hybrid Inheritance 3 rd Revision 3rd Previous Program Continued (G1) 4 th Previous Program Continued 8 th 1 st Unit Introduction 5: Overlaoding to Operator Member Overloading, Function Need of 1 st (G1) Define classes POLAR and RECTANGLE operator overloading to represent points in the POLAR and RECTANGLE systems. Use conversion routines to convert from one system to the other. nd prefix and postfix, nd Define classes POLAR and RECTANGLE overloading binary operators to represent points in the POLAR and instream/outstream operator overloading RECTANGLE systems. Use conversion routines to convert from one system to the other. 3 rd Constructor 3rd Previous Program Continued Overloading, Type Conversion, Rules of (G1) Operator Overloading 4th Previous Program Continued 9 th 1 st Comparison between 1st Previous Program Continued Function Overloading and overriding (G1) nd Unit Definition 6: Inheritance of inheritance, Types of inheritance; nd Previous Program Continued Single inheritance, hierarchical inheritance, multiple inheritance, hybrid inheritance

26 3 rd protected data, private data, 3rd Create a base class called shape. use this class public/data, inheriting constructors and (G1) to store two double type values that could destructors 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, Using these 3 classes design a program that will accept dimension of RECTANGLE or TRIANGLE interactivity and display the area. Remember the values given as input will be treated as length of sides in the case of rectangle and as base and height in the case of triangles and used as follows: Area of rectangle = x*y Area of triangle = 1/ *x*y 4th 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, Using these 3 classes design a program that will accept dimension of RECTANGLE or TRIANGLE interactivity and display the area. Remember the values given as input will be treated as length of sides in the case of rectangle and as base and height in the case of triangles and used as follows: Area of rectangle = x*y Area of triangle = 1/ *x*y 10 th 1 st constructor for virtual base classes, 1st Previous Program Continued constructors and destructors of derived classes, (G1) and virtual functions nd size of a derived nd Previous Program Continued class, order of invocation, 3 rd Revision 3rd Previous Program Continued (G1) 4th Previous Program Continued 11 st 1 st Unit Importance 7:Polymorphism of virtual function, and Virtual function Functions call 1st (G1) Previous Program Continued binding nd virtual functions nd Previous Program Continued 3 rd implementing late 3rd Previous Program Continued binding (G1) 4th Previous Program Continued 1 th 1 st need for virtual functions, abstract base classes 1st Exercise on file handling (G1) nd pure virtual functions, nd Exercise on file handling 3 rd virtual destructors 3rd Exercise on file handling (G1) 4th Exercise on file handling 13 th 1 st Revision 1st Exercise on file handling (G1) nd Unit Components 8: File and of a Stream file, different operation of the nd Exercise on file handling file 3 rd communication in files, creation of 3rd Exercise on file handling file streams (G1) 4th Exercise on file handling 14 th 1 st stream classes, headerfiles, updating of file, 1 st Exercise on file handling (G1)