NAME OF FACULTY: :

LESSON PLAN Mr. Sarjender Yadav

DISCIPLINE: : Computer Science and Engineering

SEMESTER: : 6th

SUBJECT: : Principle of Software Engineering LESSON PLAN DURATION: 15 WEEKS (from FEB 2018 to MAY 2018) Work load (Lectures/Practical) per week (in hours): Lecture -03,Practical-00

Week Theory Practical

Lecture Topics (including assignment and tests) Practical

day day Topic

1 The process, software products, emergence of

software engineering

2 evolving role of software, software life cycle models

3 Software Characteristics

4 Applications, Software crisis.

2 5 Project management concepts, software process and

project metrics Project planning

6 project size estimation metrics

7

project estimation Techniques, empirical estimation

Techniques

3 8 COCOMO- A Heuristic estimation techniques

9 staffing level estimation, team structures, staffing

10 risk analysis and management

4 11 project scheduling and tracking

12

requirements engineering, system modeling and

simulation Analysis principles modeling

13

partitioning Software, prototyping: , Prototyping

methods and tools; Specification principles

5 14

Representation, the software requirements specification and reviews

15

Data Modeling, Functional modeling and information flow: Data flow

16

Behavioral Modeling; The mechanics of structured analysis: Creating entity/ relationship diagram, data

6 17 control flow model, the control and process

specification

18 The data dictionary; Other classical analysis methods

19

System Design: Design concepts and principles: the design

process: Design and software quality

7 20

design principles; Design concepts: Abstraction,

refinement, modularity

21

software architecture, control hierarchy, structural

partitioning, data structure,

22 software procedure, information hiding

8 23 Effective modular design: Functional independence,

24

Cohesion, Coupling; Design Heuristics for effective

modularity

25 The design model; Design documentation

9 26 Software architecture, Data Design: Data modeling,

data structures

27 databases and the data warehouse

28 Analyzing alternative Architectural Designs

10 29 architectural complexity; Mapping requirements into

a software architecture

30 flow, Transaction flow

31 Transform mapping: Refining the architectural design

11 32 Software Testing Techniques, software testing

fundamentals: objectives, principles, testability

33 Test case design, white box testing, basis path testing

34

Control structure testing: Black box testing, testing for

specialized environments

12 35 Software Testing Strategies: Verification and

validation, Unit testing,

36

Integration testing,; Validation testing, alpha and beta testing ; System testing: Recovery testing, security

37

performance testing; The art of debugging, the

debugging process debugging approaches

13 38 Software re-engineering , reverse engineering

39

restructuring, forward engineering.Quality concepts, Software quality assurance , SQA activities

40

reviews: cost impact of software defects, defect amplification and removal

14 41 formal technical reviews: The review meeting

reporting and record keeping, review guidelines;

42

Formal approaches to SQA; Statistical software quality

assurance; software reliability:

43

Measures of reliability and availability ,The ISO 9000

Quality standards:

15 44 The ISO approach to quality assurance systems, The

ISO 9001 standard, Software Configuration

45

CASE, building blocks,integrated case environments

architecture, repository

NAME OF FACULTY :

LESSON PLAN Mr. Sarjender Yadav (subject + lab)

DISCIPLINE : Computer Science and Engineering

SEMESTER : 6th

SUBJECT : Computer Networks

LESSON PLAN DURATION: 15 WEEKS (from FEB 2018 to MAY 2018)

Work load (Lectures/Practical) per week (in hours): Lecture -04, Practical -02

Theory Practical

Week Lecture Topics (including assignment and Practical Topic

day tests) day

1 Introduction to Computer Networks Study of different types

2 Example networks ARPANET of Network cables and

Practically implement

1

1 the cross-wired cable

3 Internet, Private Networks and straight through

cable using clamping

4 Network Topologies: Bus-, Star-, Ring

tool.

5 Ring-, Hybrid -, Tree

6 Complete -, Irregular –Topology Study to Configure

2 2

7 Types of Networks : Local Area TCP/IP protocol

Networks

8 Metropolitan Area Networks

9 Wide Area Networks

10

Layering architecture of networks, OSI

model

Study of Network 3 3

11 Functions of each layer Devices in Detail

12 Services and Protocols of each layer

13 Introduction, History of TCP/IP

14 Layers of TCP/IP, Protocols

4 4 Study of network IP

15 Internet Protocol, Transmission Control

Protocol

16 User Datagram Protocol, IP Addressing

17 IP address classes

18 Subnet Addressing Connect the computers

