theory 1 2 3 instruction formats (three address, two … plan 4th sem computer engg.pdf · 56 8253...

Lesson Plan

Name of Faculty : Vipul Pant Discipline : Computer Engg. Semester : 4th Subject : Computer Organisation Lesson Plan Duration : 15 Weeks ( From January 2018 to April 2018 )

Week Theory

Lecture Day

Topic (including assignment/test )

1st 1 Introduction to Whole Subject and about Books recommended

2 CPU organisation : general register organisation

3 CPU organisation : stack organisation

4 Instruction Formats (three address, two address)

2nd 1 Instruction Formats ( one address, zero address)

2 RISC instruction

3 Addressing modes: Immediate, register

4 Addressing modes: direct, in direct, relative, indexed.

3rd 1 Assignment

2 CPU Design : Microprogrammed Control

3 CPU Design : Hard wired Control

4 CPU Design : Microprogrammed vs hard wired control

4th 1 Reduced instruction set computers (RISC)

2 RISC characteristics

3 Complex instruction set computers (CISC) and its characteristics

4 Comparison of RISC and CISC

5th 1 Sessional Test

2 Memory Organisation : Introduction

3 Memory Hierarchy

4 RAM chips

6th 1 ROM chips

2 Memory address map

3 Memory connections to CPU

4 Auxillary memory : Magnetic disks

7th 1 Auxillary memory : Magnetic Tape

2 Associative memory

3 Cache memory

4 Virtual memory

8th 1 Concept of Paging

2 Concept of Segmentation

3 Memory management hardware

4 Assignment

9th 1 I/O organization: Introduction

2 Basis Input output system(BIOS): Function of BIOS

3 Testing and initialization

4 Configuring the system

10th 1 Sessional Test 2 Modes of Data Transfer : Introduction

3 Programmed I/O

4 Synchronous Data Transfer

11th 1 Asynchronous Data Transfer

2 Interrupt initiated Data Transfer

3 DMA data transfer

4 DMA Controller

12th 1 Assignment

2 Multi processor systems : Introduction

3 Multi processor systems : Architecture

4 Parallel processing : Introduction

13th 1 Forms of parallel processing

2 Parallel processing and pipelines

3 Basic characteristics of multiprocessor

4 General purpose multiprocessors

14th 1 Interconnection networks : Introduction

2 Time shared common bus

3 Multi port memory,

4 Cross bar switch

15th 1 Multi stage switching 2 Networks and hyper cube structures

3 Assignment

4 Sessional Test

Lesson Plan

Name Of Faculty : Mr. Hitesh Kumar

Discipline : Computer Engg.

Semester : IVth

Subject : DBMS

Lesson Plan Duration : 15 week( January 2018 to April 2018)

Week Theory Practical

Lecture Day

Topic ( Including Assignment / Test ) Practical Day

Topic

Ist 1 Introduction to Database and its purpose 1st Installation of MS-Access. 2 Introduction to Database Management system

3 Why Database and History of Database System

IInd 4 Characteristics of the database approach. Advantages and disadvantages of database systems

2nd Creation of Tables and Insertion of Data in MS-Access.

5 Concept of files, record, data, information retrieval.

6 Introduction to Conventional File System. Comparison between Conventional System and Database System

IIIrd 7 Classification of DBMS Users. Actors on the scene, Database Administrators, Database Designers, End Users, System Analysts and Application Programmers.

3rd Query in MS-Access

8 Workers behind the scene (DBMS system designers and implementers, tool developers, operator and maintenance personnel)

9 Database System Concepts, Data models IVth 10 Physical Model, Object based Model, Record

based Model

4th Alter and Dropping of Database in MS-Access 11 Network Model, Hierarchical Model

12 Schemas, sub schemas instances, data base state. Case Study of models and schemas. Assignment Ist Based on Case study of models ( Student database)

Vth 13 DBMS Architecture: Three Level of Architectures 5th Test based on MS-Access 14 Data base Administrator and Administration,

Database Management System – Advantage and Disadvantage

15 Sessional Test Ist VIth 16 Concept of centralized and Client /Server

Architecture for DBMS: Single Tier, Two Tier and Three Tier

6th Installation of Oracle

17 Data Independence, Database Language 18 Classification of DBMS, DBMS Interfaces

VIIth 19 Classification of Database Management Systems: Centralized, Distributed, parallel and Object based.

7th Creation of Tables in Oracle

20 Data Models Classification : File based or primitive models

21 Traditional data models, semantic data models. VIIIth 22 Entities and Attributes, Entity types and Entity

sets

8th Insertion of Data in Oracle and Deletion based on conditions. 23 Key attribute and domain of attributes,

Relationship among entities 24 Database design with E/R model

Assignment IInd Based on ER Diagram of the database

IXth 25 ER Design Issues 9th Updation of Data and Structure of Tables

26 Mapping Constraints 27 Sessional Test IInd

Xth 28 Relational Model Concepts: Domain Attributes, Tuples, Cardinality

10th Test based of Database design using Oracle 29 Primary, Secondary and Alternative Keys

30 Relational Database Design XIth 31 Different Types of Constraints 11th Query of Database

using Select command

32 Structured Query Language and Its Components 33 Data definition language : Create command and

its use XIIth 34 Alter, Drop commands 12th Use of Like , In and

Between operators in Oracle

35 Data Manipulation Language Insert, Update 36 Data Manipulation Language (DML)

XIIIth 37 Select command with where clause using conditional expressions and Boolean operators,

13th Use of Scaler and Aggregate functions

38 group by clause 39 Different Types of Joins

XIVth 40 Like , Between and IN operator 14th Use of Group By Clause 41 Aggregate and Scaler Functions

42 Date and Character Conversion functions XVth 43 Assignment III Based on Database Design 15th Test based on Select

command and its different forms.

44 Revision and Problems of Students 45 Sessional Test IIIrd

Lesson Plan

Name of Faculty : Vipul Pant


Semester : 4th

Subject : MPD (Microprocessor & Peripheral Devices)

Lesson Plan Duration : 15 Weeks ( From January 2018 to April 2018 )

Week Theory Practical

Lecture

Day

Topic

(including assignment/test )

Practical

Day

Topic

1st

1 Introduction to Micro-

Processor, historical back

ground of MP & its evoluation

1 Familiarization of different

keys of 8085

microprocessor kit and its

memory map (Group: A)

2 Org. of Micro Computer & its

various Blocks

2 Familiarization of different

keys of 8085

microprocessor kit and its

memory map (Group: B)

3 Microprocessor and function

of its various blocks

4 Various application of MP &

its impact on society

2nd 5 Revision of unit 1

6 Introduction to system bus, bus

org. of 8085

3 Steps to enter, modify

data/program and to

execute a programme on

8085 kit (Group:A)

7 Block diagram of 8085 & its

blocks

4 Steps to enter, modify

data/program and to

execute a programme on

8085 kit (Group:B)

8 Functions of various blocks of

8085

3rd

9

Pin Layout of 8085

5 Writing and execution of

ALP for addition and

subtraction of two 8 bit

numbers (group:A)

10 Details of various pins and

related signals of 8085




numbers (group:B)

11 Various multiplexed pins of

8085

12 Demultiplexing of address/data

bus

4th 13 Generation of RD/WR control

signals




numbers (group:A)

14 Steps to execute a stored

programme




numbers (group:B)

15 Revision of Unit 2 (problem

discussion)

16 Class test - Unit 1 & 2

5th 17 Various level of programming:

M/C level programming,

assembly level prog, high level

programming


ALP for multiplication and

division of two 8 bit

numbers (Group :A)

18 Introduction to instruction,

instruction format (type of

instruction): 1- byte instuction,

2- byte inst, 3-byte instruction,

Introduction to Instruction

cycle


ALP for multiplication and

division of two 8 bit

numbers (Group : B)

19 Instruction cycle, M/C cycle,

T-state

20 Fetch & execution cycle:

various steps to fetch &

execute an instruction

6th 21 Timing diagram for opcode

fetch operation, memory read

operation


ALP for arranging 10

numbers in

ascending/descending

order (Group : A)

22 Timing diagram for memory

write operation,


ALP for arranging 10

numbers in

ascending/descending

order (Group : B) 23 Timing diagram for I/O Read,

I/O Write operation

24 Memory read & memory write

operation of processor

7th 25 Introduction to machine &

assembly language

13 ALP for 0 to 9 BCD

counters (up/down counter

according to choice stored

in memory) (Group : A)

26 M/C & assembly languages,

M/C code & mnemonics codes




in memory) (Group : B)

