LESSION PLAN. Topic Practical Day Topic

Size: px

Start display at page:

Download "LESSION PLAN. Topic Practical Day Topic"

Caitlin Edwards
5 years ago
Views:

1 LESSION PLAN Name of Faculty : Sushma Yadav Discipline : Computer Science and Engineering Semester : 4 th Subject : Computer Architecture and Organization Lesson Plan duration : 15 weeks Work Load : Lecture-03, Practical-0 Week Theory Practical Lecture Day Topic Practical Day Topic 1 st 1 st Boolean algebra and Logic gates 2 nd Combinational logic blocks(adders, Multiplexers, Encoders, de-coder) 3 rd Sequential logic blocks(latches, Flip-Flops) 2 nd 1 st Registers, Counters 2 nd Store program control concept, Flynn s classification of computers (SISD, MISD, MIMD) 3 rd digital logic, micro architecture, ISA, operating systems 3 rd 1 st high level language; structured organization; CPU, caches, main memory, secondary memory units 2 nd Performance metrics: MIPS, MFLOPS 3 rd Instruction set based classification of processors (RISC, CISC, and their comparison) 4th 1 st addressing modes: register, immediate, direct, indirect, indexed 2 nd Operations in the instruction set Arithmetic and Logical, Data Transfer, Control Flow 3 rd Instruction set formats (fixed, variable, hybrid) 5th 1 st Language of the machine: 8086 ; simulation using MSAM 2 nd Basic non pipelined CPU Architecture and Memory Hierarchy & I/O Techniques 3 rd CPU Architecture types (accumulator, register, stack, memory/ register) 6 th 1 st detailed data path of a typical register based CPU, Fetch-Decode-Execute cycle 2 nd microinstruction sequencing 3 rd implementation of control unit 7 th 1 st Enhancing performance with pipelining 2 nd The need for a memory hierarchy (Locality of reference principle) 3 rd Cache, main memory and secondary memory 8 th 1 st Memory parameters: access/ cycle time, cost per bit) 2 nd Main memory (Semiconductor RAM & ROM organization, memory expansion, Static & dynamic memory types) 3 rd Cache memory (Associative & direct mapped cache organizations 9 th 1 st Introduction to Parallelism and Computer Organization [80x86]

2 2 nd Goals of parallelism (Exploitation of concurrency, throughput enhancement) 3 rd Amdahl s law 10 th 1 st Instruction level parallelism 2 nd Instruction level parallelism 3 rd Processor level parallelism (Multiprocessor systems overview). 11 th 1 st Instruction codes 2 nd computer register 3 rd computer instructions 12 th 1 st timing and control 2 nd instruction cycle 13 th 1 st type of instructions 2 nd memory reference 3 rd register reference. I/O reference 14 th 1 st Basics of Logic Design, accumulator logic 2 nd Control memory, 15 th 1 st address sequencing, micro-instruction formats, micro-program sequencer, Stack Organization 2 nd Instruction Formats, Types of interrupts; Memory Hierarchy

3 LESSION PLAN Name of Faculty : Dr. Rajeev Yadav Discipline : Computer Science and Engineering Semester : 4 th Subject : Database Management System Lesson Plan duration : 15 weeks Work Load : Lecture-03, Practical-15 Week Theory Practical Lecture Topic Practical Topic Day Day 1 st 1 st Introduction, Client Server Arch., 1 st Introduction to Structure Query 2 nd E-R Diagram and Keys Overview of database Management System; Various views of data, data Models Language. 3 rd Advantages of DBMS over file processing systems, 2 nd 1 st Responsibility of Database Administrator 2 nd Study of various DDL command along with Implementation 2 nd Introduction to Client/Server architecture 3 rd Three levels architecture of Database Systems 3 rd 1 st ER Diagram (Entity Relationship) 3 rd CREATE a table using DDL Command 2 nd mapping Constraints, Keys 3 rd Reduction of E-R diagram into tables. 4th 1 st Test & Assignment with Problem 4 th Study of various SELECT Command discussion. 2 nd Section-B:- Introduction to File Organization and Relational Model and Calculus: 3 rd Sequential Files 5th 1 st index sequential files 5 th To perform INSERT Command. 2 nd direct files 3 rd Hashing 6 th 1 st B-trees Index files 6 th To perform UPDATE Command 2 nd Relational Model 3 rd Relational Algebra 7 th 1 st various operations 7 th To perform ALTER Command 2 nd Table Joins 3 rd Modify, Update, 8 th 1 st Drop Commands 8 th To perform DROP Command. 2 nd DDL/DML operations 3 rd Various SQL Operations & Commands 9 th 1 st Relational Calculus 9 th To perform various relational 2 nd Tuple Calculus 3 rd Test & Assignment with Problem operator (AND & OR) on SQL QUERY

4 discussion 10 th 1 st 2 nd Section C; Introduction to Query Languages : QLB 10 th To perform DISTINCT,ORDER BY,LIKE,IN operations on table database 3 rd QBE 11 th 1 st Structured query language with special reference 2 nd SQL of ORACLE 3 rd integrity constraints 12 th 1 st functional dependencies 12 th To perform SQL JOIN on two table 2 nd NORMALISATION 3 rd NORMALISATION types 13 th 1 st up to 4th Normal forms 2 nd BCNF (Boyce code normal forms) 3 rd Test & Assignment with Problem discussion 14 th 1 st SECTION D: Introduction to Distributed Data processing 2 nd parallel Databases, data mining & data warehousing 3 rd network model & hierarchical model, 15 th 1 st Introduction to transaction, properties of transaction life cycle of transaction, Introduction to Concurrency control 2 nd Recovery systems., need of concurrency control 3 rd recovery system, problems in concurrent transactions 11 th To perform UNION operation and INTERSECTION operation on two table of database of database 13 th To implement the concept of Sub queries 14 th To implement the concept of grouping of data 15 th To implement the concept of Indexes and Views

5 Lesson Plan Name of Faculty : Dr. Gundeep Tanwar Discipline : Computer Science Engineering Semester : IV Subject : Internet Fundamental (CSE 208 F), Internet Lab (CSE 214 F) Lesson Plan Duration : January 2018 to April 2018 Work Load( Lecture / Practical per week ) : Lectures 3 Week Theory (Internet Fundamental (CSE 208 F) ) Practical (Internet Lab (CSE 214 F)) Lecture Day Topic(Including Assignment Test) 1st 1 Section A : Electronic Mail, Introduction, advantages and disadvantages 2 addresses, message components, message composition, mailer features 3 inner workings Practical Day Topic 1 Practical involving Sending and receiving of mails. 2nd 4 management 2 Practical involving communication using FTP and Tel net server 5 Mime types, Newsgroups, mailing lists, chat rooms 6 Introduction to networks and internet, history, Working of Internet 3rd 7 Internet Congestion, internet culture, business culture on internet 3 WAP to make a web page that make use of simple text edititng tags. 8 Collaborative computing & the internet 9 Modes of Connecting to Internet, Internet Service Providers(ISPs) 4th 10 Internet address, standard address, domain name, DNS 4 WAP to make a web page using the anchor tag 11 IP.v6.Modems and time continuum 12 Communications software, internet tools. 5th 13 Assignment / Test 5 WAP to make a web page using image tag 14 Section B : Introduction World Wide Web 15 Web Browser details, searching the www

6 6th 16 Directories search engines and meta search engines 6 WAP to make a web that show different types of list 17 Search fundamentals, search strategies 18 Working of the search engines 7th 19 Telnet and FTP 7 WAP to make a web page that includes a table. 20 Introduction to Browser 21 Coast-to-coast surfing 8th 22 Hypertext markup language 8 WAP to make a form 23 Web page installation, Web page setup 24 Basics of HTML & formatting and hyperlink creation 9th 25 Using FrontPage Express, 9 WAP that divides the web page into different frames 26 Plug-ins 27 Assignment / Test 10 th 28 Section C : Basic and advanced HTML java script language 10 WAP in java script to display the factorial of a number 29 Java script language 30 Client and Server Side Programming in java script 11 th 31 Forms and data in java script 11 WAPin Javascript to display the multication table 32 XML basics 33 Introduction to Web Servers 12 th 34 PWS 12 WAP in javascript that showsthe Prompt, Confirm and Alert dialog 35 IIS, Apache box. 36 Microsoft Personal Web Server 13 th 37 Accessing & using these servers 13 WAP in Javascript to show validation

7 38 Assignment / Test in form 39 Section D :Introduction to Privacy and security 14 th 40 Software Complexity 14 WAP in XML to create a list 41 Encryption schemes 42 Secure Web document 15 th 43 Digital Signatures 15 Practise / Test 44 Firewalls 45 Assignment / Test

8 Lesson Plan Name of Faculty : Dr. Gundeep Tanwar Discipline : Computer Science Engineering Semester : IV Subject : OOPS Using C++(IT 202F), C++ Programming Lab ( IT 206 F) Lesson Plan Duration : January 2018 to April 2018 Work Load( Lecture / Practical per week ) : Lectures 3, Practical 2 Week Theory ( OOPS Using C++(IT 202F)) Practical (C++ Programming Lab ( IT 206 F) ) Lecture Day Topic(Including Assignment Test) Practical Day 1st 1 Section A : C++ Standard Library 1 WAP gets values from the user to test power function. 2 Basics of a Typical C++ Environment, Preprocessors Directives 3 Simple C++ Programs. Header Files and Namespaces, library files Topic 2nd 4 Introduction to Objects and Object Oriented Programming 5 Encapsulation (Information Hiding) 6 Access Modifiers: Controlling access to a class, method 2 A point on the two dimensional plane can be represented by two numbers: X coordinate and Y coordinate. For example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis. The sum of two points can be defined as a new point whose X coordinate is the sum of the X coordinates of the points and whose Y coordinate is the sum of their Y coordinates. Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1 : 3 4 Enter coordinates for P2 : 5 7 Coordinates of P1 + P2 are : 8, 11 3rd 7 Polymorphism: Overloading,, Inheritance, Overriding Methods 8 Abstract Classes, Reusability, Class s Behaviors 9 Assignment / Test 3 Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator, and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select the operation). Finally it should display the result. When it finishes the calculation, the program should ask if the user wants to do another