5

5

19 Internet Control Protocols, in Local Area Network.

20 ARP, RARP

21 ICMP, Application

22 Domain Name System, Email – SMTP Study of basic network

6

6 command and

Network configuration

23 POP,IMAP; FTP commands.

24 NNTP, HTTP

25 Overview of IP version 6

Configure a RIP 26 Introduction to LANs

protocol on Network 7

7

27 Features of LANs topology using packet

tracer software.

28 Components of LANs

29 LAN Standards

Configure OSPF 30 Usage of LANs

protocol on Network 8 8

31 IEEE 802 standards topology using packet

tracer software.

32 Channel Access Methods

33 Aloha

Configure IGRP 34 CSMA, CSMA/CD

protocol on Network

9 9 topology using packet

35 Token Passing, Ethernet

tracer software.

36 Layer 2 & 3 switching

37 Fast Ethernet

Configure EIGRP 38 Gigabit Ethernet

protocol on Network 10 10

39 Token Ring topology using packet

tracer software.

40 Hubs, Switches, Bridges

41 Routers, Gateways

42 Introduction of WANs Study to Configuring

11 11

43 Routing, Congestion Control Cisco Router

44 WAN Technologies

45 Distributed Queue Dual Bus (DQDB)

46 Synchronous Digital Hierarchy (SDH) Study to Configuring

12 12

47 Synchronous Optical Network (SONET) WAP Router

48 Asynchronous Transfer Mode (ATM)

49 Frame Relay.,

50 Wireless Links. Windows Server

13 13

51 Remote Monitoring Techniques: Polling Instalation

52 Traps

53 Performance Management

54 Class of Service Study of Administrator

14 14

55 Quality of Service Services

56 Security management, Firewalls

57 VLANs, Proxy Servers

58

Introduction to Network Operating

Systems

Study troubleshooting 15 15

59 Client-Server infrastructure commansd

60 Windows NT/2000

LESSON PLAN

Name of Faculty : Sushma Yadav

Discipline : Computer Science and Engineering

Semester : 6th Subject : Analysis and Design of Algorithm

Lesson Plan duration : 15 weeks

Work Load : Lecture-03, Practical-0 Week Theory Practical

Lecture Day Topic Practical Topic Day

1st 1st Graphs

2nd Sets and disjoint sets

3rd Sorting algorithm:quick sort

2nd 1st searching algorithm

2nd algorithms and their analysis in terms of space and time complexity

3rd Divide and Conquer

3rd 1st Strassen‟ s matrix multiplication algorithms and analysis of algorithms for these

problems

2nd Greedy Method: General method, knapsack problem

3rd Greedy Method: General method, knapsack problem

4th 1st minimum spanning trees

2nd single souce paths and analysis of these problems

3rd Dynamic Programming: General method

5th 1st optimal binary search trees

2nd O/I knapsack

3rd O/I knapsack numerical problems

6th 1st traveling salesperson problem

2nd Back Tracking: General method

3rd 8 queen‟ s problem

7th 1st graph colouring

2nd Hamiltonian cycles

3rd homomorphism

8th 1st analysis of these above problems.

2nd Branch and Bound: Method

3rd Comman problems:lower

bound,backtracking

9th 1st O/I knapsack

2nd traveling salesperson problem)

3rd Techniques algebraic problems

10th

1st lower bounds on parallel computations

2nd NP Hard and NP Complete Problems

3rd NP Hard and NP Complete Problems

11th

1st Cook‟ s theorem

2nd NP hard graph

3rd NP scheduling problems

12th 1st NP complete problems:bipartite matching

2nd NP hard problems

13th

1st Some miscellaneous problem on branch bound :least comman sub sequence

2nd Coin exchange problem

3rd Decidability of problems

14th 1st Job sequence scheduling algorithm

2nd Greedy algorithms numericalsproblems

15th

1st Branch and bound algorithms numerical problems

2nd Dynamic programming problems

LESSON PLAN

Name of Faculty : Ramesh loar

Discipline : Computer Science and Engineering

Semester : 6th

Subject : Intelligent System

Lesson Plan duration: 15 weeks

Work Load : Lecture-03, Practical-03 Week Theory Practical

Lecture Day Topic Practical Topic Day

1st 1st Foundation & history of AI 1st To study about PROLOG

2nd AI problems& techniques,

3rd AI programming language-Lisp, Prolog.

2nd 1st Problem representation of AI, Component of 2nd Write a program for Dieses AI

2nd Knowledge pyramid

