NAME OF FACULTY: : Mr. Sarjender Yadav DISCIPLINE: : Computer Science and Engineering SEMESTER: : 6th SUBJECT: : Principle of Software Engineering LESSON PALN 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 1 2evolving 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 5 12 13 14 requirements engineering, system modeling and simulation Analysis principles modeling partitioning Software, prototyping:, Prototyping methods and tools; Specification principles Representation, the software requirements specification and reviews
15 16 6 17 Data Modeling, Functional modeling and information flow: Data flow Behavioral Modeling; The mechanics of structured analysis: Creating entity/ relationship diagram, data control flow model, the control and process specification 18 The data dictionary; Other classical analysis methods 7 19 20 21 System Design: Design concepts and principles: the design process: Design and software quality design principles; Design concepts: Abstraction, refinement, modularity 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 12 35 Control structure testing: Black box testing, testing for specialized environments Software Testing Strategies: Verification and validation, Unit testing,
36 37 Integration testing,; Validation testing, alpha and beta testing ; System testing: Recovery testing, security performance testing; The art of debugging, the debugging process debugging approaches 13 38 Software re-engineering, reverse engineering 39 40 14 41 42 43 15 44 45 restructuring, forward engineering.quality concepts, Software quality assurance, SQA activities reviews: cost impact of software defects, defect amplification and removal formal technical reviews: The review meeting reporting and record keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability: Measures of reliability and availability,the ISO 9000 Quality standards: The ISO approach to quality assurance systems, The ISO 9001 standard, Software Configuration CASE, building blocks,integrated case environments architecture, repository
NAME OF FACULTY : Mr. Sarjender Yadav (subject + lab) DISCIPLINE : Computer Science and Engineering SEMESTER : 6th SUBJECT : Computer Networks LESSON PALN DURATION: 15 WEEKS (from FEB 2018 to MAY 2018) Work load (Lectures/Practical) per week (in hours): Lecture -04, Practical -02 Theory Week Lecture Topics (including assignment and Practical day tests) day Practical Topic 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 2 2 Types of Networks : Local Area 7 Networks Study to Configure TCP/IP protocol 8 Metropolitan Area Networks 9 Wide Area Networks Layering architecture of networks, OSI 10 model 3 3 11 Functions of each layer Study of Network 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 Internet Protocol, Transmission Control 15 Protocol
16 User Datagram Protocol, IP Addressing 17 IP address classes 18 Subnet Addressing 5 5 19 Internet Control Protocols, Connect the computers in Local Area Network. 20 ARP, RARP 21 ICMP, Application 22 Domain Name System, Email SMTP Study of basic network command and 6 6 Network configuration 23 POP,IMAP; FTP commands. 24 NNTP, HTTP 25 Overview of IP version 6 26 Introduction to LANs 7 7 27 Features of LANs Configure a RIP protocol on Network topology using packet tracer software. 28 Components of LANs 29 LAN Standards 30 Usage of LANs 8 8 31 IEEE 802 standards Configure OSPF protocol on Network 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 tracer software. 35 Token Passing, Ethernet
36 Layer 2 & 3 switching 37 Fast Ethernet 38 Gigabit Ethernet 10 10 39 Token Ring Configure EIGRP protocol on Network topology using packet tracer software. 40 Hubs, Switches, Bridges 41 Routers, Gateways 42 Introduction of WANs 11 11 43 Routing, Congestion Control Study to Configuring Cisco Router 44 WAN Technologies 45 Distributed Queue Dual Bus (DQDB) 46 Synchronous Digital Hierarchy (SDH) 12 12 47 Synchronous Optical Network (SONET) Study to Configuring WAP Router 48 Asynchronous Transfer Mode (ATM) 49 Frame Relay., 50 Wireless Links. 13 13 51 Remote Monitoring Techniques: Polling Windows Server Instalation 52 Traps 53 Performance Management 54 Class of Service 14 14 55 Quality of Service Study of Administrator Services 56 Security management, Firewalls
57 VLANs, Proxy Servers Introduction to Network Operating 58 Systems 15 15 59 Client-Server infrastructure Study troubleshooting commansd 60 Windows NT/2000
LESSION PLAN Name of Faculty : Sushma Yadav Discipline : Computer Science and Engineering Semester : 6 th Subject : Analysis and Design of Algorithm Lesson Plan duration : 15 weeks Work Load : Lecture-03, Practical-0 Week Theory Practical Lecture Day Topic Practical Day Topic 1 st 1 st Graphs 2 nd Sets and disjoint sets 3 rd Sorting algorithm:quick sort 2 nd 1 st searching algorithm 2 nd algorithms and their analysis in terms of space and time complexity 3 rd Divide and Conquer 3 rd 1 st Strassen s matrix multiplication algorithms and analysis of algorithms for these problems 2 nd Greedy Method: General method, knapsack problem 3 rd Greedy Method: General method, knapsack problem 4th 1 st minimum spanning trees 2 nd single souce paths and analysis of these problems 3 rd Dynamic Programming: General method 5th 1 st optimal binary search trees 2 nd O/I knapsack 3 rd O/I knapsack numerical problems 6 th 1 st traveling salesperson problem 2 nd Back Tracking: General method 3 rd 8 queen s problem 7 th 1 st graph colouring 2 nd Hamiltonian cycles 3 rd homomorphism 8 th 1 st analysis of these above problems. 2 nd Branch and Bound: Method 3rd Comman problems:lower bound,backtracking 9 th 1 st O/I knapsack 2 nd traveling salesperson problem) 3 rd Techniques algebraic problems 10 th 1 st lower bounds on parallel computations 2 nd NP Hard and NP Complete Problems 3 rd NP Hard and NP Complete Problems 11 th 1 st Cook s theorem 2 nd NP hard graph 3 rd NP scheduling problems
12 th 1 st NP complete problems:bipartite matching 2 nd NP hard problems 13 th 1 st Some miscellaneous problem on branch bound :least comman sub sequence 2 nd Coin exchange problem 3 rd Decidability of problems 14 th 1 st Job sequence scheduling algorithm 2 nd Greedy algorithms numericalsproblems 15 th 1 st Branch and bound algorithms numerical problems 2 nd Dynamic programming problems
LESSION PLAN Name of Faculty : Ramesh loar Discipline : Computer Science and Engineering Semester : 6 th Subject : Intelligent System Lesson Plan duration: 15 weeks Work Load : Lecture-03, Practical-03 Week Theory Practical Lecture Day Topic Practical Topic Day 1 st 1 st Foundation & history of AI 1st To study about PROLOG 2 nd AI problems& techniques, 3 rd AI programming language-lisp, Prolog. 2 nd 1 st Problem representation of AI, Component of 2 nd Write a program for Dieses AI 2 nd Knowledge pyramid 3 rd Difference between brain & computer program, Components of AI 3 rd 1 st Searching Technique, Types, BFS 3 rd Write a program Flavor System 2 nd DFS 3 rd Hill climbing algo. 4th 1 st Best first search 4 th Write a program for categorizing 2 nd A*, AO* algo the Animal according to their 3 rd Game playing & alpha, beta pruning. properties 5th 1 st alpha, beta pruning. 5 th Write a program for Family in 2 nd Knowledge representation issues,. Prolog 3 rd predicate logic, semantic net 6 th 1 st Frame & inheritances 6 th Write a program to add, delete & 2 nd constraint propagation. replace an element from a list. 3 rd Representing knowledge using rules, rules based deduction system. 7 th 1 st Reasoning Under Uncertainty, probability 7 th Write a program to check that 2 nd Non monotonic reasoning, planning. given input is a letter or not. 3 rd Dempster shafer theory, bayes theorem 8 th 1 st Heuristic method. 8 th Write a program for depth first search. 2 nd Symbolic reasoning under uncertainty, Statistical reasoning 3 rd Fuzzy Reasoning, Temporal Reasoning 9 th 1 st Non monotonic reasoning 9 th Write a program of Factorial 2 nd planning of a number. 3 rd Planning in situational calculus 10 th 1 st representation for planning. 10 th Write a program to Find an 2 nd Partial order planning algorithm. 3 rd Learning element from list 11 th 1 st Learning from different ways 11 th Write a program to Delete an 2 nd Neural net
3 rd genetic algorithm element from a list 12 th 1 st Principles of natural language processing 12 th Write a program to solve 2 nd rule based system architecture travelling sales man problem 13 th 1 st Expert System 13 th Write a program to solve 2 nd Knowledge acquisition concept traversal problem. 3 rd Knowledge acquisition concept 14 th 1 st AI application to robotics 14 th Write a program to solve 8 queen 2 nd Current trend in IS. problem. 15 th 1 st current trend in IS. 15 th Write a program 8 puzzle 2 nd 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 Day Topic(Including Assignment Test) 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 Practical Day Topic
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 10 th 28 Absolute and relative pathnames, some Unix directories and files; Looking at the file contents 29 File permissions, permission modes 30 Filters and pipelines 11 th 31 Processes; finding out about processes; Stopping background process 32 Unix editor vi 33 Test Manipulation: Inspecting files; File statistics; Searching for patterns 12 th 34 Operating on files; Printing files; Rearranging files; Sorting files; Splitting files 35 Translating characters; AWK utility. 36 Assignment / Test 13 th 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 14 th 40 Advanced features 41 System Administration: Definition of system administration; 42 Booting the system; Maintaining user accounts 15 th 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