27 Instruction format: opcode,

operend, 1- byte inst, 2- byte

inst, 3-byte instruction,

Introduction to Addressing

Modes

28 Addressing modes : various

addressing modes

8th 29 Addressing modes:

identification of instruction

( to which addressing mode

they belong)




in memory) (Group : A)

30 Introduction to instruction set

& introduction to various

groups




in memory) (Group : B)

31 Data transfer group of Instr,

32 Data transfer group of instr.,

9th 33 Arithmetic group of inst. 17 Interfacing exercise on

8255 like LED display

control (Group: A) 34 Logic group, stack group of

instr.

18 Interfacing exercise on


control (Group: B)

35 I/O & memory control group

of instruction.

36 Programming exercise of

Assembly Language

10th 37 Revision (unit 3 & 4) 19 Interfacing exercise on


control (Group: A) 38 Class test - unit 3 & 4 20 Interfacing exercise on


control (Group: B) 39 Introduction to storing

elements, Memories

40 Concept of various

signals/pins of memory

devices

11th 41 Basic concept of memory

mapping & its techniques


8253 programmable

interval timer (Group : A)

42 Partitioning of total memory

space, Introduction to Address

Decoding


8253 programmable

interval timer (Group : B)

43 Address decoding, need of

decoder

44 Address decoding by using

