DR. A.P.J.

ABDUL KALAM TECHNICAL

UNIVERSITY, LUCKNOW

EVALUATION SCHEME & SYLLABUS

FOR

B. TECH. SECOND YEAR

ELECTRONICS AND COMPUTER ENGINEERING

AS PER
AICTE MODEL CURRICULUM
[Effective from the Session: 2020-21

Topperworld.in
 B.TECH. (ELECTRONICS AND COMPUTER ENGINEERING)

Semester III & IV

Sr. Course Course Title Periods Evaluation Scheme End Total Credits
No. Code Semester
L T P CT TA Total P TE PE
S
KOE031-38/ Engg. Science Course 3 1 0 30 20 50 100 150 4
KAS302 /Maths IV
1. KAS301/ Technical Communication 2 1 0
KVE301 /Universal Human values 30 20 50 100 150 3
3 0 0
2. KEC301 Electronic Devices 3 1 0 30 20 50 100 150 4
3. KEC302 Digital System Design 3 1 0 30 20 50 100 150 4
4. KCS303 Discrete Structures & Theory 3 0 0 30 20 50 100 150 3
of Logic
6. KEC351 Electronics Devices Lab 0 0 2 25 25 50 1
7. KEC352 Digital System Design Lab 0 0 2 25 25 50 1
8. KCS353 Discrete Structures & Logic 0 0 2 25 25 50 1
Lab
9. KEC354 Mini Project or Internship 0 0 2 50 50 1
Assessment
10. KNC301 Computer System Security 2 0 0 15 10 25 50 0
/KNC302 /Python Programming
11. MOOCs (Essential for
Hons. Degree)
TOTAL 950 22
*The Mini Project or internship (3-4 weeks) conducted during summer break after II semester and will be assessed during III
semester.

Sr. Course Course Title Periods Evaluation Scheme End Total Credits
No. Code Semester

L T P C TA Tot PS TE P
T al E
1. KAS402/ Maths-IV / Engg. Science 3 1 0 30 20 50 100 150 4
KOE041-48 Course
2. KVE401/ Universal Human Values/ 3 0 0
KAS401 Technical Communication 30 20 50 100 150 3
2 1 0
3. KCS401 Operating Systems 3 0 0 30 20 50 100 150 3
4. KEC402 Analog Circuits 3 1 0 30 20 50 100 150 4
5. KEC403 Signal & System 3 1 0 30 20 50 100 150 4
6. KEC452 Analog Circuits Lab 0 0 2 25 25 50 1

7. KEC452 Signal System Lab 0 0 2 25 25 50 1

8. KCS451 Operating Systems Lab 0 0 2 25 25 50 1
9. KNC402/ Python Programming/ 2 0 0 15 10 25 50 0
KNC401 Computer System Security
10. MOOCs (Essential for Hons.
Degree)
TOTAL 900 21

Topperworld.in
KEC301 Electronics Devices 3L:1T:0P 4 Credits

Unit Topics Lectures

I Introduction to semiconductor physics: Review of quantum mechanics, 8
electrons in periodic lattices, E-k diagrams.
II Energy bands in intrinsic and extrinsic silicon, carrier transport, diffusion 8
current, drift current, mobility and resistivity, sheet resistance, design of
resistors.
III Generation and recombination of carriers, Poisson and continuity equation 8
P-N junction characteristics, I-V characteristics, and small signal switching
models.
IV Avalanche breakdown, Zener diode, Schottky diode, Bipolar Junction 8
Transistor, I-V characteristics, Ebers-Moll model.
V MOS capacitor, C-V characteristics, MOSFET, I-V characteristics, and 8
small signal models of MOS transistor, LED, photodiode and solar cell.

Text /Reference Books:

1. G. Streetman, and S. K. Banerjee, “Solid State Electronic Devices,” 7th edition, Pearson,
2014.
2. D. Neamen , D. Biswas, "Semiconductor Physics and Devices," McGraw-Hill Education.
3. S. M. Sze and K. N. Kwok, “Physics of Semiconductor Devices,” 3rd edition, John Wiley
&Sons, 2006.
4. C.T. Sah, “Fundamentals of Solid State Electronics,” World Scientific Publishing Co. Inc,
1991.
5. Y. Tsividis and M. Colin, “Operation and Modeling of the MOS Transistor,” Oxford univ.
press, 2011.
6. Muhammad H. Rashid, “Electronic Devices and Circuits,” Cengage publication, 2014.

Course Outcomes: At the end of this course students will demonstrate the ability to:
1. Understand the principles of semiconductor Physics.
2. Understand and utilize the mathematical models of semiconductor junctions.
3. Understand carrier transport in semiconductors and design resistors.
4. Utilize the mathematical models of MOS transistors for circuits and systems.
5. Analyse and find application of special purpose diodes.

Topperworld.in
KEC302 Digital System Design 3L:1T:0P 4 Credits

Unit Topics Lectures

I Logic simplification and combinational logic design: Binary codes, code 8
conversion, review of Boolean algebra and Demorgans theorem, SOP &
POS forms, Canonical forms, Karnaugh maps up to 6 variables, tabulation
method.
II MSI devices like comparators, multiplexers, encoder, decoder, driver & 8
multiplexed display, half and full adders, subtractors, serial and parallel
adders, BCD adder, barrel shifter and ALU.
III Sequential logic design: Building blocks like S-R, JK and Master-Slave JK 8
FF, edge triggered FF, state diagram, state reduction, design of sequential
circuits, ripple and synchronous counters, shift registers, finite state
machines, design of synchronous FSM, algorithmic state machines charts.
Designing synchronous circuits like pulse train generator, pseudo random
binary sequence generator, clock generation.
IV Logic families and semiconductor memories: TTL NAND gate, 8
specifications, noise margin, propagation delay, fan-in, fan-out, tristate
TTL, ECL, CMOS families and their interfacing, memory elements,
concept of programmable logic devices like FPGA, logic implementation
using programmable devices.
V Digital-to-Analog converters (DAC): Weighted resistor, R-2R ladder, 8
resistor string etc. analog-to-digital converters (ADC): single slope, dual
slope, successive approximation, flash etc. switched capacitor circuits:
Basic concept, practical configurations, application in amplifier, integrator,
ADC etc.

Text/Reference Books:
1. R.P. Jain, “Modern Digital Electronics,” Tata McGraw Hill, 4th edition, 2009.
2. A. Anand Kumar, “Fundamental of Digital Circuits,” PHI 4th edition, 2018.
nd
3. W.H. Gothmann, “Digital Electronics- An Introduction to Theory and Practice,” PHI, 2
edition, 2006.
4. D.V. Hall, “Digital Circuits and Systems,” Tata McGraw Hill, 1989.
5. A. K. Singh, “Foundation of Digital Electronics & Logic Design,” New Age Int.
Publishers.
6. Subrata Ghosal, “Digital Electronics,” Cengage publication, 2nd edition, 2018

Course outcomes: At the end of this course students will demonstrate the ability to:
1. Design and analyze combinational logic circuits.
2. Design and analyze modular combinational circuits with MUX / DEMUX, Decoder &
Encoder
3. Design & analyze synchronous sequential logic circuits
4. Analyze various logic families.
5. Design ADC and DAC and implement in amplifier, integrator, etc.

Topperworld.in
KCS303 Discrete Structures & Theory of 3L:0T:0P 3 Credits
Logic Course Outcome ( CO)

At the end of course , the student will be able to understand

CO 1 Write an argument using logical notation and determine if the argument is or is not valid.

CO 2 Understand the basic principles of sets and operations in sets.

Demonstrate an understanding of relations and functions and be able to determine their

CO 3
properties.
CO 4 Demonstrate different traversal methods for trees and graphs.

CO 5 Model problems in Computer Science using graphs and trees.

DETAILED SYLLABUS
Unit Topic Proposed
Lecture
Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general
identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite
Relations, Equality of relations, Recursive definition of relation, Order of relations.
I 08
Functions: Definition, Classification of functions, Operations on functions, Recursively defined
functions. Growth of Functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with
Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.
II Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets,
Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group 08
Homomorphisms, Definition and elementary properties of Rings and Fields.
Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete
III lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic
08
manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic
gates, Digital circuits and Boolean algebra.
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
IV Contradiction, Algebra of proposition, Theory of Inference. (8) 08
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference
theory of predicate logic.
Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.
V Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs,
Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph 08
coloring, Recurrence Relation & Generating function: Recursive definition of functions, Recursive
algorithms, Method of solving recurrences.
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
Text books:
1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e,
McGraw-Hill, 2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3.E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4.R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5.Liptschutz, Seymour, “ Discrete Mathematics”, McGraw Hill.
6.Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill.
4. Deo, 7.Narsingh, “Graph Theory With application to Engineering and Computer.Science.”, PHI.
8. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi

Topperworld.in
KEC351 Electronic Devices Lab 0L:0T:2P 1 Credits

SUGGESTIVE LIST OF EXPERIMENTS

1. Study of Lab Equipment and Components: CRO, multimeter, and function generator,
power supply- active, passive components and bread board.
2. P-N Junction diode: Characteristics of PN junction diode - static and dynamic resistance
measurement from graph.
3. Applications of PN Junction diode: Half & Full wave rectifier- Measurement of Vrms,
Vdc, and ripple factor.
4. Characteristics of Zener diode: V-I characteristics of Zener diode, graphical
measurement of forward and reverse resistance.
5. Characteristics of Photo diode: V-I characteristics of photo diode, graphical
measurement of forward and reverse resistance.
6. Characteristics of Solar cell: V-I characteristics of solar cell, graphical measurement of
forward and reverse resistance.
7. Application of Zener diode: Zener diode as voltage regulator. Measurement of
percentage regulation by varying load resistor.
8. Characteristic of BJT: BJT in CE configuration- graphical measurement of h-
parameters from input and output characteristics. Measurement of Av, AI, Ro and Ri of
CE amplifier with potential divider biasing.
9. Field Effect Transistors: Single stage common source FET amplifier –plot of gain in dB
Vs frequency, measurement of, bandwidth, input impedance, maximum signal handling
capacity (MSHC) of an amplifier.
10. Metal Oxide Semiconductor Field Effect Transistors: Single stage MOSFET amplifier
–plot of gain in dB Vs frequency, measurement of, bandwidth, input impedance,
maximum signal handling capacity (MSHC) of an amplifier.
11. Simulation of amplifier circuits studied in the lab using any available simulation software
and measurement of bandwidth and other parameters with the help of simulation
software.

Course outcomes: At the end of this course students will demonstrate the ability to:
1. Understand working of basic electronics lab equipment.
2. Understand working of PN junction diode and its applications.
3. Understand characteristics of Zener diode.
4. Design a voltage regulator using Zener diode.
5. Understand working of BJT, FET, MOSFET and apply the concept in designing of
amplifiers.

Topperworld.in
KEC352 Digital System Design Lab 0L:0T:2P 1 Credits

SUGGESTIVE LIST OF EXPERIMENTS

1. Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study
of the data sheet, Concept of Vcc and ground, verification of the truth tables of logic gates
using TTL ICs.
2. Implementation of the given Boolean function using logic gates in both SOP and POS
forms.
3. Verification of state tables of RS, JK, T and D flip-flops using NAND & NOR gates.
4. Implementation and verification of Decoder using logic gates.
5. Implementation and verification of Encoder using logic gates.
6. Implementation of 4:1 multiplexer using logic gates.
7. Implementation of 1:4 demultiplexer using logic gates.
8. Implementation of 4-bit parallel adder using 7483 IC.
9. Design, and verify the 4-bit synchronous counter.
10. Design, and verify the 4-bit asynchronous counter.
11. Implementation of Mini Project using digital integrated circuits and other components.

Course outcomes: At the end of this course students will demonstrate the ability to:
1. Design and analyze combinational logic circuits.
2. Design & analyze modular combinational circuits with MUX/DEMUX, decoder, encoder.
3. Design & analyze synchronous sequential logic circuits.
4. Design & build mini project using digital ICs.

Topperworld.in
 Discrete Structure & Logic Lab (KCS353)

Programming Language/Tool Used: C and Mapple

1. Write a program in C to create two sets and perform the Union operation on sets.
2. Write a program in C to create two sets and perform the Intersectison operation on
sets.
3. Write a program in C to create two sets and perform the Difference operation on
sets.
4. Write a program in C to create two sets and perform the Symmetric Difference
operation.
5. Write a program in C to perform the Power Set operation on a set.
6. Write a program in C to Display the Boolean Truth Table for AND, OR , NOT .
7. Write a C Program to find Cartesian Product of two sets
8. Write a program in C for minimum cost spanning tree.
9. Write a program in C for finding shortest path in a Graph

Note: Understanding of mathematical computation software Mapple to experiment the followings

(Exp. 10 to 25):

10. Working of Computation software

11. Discover a closed formula for a given recursive sequence vice-versa
12. Recursion and Induction
13. Practice of various set operations
14. Counting
15. Combinatorial equivalence
16. Permutations and combinations
17. Difference between structures, permutations and sets
18. Implementation of a recursive counting technique
19. The Birthday problem
20. Poker Hands problem
21. Baseball best-of-5 series: Experimental probabilities
22. Baseball: Binomial Probability
23. Expected Value Problems
24. Basketball: One and One
25. Binary Relations: Influence

Topperworld.in
 Write C Programs to illustrate the concept of the following:
1. Sorting Algorithms-Non-Recursive.
2. Sorting Algorithms-Recursive.
3. Searching Algorithm.
4. Implementation of Stack using Array.
5. Implementation of Queue using Array.
6. Implementation of Circular Queue using Array.
7. Implementation of Stack using Linked List.
8. Implementation of Queue using Linked List.
9. Implementation of Circular Queue using Linked List.
10. Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion
and Deletion in
BST.
11. Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm.

Topperworld.in
 Semester-IV
KEC403 Signal System 3L:1T:0P 4 Credits
Unit Topics Lectures
I Signals and systems as seen in everyday life, and in various branches of 8
engineering and science, energy and power signals, continuous and
discrete time signals, continuous and discrete amplitude signals, system
properties: linearity, additivity and homogeneity, shift-invariance,
causality, stability, realizability.
II Linear shift-invariant (LSI) systems, impulse response and step response, 8
convolution, input-output behaviour with aperiodic convergent inputs,
characterization of causality and stability of linear shift invariant systems,
system representation through differential equations and difference
equations, Periodic and semi-periodic inputs to an LSI system, the notion
of a frequency response and its relation to the impulse response
III Fourier series representation, Fourier transform, convolution/multiplication 8
and their effect in the frequency domain, magnitude and phase response,
Fourier domain duality , Discrete-Time Fourier Transform (DTFT) and the
Discrete Fourier transform (DFT), Parseval's Theorem, the idea of signal
space and orthogonal bases, the Laplace transform, notion of Eigen
functions of LSI systems, a basis of Eigen functions, region of
convergence, poles and zeros of system, Laplace domain analysis, solution
to differential equations and system behaviour.
IV The z-Transform for discrete time signals and systems-Eigen functions, 8
region of convergence, z-domain analysis.
V The sampling theorem and its implications- spectra of sampled signals, 8
reconstruction: ideal interpolator, zero-order hold, first-order hold, and so
on, aliasing and its effects, relation between continuous and discrete time
systems.

Text/Reference books:
1. A.V. Oppenheim, A.S. Willsky and I.T. Young, "Signals and Systems," Pearson, 2015.
2. R.F. Ziemer, W.H. Tranter and D.R. Fannin, "Signals and Systems - Continuous and
Discrete," 4th edition, Prentice Hall, 1998.
3. B.P. Lathi, "Signal Processing and Linear Systems," Oxford University Press, 1998.
4. Douglas K. Lindner, "Introduction to Signals and Systems," McGraw Hill International
Edition: 1999.
5. Simon Haykin, Barry van Veen, "Signals and Systems," John Wiley and Sons (Asia)
Private Limited, 1998.
6. V. Krishnaveni, A. Rajeswari, “"Signals and Systems," Wiley India Private Limited,
2012.
7. Robert A. Gabel, Richard A. Roberts, "Signals and Linear Systems," John Wiley and
Sons, 1995.
8. M. J. Roberts, "Signals and Systems - Analysis using Transform methods and
MATLAB," TMH, 2003.
9. J. Nagrath, S. N. Sharan, R. Ranjan, S. Kumar, "Signals and Systems," TMH New Delhi,
2001.
rd
10. A. Anand Kumar, “Signals and Systems,” PHI 3 edition, 2018.
11. D. Ganesh Rao, K.N. Hari Bhat, K. Anitha Sheela, “Signal, Systems, and Stochastic
Processes,” Cengage publication, 2018.

Topperworld.in
KEC402 Analog Circuits 3L:1T:0P 4 Credits

Unit Topics Lectures

I Diode circuits, amplifier models: Voltage amplifier, current amplifier, 8
trans-conductance amplifier and trans-resistance amplifier. biasing
schemes for BJT and FET amplifiers, bias stability, various configurations
(such as CE/CS, CB/CG, CC/CD) and their features, small signal analysis,
low frequency transistor models, estimation of voltage gain, input
resistance, output resistance etc., design procedure for particular
specifications, low frequency analysis of multistage amplifiers.
II High frequency transistor models, frequency response of single stage and 8
multistage amplifiers, cascode amplifier, various classes of operation
(Class A, B, AB, C etc.), their power efficiency and linearity issues,
feedback topologies: Voltage series, current series, voltage shunt, current
shunt, effect of feedback on gain, bandwidth etc., calculation with practical
circuits, concept of stability, gain margin and phase margin.
III Oscillators: Review of the basic concept, Barkhausen criterion, RC 8
oscillators (phase shift, Wien bridge etc.), LC oscillators (Hartley, Colpitt,
Clapp etc.), non-sinusoidal oscillators.
IV Current mirror: Basic topology and its variants, V-I characteristics, output 8
resistance and minimum sustainable voltage (VON), maximum usable
load, differential amplifier: Basic structure and principle of operation,
calculation of differential gain, common mode gain, CMRR and ICMR,
Op-Amp design: Design of differential amplifier for a given specification,
design of gain stages and output stages, compensation.
V Op-Amp applications: Review of inverting and non-inverting amplifiers, 8
integrator and differentiator, summing amplifier, precision rectifier,
Schmitt trigger and its applications, active filters: Low pass, high pass,
band pass and band stop, design guidelines.

Text/Reference Books:
1. J.V. Wait, L.P. Huelsman and GA Korn, “Introduction to Operational Amplifier theory
and applications,” Mc Graw Hill, 1992.
2. J. Millman and A. Grabel, “Microelectronics,” 2nd edition, McGraw Hill, 1988.
3. P. Horowitz and W. Hill, “The Art of Electronics,” 2nd edition, Cambridge University
Press, 1989.
4. A.S. Sedra and K.C. Smith, “Microelectronic Circuits,” Saunder's College11 Publishing,
th
4 edition.
5. Paul R. Gray and Robert G. Meyer, “Analysis and Design of Analog Integrated Circuits,”
John Wiley, 3rd edition.
6. Muhammad H. Rashid, “Electronic Devices and Circuits,” Cengage publication, 2014.

Course Outcomes: At the end of this course students will demonstrate the ability to:
1. Understand the characteristics of diodes and transistors.
2. Design and analyze various rectifier and amplifier circuits.
3. Design sinusoidal and non-sinusoidal oscillators.
4. Understand the functioning of OP-AMP and design OP-AMP based circuits.
5. Design LPF, HPF, BPF, BSF.

Topperworld.in
KCS401 Operating systems 3L:0T:0P 3 Credits

Course Outcome ( CO)

CO 1 Understand the structure and functions of OS
CO 2 Learn about Processes, Threads and Scheduling algorithms.
CO 3 Understand the principles of concurrency and Deadlocks
CO 4 Learn various memory management scheme
CO 5 Study I/O management and File systems.
DETAILED SYLLABUS
Unit Topic Proposed
Lecture
Introduction : Operating system and functions, Classification of Operating systems- Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems,
I 08
Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered structure,
System Components, Operating System services, Reentrant Kernels, Monolithic and Microkernel
Systems.
Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer Problem,
II Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, 08
Test and Set operation; Classical Problem in Concurrency- Dining Philosopher Problem, Sleeping
Barber Problem; Inter Process Communication models and Schemes, Process generation.
CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process
Transition
III Diagram, Schedulers, Process Control Block (PCB), Process address space, Process identification 08
information, Threads and their management, Scheduling Algorithms, Multiprocessor Scheduling.
Deadlock: System model, Deadlock characterization, Prevention, Avoidance and detection,
Recovery
Memory from deadlock. Basic bare machine, Resident monitor, Multiprogramming with fixed
Management:
IV partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, 08
Paged segmentation, Virtual memory concepts, Demand paging, Performance of demand paging,
Page replacement algorithms, Thrashing, Cache memory organization, Locality of reference.
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk
V storage and disk scheduling, RAID. File System: File concept, File organization and access 08
mechanism, File directories, and File sharing, File system implementation issues, File system
protection and security.
Text books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
3. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
4. D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition,
5. TMH 5. William Stallings, “Operating Systems: Internals and Design Principles ”, 6th Edition, Pearson Education

Topperworld.in
KEC452 Analog Circuit Lab 0L:0T:2P 1 Credits

SUGGESTIVE LIST OF EXPERIMENTS

1. Characteristic of BJT: Study of BJT in various configurations (such as CE/CS, CB/CG,

CC/CD).
2. BJT in CE configuration: Graphical measurement of h-parameters from input and output
characteristics, measurement of Av, AI, Ro and Ri of CE amplifier with potential divider
biasing.
3. Study of Multi-stage amplifiers: Frequency response of single stage and multistage
amplifiers.
4. Feedback topologies: Study of voltage series, current series, voltage shunt, current shunt,
effect of feedback on gain, bandwidth etc.
5. Measurement of Op-Amp parameters: Common mode gain, differential mode gain,
CMRR, slew rate.
6. Applications of Op-Amp: Op-Amp as summing amplifier, difference amplifier, integrator
and differentiator.
7. Field effect transistors: Single stage common source FET amplifier –plot of gain in dB vs
frequency, measurement of bandwidth, input impedance, maximum signal handling
capacity (MSHC) of an amplifier.
8. Oscillators: Study of sinusoidal oscillators- RC oscillators (phase shift, Wien bridge etc.).
9. Study of LC oscillators (Hartley, Colpitt, Clapp etc.),
10. Study of non-sinusoidal oscillators.
11. Simulation of amplifier circuits studied in the lab using any available simulation software
and measurement of bandwidth and other parameters with the help of simulation
software.
12. ADC/DAC: Design and study of Analog to Digital Converter.
13. Design and study of Digital to Analog Converter.

Course Outcome: At the end of this course students will demonstrate the ability to:
1. Understand the characteristics of transistors.
2. Design and analyze various configurations of amplifier circuits.
3. Design sinusoidal and non-sinusoidal oscillators.
4. Understand the functioning of OP-AMP and design OP-AMP based circuits.
5. Design ADC and DAC.

Topperworld.in
KEC453 Signal System Lab 0L:0T:2P 1
Credits
SUGGESTIVE LIST OF EXPERIMENTS
1. Introduction to MATLAB
a. To define and use variables and functions in MATLAB.
b. To define and use Vectors and Matrices in MATLAB.
c. To study various MATLAB arithmetic operators and mathematical functions.
d. To create and use m-files.
2. Basic plotting of signals
a. To study various MATLAB commands for creating two and three dimensional
plots.
b. Write a MATLAB program to plot the following continuous time and discrete
time signals.
i. Step Function
ii. Impulse Function
iii. Exponential Function
iv. Ramp Function
v. Sine Function
3. Time and Amplitude transformations
Write a MATLAB program to perform amplitude-scaling, time-scaling and time-
shifting on a given signal.
4. Convolution of given signals
Write a MATLAB program to obtain linear convolution of the given sequences.
5. Autocorrelation and Cross-correlation
a. Write a MATLAB program to compute autocorrelation of a sequence x(n) and
verify the property.
b. Write a MATLAB program to compute cross-correlation of sequences x(n) and
y(n) and verify the property.
6. Fourier Series and Gibbs Phenomenon
a. To calculate Fourier series coefficients associated with Square Wave.
b. To Sum the first 10 terms and plot the Fourier series as a function of time.
c. To Sum the first 50 terms and plot the Fourier series as a function of time.
7. Calculating transforms using MATLAB
a. Calculate and plot Fourier transform of a given signal.
b. Calculate and plot Z-transform of a given signal.
8. Impulse response and Step response of a given system
a. Write a MATLAB program to find the impulse response and step response of a
system form its difference equation.
b. Compute and plot the response of a given system to a given input.
9. Pole-zero diagram and bode diagram
a. Write a MATLAB program to find pole-zero diagram, bode diagram of a given
system from the given system function.
b. Write a MATLAB program to find, bode diagram of a given system from the
given system function.

Topperworld.in
 10. Frequency response of a system
Write a MATLAB program to plot magnitude and phase response of a given system.
11. Checking linearity/non-linearity of a system using SIMULINK
a. Build a system that amplifies a sine wave by a factor of two.
b. Test the linearity of this system using SIMULINK.

Course outcomes: At the end of this course students will demonstrate the ability to:
1. Understand the basics operation of MATLAB.
2. Analysis the time domain and frequency domain signals.
3. Implement the concept of Fourier series and Fourier transforms.
4. Find the stability of system using pole-zero diagrams and bode diagram.
5. Design frequency response of the system.

Topperworld.in
 KCS451 Operating Systems Lab 0L:0T:2P 1 Credits

1. Study of hardware and software requirements of different operating systems

(UNIX,LINUX,WINDOWS XP, WINDOWS7/8
2. Execute various UNIX system calls for
i. Process management
ii. File management
iii. Input/output Systems calls
3. Implement CPU Scheduling Policies:
i. SJF
ii. Priority iii. FCFS
iv. Multi-level Queue
4. Implement file storage allocation technique:
i. Contiguous(using array)
ii. Linked –list(using linked-list)
iii. Indirect allocation (indexing)
5. Implementation of contiguous allocation techniques:
i. Worst-Fit
ii. Best- Fit iii. First- Fit
6. Calculation of external and internal fragmentation
i. Free space list of blocks from system
ii. List process file from the system
7. Implementation of compaction for the continually changing memory layout and calculate total
movement of data
8. Implementation of resource allocation graph RAG)
9. Implementation of Banker‟s algorithm
10. Conversion of resource allocation graph (RAG) to wait for graph (WFG) for each type of
method used for storing graph.
11. Implement the solution for Bounded Buffer (producer-consumer)problem using inter process
communication techniques-Semaphores
12. Implement the solutions for Readers-Writers problem using inter process communication
technique -Semaphore

Topperworld.in