9 4th 10 Section B: Structure Definitions, Accessing Members of Structures 11 Class Scope and Accessing Class Members 12 Separating Interface from Implementation, Controlling Access Function And Utility Functions calculation. The response can be Y or N. Some sample interaction with the program might look like this. Enter first number, operator, second number: 10/ 3 Answer = Do another (Y/ N)? Y Enter first number, operator, second number Answer = 112 Do another (Y/ N)? N 4 A phone number, such as (212) , can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look like this: Enter your area code, exchange, and number: My number is (212) Your number is (415) th 13 Initializing Class Objects: Constructor, Using Default Arguments With Constructors 14 Using Destructors 15 Classes : Const(Constant) Object And Const Member Functions 5 Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM object or DB object, depending on the units in which the results are required. The display should be in the format of feet and inches or metres and centimetres depending on the object on display. 6th Object as Member of Classes Friend Function and Friend Classes 6 Create a class rational which represents a numerical value by two double values- NUMERATOR & DENOMINATOR. Include the following public member Functions: 18 Using This Pointer, Dynamic Memory Allocation with New and Delete -constructor with no arguments (default) -constructor with two arguments - void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator

10 - Overload + operator to add two rational number - Overload >> operator to enable input through cin - Overload << operator to enable output through cout Write a main ( ) to test all the functions in the class. 7th 19 Static Class Members 7 Consider the following class definition 20 Container Classes And Integrators 21 Proxy Classes class father { protected : int age; Public: father (int x) { age = x; } virtual void iam ( ) { cout < < I AM THE FATHER, my age is : << age<< end1; } }; Derive the two classes son and daughter from the above class and for each, define iam ( ) to write our similar but appropriate messages. You should also define suitable constructors for these classes. Now, write a main ( ) that creates objects of the three classes and then calls iam ( ) for them. Declare pointer to father. Successively, assign addresses of objects of the two derived classes to this pointer and in each case, call iam ( ) through the pointer to demonstrate polymorphism in action. 8th 22 Function overloading 8 Write a program that creates a binary file by reading the data for the students from the 23 Assignment / Test 24 Section C : Fundamentals of Operator Overloading, Restrictions On Operators Overloading terminal. The data of each student consist of roll no., name ( a string of 30 or lesser no. of characters) and marks. 9th 25 Operator Functions as Class Members vs. as Friend Functions 26 Overloading, <<, >> Overloading Unary Operators, Overloading Binary Operators 27 Introduction to Inheritance, Base Classes And Derived Classes, Protected Members 9 A hospital wants to create a database regarding its indoor patients. The information to store include a) Name of the patient b) Date of admission c) Disease d) Date of discharge Create a structure to store the date (year, month and date as its members). Create a base class to store the above information. The member function should include functions to