NAND gate decoder & 2 : 4

line decoder

12th

45

Address decoding by using 3 :

8 line decoder & PROM

decoder


8279 programmable

KB/display interface like to

display the hexcode of key

pressed on display (Grp:A)

46 Peripheral mapped I/O &

Memory mapped I/O Scheme


8279 programmable



pressed on display (Grp: B)

47 Difference between Peripheral

mapped I/O & Memory

mapped I/O Scheme,

Interfacing of memory mapped

I/O devices

48 Introduction to Interrupts:

Maskable & non- maskable

interrupt, Edge triggered &

Level triggered interrupts,

13th 49 Various H/W interrupt, S/W

Interrupt, Restart interrupt &

its use


8279 programmable



pressed on display (Grp:A)

50 Servicing interrupts, extending

interrupt services


8279 programmable



pressed on display (Grp: B)

51 Programmed I/O operation,

overview of data transfer

schemes

52 Sync. Data transfer , asyn data

transfer (hand-shaking

schemes)

14th 53 Interrupt driven data transfer

schemes, Introduction to DMA

27 Use of 8085 emulator for

hardware testing

(Group:A)

54 DMA data transfer schemes,

serial I/P data, serial O/P data


hardware testing

(Group: B)

55 Introduction to peripheral

devices, 8255 PPI

56 8253 pit controller, basics of

direct memory access

15th 57 DMA operation & 8257 DMA

controller


hardware testing

(Group:A)

58 8237 DMA controller and its

operation


hardware testing

(Group: B)

59 Introduction to 8279

programmable KB controller

& its pin layout

60

8251 Communication Interface

Adapter

Lesson Plan

Name of Facility : Anju Bala


Semester : IVth

Subject : Data Structure

Lesson Plan Duration : 15 Week (January 2018to April 2018)

Week Theory Practical Lecture

Days

Topic (Include assignment /Test) Practical

Day

Topic

1st 1 Problem solving concept, top down and

bottom up design, structure programming

1st . The

addition

of two

matrices

using

functions

2 Concept of data types variables and constants

3

Introduction to data Structure( Linear, Non

Linear Primitive, Non Primitive)

2nd

2nd

4 Concepts of Data Structure(Array, Linked

List, Stack, Queue, Trees, graphs)

3rd .Inserting and deleting elements in array

5 Concept of Arrays

6 Single dimensional array

4th

3rd

7 Two dimensional array: 5th

Push and pop operation in stack

8 Representation of Two dimensional Array

9 Base Address, LB, UB)

6th

4th

10 Operations on arrays with Algorithms

7th .

Conversi

on from

in-fix

notation

11 searching, traversing, inserting, deleting

12 Introduction to linked list and double linked

list

8th

5th 13 Representation of linked lists in Memory, 9th

. The

factorial

of a

given

number 14 Comparison between Linked List and Array

15 Traversing a linked list Searching link list

10th using

recursion

6th 16 Sessional 1st

11th .

Insertion

and

Deletion

of

elements

in queue

using

pointers

