Lesson Plan (Odd Semester) Name of the Faculty: Rakesh Gupta Discipline: Department: Semester: Subject: Data Communication Lesson Plan Duration: 15 weeks ( from July, 2018 to Dec., 2018) **Work load (Lecture / Practical) per week(in hours): Lectures-04, practicals -Nil Theory Week Lect. day Topic (Including assignment / test) 1. Introduction : Data Communication- Components Data representation Data flow Networks Distributed processing Network criteria Physical structures Network Category- LAN WAN, MAN 2. Data and Signals : Analog and Digital data Analog and digital signals Periodic and Non Periodic signals periodic analog signals Digital Signals- Bit rate, Bit length Digital signal as a composite analog signal Transmission of digital signals Transmission Impairment- Attenuation, Distortion and noise Performance- bandwidth, throughput Latency, jitter 3. Digital and Analog Transmission : Analog transmission- Digital to Analog Conversion- ASK PSK, FSK Analog to Analog Conversion- AM PM,FM( No mathematical treatment) Digital transmission- Digital to digital conversion- coding and schemes Digital transmission- Digital to digital conversion- coding and schemes Analog to digital conversion- PCM Delta Modulation (DM) Transmission modes- Serial transmission Transmission modes- parallel transmission 4. Multiplexing FDM FDM WDM WDM TDM TDM 5. Transmission media : Guided media Twisted pair cable Twisted pair cable Co-axial cable Co-axial cable Fibre optics cable Fibre optics cable Unguided Media Radio wave Microwave Infrared 6. Error Detection and Correction : Types of Errors Redundancy
1 Detection v/s correction Forward error correction Forward error correction v/s retransmission. Error detection through Parity bit Block parity to detect double errors and correct single errors. General principles of error detection and correction using cyclic redundancy check Name of the Faculty: Rajinder Kumar Discipline: Department: Semester: Subject: Digital Electronics Lesson Plan Duration: 15 weeks ( from July, 2018 to Dec., 2018) **Work load (Lecture / Practical) per week(in hours): Lectures-03, practicals -03 Week Theory Practical Lect. day Topic (Including assignment / test) Pract. Day Topic 1. Introduction a) Distinction between analog and digital signal. tables for AND, OR, NOT gates b) Applications and advantages of digital signals. 2. Number System a) Binary, octal and hexadecimal number system: Conversion from decimal to binary Conversion from hexadecimal to binary Conversion from binary to decimal Conversion from binary to hexadecimal b) Binary addition and subtraction including binary points. 1 s and 2 s complement method of addition/subtraction. 3. Codes and Parity a) Concept of code, weighted and non-weighted codes Examples of 8421, BCD,Excess-3 and Gray code. b) Concept of parity, single and double parity, Error detection 4. Logic Gates and Families a) Concept of negative and positive logic b) Definition, symbols and truth tables of NOT, AND, OR, NAND, NOR, EXOR Gates NAND & NOR as universal gates. (c) Introduction to TTL and CMOS logic families 5. Logic Simplification a) Postulates of Boolean algebra, De Morgan s Theorems. Implementation of Boolean (logic) equation with gates Implementation of Boolean (logic) equation with gates tables for AND, OR, NOT gates tables for AND, OR, NOT gates tables for NAND, NOR gates tables for NAND, NOR gates tables for Exclusive OR (EXOR) gate tables for Exclusive OR (EXOR) gate tables for Exclusive OR (EXOR) gate tables forexclusive NOR(EXNOR) gate tables forexclusive NOR(EXNOR) gate tables forexclusive NOR(EXNOR) gate of NAND gate of NAND gate of NOR gate of NOR gate
Karnaugh map (2 variables) and simple application in developing combinational logic circuits Karnaugh map (3 variables) and simple application in developing combinational logic circuits To design a half adder using XOR gate To design a half adder using XOR gate Karnaugh map (4 variables) and simple application in developing combinational logic circuits To design a half adder using NAND gate Karnaugh map (4 variables) and simple application in developing combinational logic circuits 6. Arithmetic circuits Half adder circuit, design and implementation. To design a half adder using NAND gate Construction of a full adder circuit using XOR gate and verify its operation Full adder circuit, design and implementation. Construction of a full adder circuit using NAND gate and verify its operation 4 bit adder circuit Construction of a full adder circuit using NAND gate and verify its operation 7. Decoders, Multiplexeres, De Multiplexeres and Encoder a) Four bit decoder circuits for 7 segment display and decoder/driver ICs. Verification of truth table for positive edge triggered IC flip-flops of D latch b) Basic functions and block diagram of MUX with different Ics Verification of truth table for positive edge triggered IC of D flip-flop b) Basic functions and block diagram of DEMUX with different Ics c) Basic functions and block diagram of Encoder 8. Latches and flip flops a) Concept and types of latch with their working and applications Verification of truth table for positive edge triggered IC of JK flip-flops. Verification of truth table for Negative edge triggered IC flip-flops of D latch Verification of truth table for negative edge triggered IC of D flip-flop b) Operation using waveforms and truth tables of RS & T flip flops. Verification of truth table for negative edge triggered IC of JK flip-flops. Operation using waveforms and truth tables of D & Master/Slave flip flops. Verification of truth table for level triggered IC flip-flops of D latch Operation using waveforms and truth tables of JK flip flops. between a latch and a flip flop 9. Counters a) Introduction to Asynchronous and Synchronous counters b) Binary counters c) Difference Verification of truth table for level triggered IC of D flip-flop Verification of truth table for level triggered IC of JK flip-flops. Verification of truth table for encoder Ics c) Divide by N ripple counters, Decade counter Verification of truth table for decoder ICs Ring counter Verification of truth table for Mux 10. Shift Register Introduction and basic concepts including shift left and shift right. a) Serial in parallel out, serial in serial out Verification of truth table for DeMux To design a 4 bit SISO shift registers using JK/D flip flops and verification of their operation.
1 Parallel in serial out, parallel in parallel out. b) Universal shift register 11. A/D and D/A Converters Working principle of A/D and D/A converters Brief idea about different techniques of A/D conversion Stair step Ramp A/D converter Study of To design a 4 bit SIPO shift registers using JK/D flip flops and verification of their operation. To design a 4 bit PISO shift registers using JK/D flip flops and verification of their operation. To design a 4 bit PIPO shift registers using JK/D flip flops and verification of their operation. To design a 4 bit ring counter and verify its operation. Dual Slope A/D converter Successive Approximation A/D Converter Detail study of : Binary Weighted D/A converter R/2R ladder D/A converter R/2R ladder D/A converter Applications of A/D and D/A converter. 12. Semiconductor Memories Memory organization, classification of semiconductor memories (RAM, ROM, PROM, EPROM, EEPROM) Static and dynamic RAM, Introduction to 74181 ALU IC To design a 4 bit ring counter and verify its operation. To design a 4 bit ring counter and verify its operation. Use of Asynchronous Counter ICs (7490 or 7493) Use of Asynchronous Counter ICs (7490 or 7493) Use of Asynchronous Counter ICs (7490 or 7493) LESSON PLAN Faculty Discipline Semester Subject Duration Dharmveer Saini Operating System 16 WEEKS(From July2018 to December 2018) Work Load Week Theory Practical Day Topic Day Topic Lecture 4(Lecture) per week (in hours) Practical 3 hours Lab per week Overview of Operating Systems Demonstration of all the controls Definition of Operating Systems provided in windows control panel Types of Operating Systems: Batch Systems, Multi-Programming OS N/A Types of Operating Systems: Time Sharing Systems, Real Time Systems N/A Class Test of Topics Covered N/A Operating System Services, User operating system interface Exercise on Basics of windows System Calls, Types of System Calls N/A System Programs N/A Class Test of Topics Covered N/A Operating System Structure Installation of Linux Operating System Virtual Machine, Benefits of Virtual Machine N/A of the unit N/A Class Test of Unit I N/A Process Management (Principles and Brief Concept) Usage of directory management Process concept, Process State, Process Control Block, commands of Linux: ls, cd, pwd, mkdir, rmdir Scheduling Queues, Scheduler, Job Scheduler, Process Scheduler N/A Context Switch, Operations on Processes N/A Class Test of Topics Covered N/A Interprocess Communication Usage of File Management commands of Linux: cat, chmod,cp, mv, rm, pg, more, find Shared Memory Systems, Message-Passing Systems N/A CPU Scheduler, Scheduling Criteria, Process Synchronization. N/A Class Test of Topics Covered N/A Scheduling Algorithms, Preemptive and Non Preemptive Use the general purpose commands of Linux: wc, od, lp, cal, date, who, whoami First come first serve (FCFS), Shortest Job first (SJF)Round Robin (RR), Multiprocessor scheduling N/A of the Unit II N/A Class Test of Unit I N/A
1 1 Deadlocks (Principles and Brief Concept) Deadlock, Conditions for Dead lock Using the simple filters: pr, head, tail, cut, paste, nl, sort Methods for handling deadlocks N/A Dead Prevention,Deadlock Avoidance N/A Deadlock detection,recovery from deadlock N/A Memory Management Function (Principles and Brief Concept) Communication Commands: news, Definition Logical and Physical address Space write, talk, mseg, mail, wall Swapping,Memory allocation N/A Contiguous Memory allocation,fixed and variable partition N/A Class Test of Topics Covered N/A Internal and External fragmentation and Compaction Write a shell program that finds the factorial of a number Paging Principle of operation, Page allocation N/A Hardware support for paging,disadvantages of paging N/A Class Test of Topics Covered N/A Write a shell program that finds whether Protection and sharing a given number is prime or not Segmentation, Virtual Memory N/A of the Unit III N/A Class Test of Unit III N/A I/O Management Functions (Principles and Brief Concept) Write a shell program to find the average Dedicated Devices, Shared Devices, of three numbers I/O Devices, Storage Devices, N/A Buffering, Spooling N/A Class Test of Unit IV N/A File Management (Principles and Brief Concept) Types of File System; Simple file system Write a shell program that will convert all the text of the file from lowercase to uppercase Basic file system, Logical file system N/A Physical file system N/A Various Methods of Allocating Disk Space N/A Linux Operating System History of Linux and Unix, Linux Overview Practice the general purpose commands of Linux Structure of Linux, Linux releases, Open Linux,Linux System Requirements N/A Linux Commands and Filters: mkdir, cd,rmdir N/A Linux Commands and Filters:pwd, ls, who, whoami, date, cat,chmod N/A cp, mv, rm,pg,more, pr, tail Practice Shell Programming head, cut, paste, nl N/A grep, wc, sort, kill, write, talk,mseg N/A wall, merge,mail, news N/A Shell: concepts of command options Practice Shell Programming input, output,redirection,pipes N/A redirecting and piping with standard errors N/A Shell scripts N/A vi editing commands Practice Vi editor Programs of Linux Commands N/A of Shell Script and vi editor N/A Class Test of Unit VII N/A Name of the Faculty : Munish Gupta Discipline : Department : Semester : Subject : Programming in C Lesson Plan Duration : 15 weeks ( from July, 2018 to Dec., 2018) **Work load (Lecture / Practical) per week(in hours): Lectures-04, practicals -06 Theory Week Lecture day Topic (Including assignment / test) Algorithm and Programming Development: Introduction Steps in development of a program Flow charts, Algorithm development Programme Debugging Algorithm and Flowchart writing for practical. Algorithm and Flowchart writing for practical. Practice of error detection and corrections in examples. Program Structure : Introduction to structure of C program Keywords, assign statements I/O statements:printf and Scanf Constants, variables and data types Operators and Expressions Practical Day Practical Topic Programming exercises on defining variables and assigning values to variables
1 1 1 1 1 1 20th 2 2 2 2 2 2 2 2 2 30th 3 3 3 3 3 3 3 3 3 40th 4. 4 4 4 4 4 4 4 4 50th 5 5 5 5 5 5 5 5 5 60th Unformatted and Formatted IOS Data Type Casting Basic Program writing and practice of Unit II Control Structures :Introduction and use Decision making with IF statement Practice of IF statement with examples IF Else and Nested IF While and do-while, for loop Loop Practice and revision Break. Continue statements goto and switch statements of Unit III Practice of Control structures using examples. Class Test of III Pointers :Introduction to pointers Address operator and pointers, Declaring and initializing pointers Single pointer of Unit IV Practice of Pointers using examples and programs Functions:Introduction to functions Global and Local Variables Function Declaration, Standard functions Parameters and Parameter Passing Call - by value/reference of functions and Parameter Passing Arrays and Strings:Introduction to Arrays, Array Declaration, Length of array Single and Multidimensional Array,Arrays of characters of Arrays and functions. Examples of programs and Practice of array and functions Introduction of Strings: String declaration and definition, String Related function i.e. strlen, strcpy, strcmp Passing an array to function Programming examples of array passing as argument to a function of arrays and functions with examples Pointers to an array and strings Pointers to an array and strings detailed Class Test of Pointers and Functions Structures and Unions : Introduction,Declaration of structures Accessing structure members Structure Initialization Pointer to a structures Unions: Introduction Difference between Structures and unions Program examples of structures and unions of Structure and unions of Pointers of Loops and Control Structures. Class Test of Loops, Pointers and Control Structures of Structure and unions 1 1 1 1 1 20th 2 2 2 2 2 2 2 2 2 30th Programming exercises on arithmetic and relational operators Programming exercises on arithmetic expressions and their evaluation Programming exercises on formatting input/output using printf and scanf and Programming exercises using if statement, if Else statement. Programming exercises on switch statement. Programming exercises on for statement statement and for statement Simple programs using pointers Simple programs using pointers Simple programs using functions Simple programs using functions Programs on one-dimensional array. Programs on two-dimensional array. Programs on one-dimensional array. Programs on two-dimensional array. (i) Programs for putting two strings together. (ii) Programs for comparing two strings Programs on functions using array as parameters Programs on functions using array as parameters Programs on functions,strings and parameter passing by reference Simple programs using structures Simple programs using structures Simple programs using union Simple programs using union statement and for statement statement and for statement