3rd Difference between brain & computer

program, Components of AI

3rd 1st Searching Technique, Types, BFS 3rd Write a program Flavor System

2nd DFS

3rd Hill climbing algo.

4th 1st Best first search 4th Write a program for categorizing

2nd A*, AO* algo the Animal according to their 3rd Game playing & alpha, beta pruning. properties

5th 1st alpha, beta pruning. 5th Write a program for Family in

2nd Knowledge representation issues,. Prolog 3rd predicate logic, semantic net

6th 1st Frame & inheritances 6th Write a program to add, delete &

2nd constraint propagation. replace an element from a list. 3rd Representing knowledge using rules, rules

based deduction system.

7th 1st Reasoning Under Uncertainty, probability 7th Write a program to check that

2nd Non monotonic reasoning, planning. given input is a letter or not.

3rd Dempster shafer theory , bayes theorem

8th 1st Heuristic method. 8th Write a program for depth first 2nd Symbolic reasoning under uncertainty, search. Statistical reasoning

3rd Fuzzy Reasoning, Temporal Reasoning

9th 1st Non monotonic reasoning 9th Write a program of Factorial 2nd planning of a number . 3rd Planning in situational calculus

10th

1st representation for planning. 10th

Write a program to Find an 2nd Partial order planning algorithm. element from list 3rd Learning

11th

1st Learning from different ways 11th

Write a program to Delete an 2nd Neural net

3rd genetic algorithm element from a list

12th

1st Principles of natural language processing 12th

Write a program to solve

2nd rule based system architecture travelling sales man problem

13th 1st Expert System 13th Write a program to solve

2nd Knowledge acquisition concept traversal problem.

3rd Knowledge acquisition concept

14th

1st AI application to robotics 14th

Write a program to solve 8 queen

2nd Current trend in IS. problem.

15th 1st current trend in IS. 15th Write a program 8 puzzle

2nd Min max problems problem.

Lesson Plan

Name of Faculty : Dr. Gundeep Tanwar

Discipline : Computer Science Engineering

Semester : VI

Subject : SYSTEMS PROGRAMMING &SYSTEM

ADMINISTRATION

Lesson Plan Duration : January 2018 to April 2018

Work Load( Lecture / Practical per week ) : Lectures 3

Week Theory Practical

Lecture Topic(Including Assignment Test) Practical Topic

Day Day

1st 1 Section A : Evolution of Components Systems Programming

2 Assemblers, Loaders, Linkers, Macros, Compilers

3 Software tools, Text editors, Interpreters and program generators

2nd 4 Debug Monitors Programming environment

5 Programming environment

6 Compiler: Brief overview of compilation process, Incremental compiler

3rd 7 Assembler: Problem statement, single phase

8 Two phase assembler , symbol table

9 Loader schemes, compile and go Loader

4th 10 General loader schemes, absolute loader

11 Subroutine linkage, Reallocating loader

12 Direct linkage Loader, Binders

5th 13 Linking loader, overlays.

14 Assignment / Test

15 Section B :Macro language and macro-processor

6th 16 Macro instructions, features of macro facility, macro instruction arguments

17 Conditional macro expansion, macro calls with macro instruction defining macros

18 Concept of UNIX Operating System

7th 19 Features of Unix operating system

20 File structure

21 CPU scheduling

8th 22 Memory management: swapping, demand paging

23 File system: block and fragments, inodes,

24 Directory structure , User to User Communication

9th 25 Assignment / Test

26 Section C Unix: User names and groups, logging in; Format of Unix commands; Changing your password

27 Unix documentation; Files and directories; Current directory, looking at the directory contents

10th

28 Absolute and relative pathnames, some Unix directories and files; Looking at the file contents

29 File permissions , permission modes

30 Filters and pipelines

11th

31 Processes; finding out about processes; Stopping background process

32 Unix editor vi

33 Test Manipulation: Inspecting files; File statistics; Searching for patterns

12th 34 Operating on files; Printing files; Rearranging files; Sorting files; Splitting files

35 Translating characters; AWK utility.

36 Assignment / Test

13th

37 Section D : Shell Programming: Programming in the Borne and C-Shell

38 Wild cards; Simple shell programs

39 Shell variables; Shell programming constructs; interactive shell scripts

14th 40 Advanced features

41 System Administration: Definition of system administration;

42 Booting the system; Maintaining user accounts

15th

43 File systems and special files; Backups and restoration

44 Role and functions of a system manager , Overview of the linux operating system

45 Assignment / Test