17 Insertion and deletion into linked list (At

first Node, Specified Position, Last node

18 Application of linked lists Doubly linked lists

12th

7th

19 Traversing a doubly linked lists

Insertion and deletion into doubly linked lists

13th

Insertion

and

Deletion

of

elements

in

circular

queue

using

pointers

20 Introduction to stacks

21 Representation of stacks with array and

Linked List

14th

8th

21 Implementation of stacks

15th

Insertion and Deletion of elements in linked list

22 Application of stacks

-Polish Notations

-Converting Infix to Post Fix Notation

23

-Evaluation of Post Fix Notation

-Tower of Hanoi

16th

9th

24 Recursion: Concept and Comparison between

recursion and Iteration

17th

Insertion

and

Deletion

of

elements

in doubly

linked

list

25 Introduction to queues

26 Implementation of queues (array and Linked

List with algorithm)

18th

10th

27 Circular Queues

19th

The linear search procedures to search an element in given list

28 De-queues

29 Concept of Binary Trees (Complete Binary

Tree

20th

11th 30 2nd

sessional 21st The

binary search procedures to search an element in a given list

31 Extended Binary Tree

32 Concept of representation of Binary Tree

22nd

12th 33 Concept of balanced Binary Tree

23rd

. The

bubble

sort

techniqu

es

34 Traversing Binary Trees

35 Searching, inserting

24th

13th

36 Deleting in binary search trees 25th

The selection sort techniques

37 Introduction

38 Search algorithm Linear

26th

14th

39 Search algorithm Binary

40 Concept of sorting

41 Sorting algorithms

15th

42 (Bubble Sort, Insertion Sort

43 Selection Sort, Merge Sort,

44 Radix Sort, Heap Sort)

Lesson Plan

Name Of Faculty : DEVENDER KUMAR

Discipline :COMPUTER ENGG

Semester :4TH SEM

Subject :OOPS

Lesson Plan Duration : 45 DAYS

Week Theory Practical Lecture Day

Topic ( Including Assignment / Test )

Practical Day Topic

I I 1. Introduction and Features

1. Write a function using variables as

arguments to swap the values of a pair

of integers

2 1.1 Fundamentals of object

oriented programming –

procedure oriented programming

Vs. object oriented programming

(OOP)

3 1.2 Object oriented

programming concepts , –

Classes,

reusabilityencapsulation,

inheritance, polymorphism,

dynamic binding, message

passing, Data Hiding

REPEAT

2 1 1.3 Benefits of OOPs and its

Application 2. 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.

2 2. Language Constructs, Review

of constructs of C used in C++:

variables

3 types and type declarations, REPEAT

3 1 User defined data types 3. Write a program to read name, roll

no ,internal external marks using

classes and display

the same on the screen.

2 ; increment and decrement

operators, relational and logical

operators

3 ; if then else clause; REPEAT

4 1 conditional expressions, input

and output statement 4. Write a program of swapping of

numbers by accessing private numbers

2 , loops, switch case, arrays, using friend

function

3 structure, unions, REPEAT

5 I functions, pointers; 5. Define a class to represent a bank

account 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.

2 preprocessor directives and

Header Files,

3 Scope Resolution Operator REPEAT

6 1 Managing Console I/O

Operations; C++ Stream,

Unformatted

and Formatted Console I/O

6. Create 2 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.

2 Classes and Objects

3.1 Creation, accessing class

members

3 3.2 Private Vs Public

REPEAT

7 I 3.3 Constructor and Destructor

with and without Arguments

7. A book shop maintains the

inventory of books 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

2 3.4 Objects

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.

3 3.5 Dynamic memory Allocation

with new and Delete Operator

REPEAT

8 1 Test of first 3 units 8. 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 s2("well

done"); . Include a function that adds

two strings to

make a third string.

2 Member Functions

4.1 Method definition

3 4.2 Inline Implementation

REPEAT

9 I 4.3 Constant member functions

9. Create a class float that contains 2

float data member. Over load all the 4

arithmetic

operators so that do operate on the

objects of float.

2 4.4 Static Function, This Pointer

3 4.5 Friend Function and its

Characteristics

REPEAT

10 1 Overloading Member Functions

Introduction to Operator

Overloading,

10. Programming Exercise on Hybrid

Inheritance

2 Need of operator overloading,

prefix and postfix,

3 overloading binary operators

instream/outstream operator

overloading,

REPEAT

11 1 Constructor

Overloading, Type Conversion,

Rules of Operator

11. Define 2 classes POLAR and

RECTANGLE to represent points in

the POLAR and

Overloading.Comparison

between

Function Overloading and

overriding

RECTANGLE systems. Use

conversion routines to convert from

one system to the other.

2 Inheritance

Definition of inheritance, Types

of inheritance;

3 Single inheritance, hierarchical

inheritance,

REPEAT

12 1 multiple inheritance, hybrid

inheritance ,protected data 12. 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 2 values given as input

will be treated as length of 2 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/2 *x*y

2 , private data,

public/data, inheriting

constructors and destructors,

constructor for virtual base

classes,

3 constructors and destructors of

derived classes, and virtual

functions, size of a derived

class, order of invocation

REPEAT

13 1 Test of 4,5, and 6 units 13. Exercise on file handling

2 Polymorphism and Virtual

Functions

Importance of virtual function,

3 function call binding, virtual

functions Exercise on file handling

14 1 implementing late

binding, need for virtual

functions,

Exercise on file handling

2 abstract base classes and pure

virtual functions,virtual

destructors

3 File and Streams

Components of a file, different

operation of the file,


15 1 communication in files, creation

of

file streams, stream classes,

headerfiles, updating of file,


2 opening and closing a file, file

modes and filepointers and their

manipulations, functions

manipulation of file pointers,

detecting end-of-file.

3 Test of 7 and 8 unit. Exercise on file handling

theory 1 2 3 instruction formats (three address, two … plan 4th sem computer engg.pdf · 56 8253...

Documents