11 enter information and display a list of all the patients in the database. Create a derived class to store the age of the patients. List the information about all the to store the age of the patients. List the information about all the pediatric patients (less than twelve years in age). 10 th 28 Casting Base- Class Pointers to Derived- Class Pointers, Using Member Functions 29 Overriding Base Class Members in a Derived Class, Public, Protected and Private Inheritance 30 Using Constructors and Destructors in derived Classes 10 th Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Add an instance variable, named department, of type string. Supply a method to tostring that prints the manager s name, department and salary. Make a class Executive inherit from Manager. Supply a method to String that prints the string Executive followed by the information stored in the Manager superclass object. Supply a test program that tests these classes and methods. 11 th 31 Implicit Derived Class Object To Base-Class Object Conversion 32 Composition Vs. Inheritance 33 Introduction to Virtual Functions 11 th Imagine a tollbooth with a class called toll Booth. The two data items are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected. A constructor initializes both these to 0. A member function called payingcar ( ) increments the car total and adds 0.50 to the cash total. Another function, called nopaycar ( ), increments the car total but adds nothing to the cash total. Finally, a member function called displays the two totals. Include a program to test this class. This program should allow the user to push one key to count a paying car, and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit. 12 th 34 Abstract Base Classes And Concrete Classes 12 th Write a function called reversit ( ) that reverses a string (an array of char). Use a for loop that 35 Polymorphism, New Classes And Dynamic Binding, Virtual Destructors, Dynamic Binding 36 Assignment / Test swaps the first and last characters, then the second and next to last characters and so on. The string should be passed to reversit ( ) as an argument. Write a program to exercise reversit ( ). The program should get a string from the user, call reversit ( ), and print out the result. Use an input method that allows embedded blanks. Test the program with Napoleon s famous phrase, Able was I ere I saw Elba). 13 th 37 Section D : Files and Streams, Sequential 13 th Create some objects of the string class, and put

12 Access File, Updating Sequential Access Files them in a Deque-some at the head of the Deque and some at the tail. Display the 38 Random Access Files, Reading Data Sequentially from a Random Access File 39 Stream Input/Output Classes and Objects, Stream Manipulators, Stream Format States, Stream Error States. 14 th 40 Function Templates, Overloading Template Functions, Class Template 41 Templates and Inheritance, Templates and Friends, Templates and Static Members. 42 Exception Handling: Try Throw, Catch, Throwing an Exception, Catching an Exception, Rethrowing an Exception, Exception specifications contents of the Deque using the foreach ( ) function and a user written display function. Then search the Deque for a particular string, using the first That ( ) function and display any strings that match. Finally remove all the items from the Deque using the getleft ( ) function and display each item. Notice the order in which the items are displayed: Using getleft ( ), those inserted on the left (head) of the Deque are removed in last in first out order while those put on the right side are removed in first in first out order. The opposite would be true if getright ( ) were used. 14 th Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a member function get_data ( ) to initialize base class data members and another member function display_area ( ) to compute and display the area of figures. Make display_area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements. 15 th 43 Stack Unwinding 15 th Practise / Lab Test Using these three classes, design a program that will accept dimensions of a triangle or a rectangle interactively and display the area. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle = x * y Area of triangle = ½ * x * y 44 Constructors, Destructors and Exception Handling, Exceptions and Inheritance 45 Assignment / Test

13 Lesson Plan Ms. NAME OF FACULTY: Khushboo Yadav Computer Science and DISCIPLINE: Engineering SEMESTER: IV Programming SUBJECT: languages LESSON PALN DURATION: 15 WEEKS (from FEB 2018 to MAY 2018) Week Theory Practical Lectur Practical Topics (including assignment and tests) e day day Topic 1 Syntactic and semantic rules of a Programming language 1 2 Programming language translators compiler & interpreters 3 Characteristics of a good programming language 4 Elementary data types 2 5 data objects, variable & constants data types 6 Specification of elementary data types 7 implementation of elementary data types 3 8 Declarations of data type 9 Type checking & type conversions 10 Assignment & initialization 4 11 Numeric data types 12 enumerations 5 13 Booleans & characters

14 14 Structured data objects & data types 15 specification of structured data types, 16 Declaration of data structure 6 17 implementation of structured data types 18 type checking of data structure 19 vector & arrays, 7 20 variable size data structures 21 Union pointer data objects 22 programmer defined data objects 8 23 sets,files 24 Evolution of data type concept 25 abstraction 9 26 encapsulation & information hiding 27 Subprograms type definitions type definitions 28 type definitions abstract data types Sequence Control and Data Control 30 Implicit sequence control explicit sequence control 31 sequence control within expressions sequence control within statement 33 Subprogram sequence control simple call return

15 34 recursive subprograms Exception & exception handlers co routines, sequence control Names & referencing environment static & dynamic scope Local data & local referencing environment Shared data: dynamic & static scope Parameter & parameter transmission schemes Storage Management, Programming languages 39 Major run time elements requiring storage programmer and system controlled storage management & phases Static storage management Stack based storage management Heap storage management variable & fixed size elements Introduction to procedural, nonprocedural structured, functional object oriented programming language 45 Comparison of C & C++ programming languages

DBMS Lesson Plan. Name of the faculty: Ms. Kavita. Discipline: CSE. Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F)

DBMS Lesson Plan. Name of the faculty: Ms. Kavita. Discipline: CSE. Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F) DBMS Lesson Plan Name of the faculty: Ms. Kavita Discipline: CSE Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F) Week No Lecture Day Topic (including assignment/test) 1 1 Introduction to Database