CS2K 301 : ENGINEERING MATHEMATICS III
(common with IT2K 301)
3 hours lecture and 1 hour tutorial per week
Module I: Linear algebra I (13 hours)
Vector spaces - Subspaces - Linear dependence and independence - Bases and dimension - Gram - Schmidt orthogonalization process - Linear transformations - Sums, products and inverses of linear transformations - Linear operator equations
Module II: Linear algebra II (13 hours)
Rank and equivalence of matrices - Quadratic forms - Characteristic values and characteristic vectors of a matrix - Transformation of matrices - Functions of a square matrix
Module III: Functions of a complex variable & applications I (13 hours)
Functions of a complex variable - Analytic functions - Cauchy-Riemann equations - Elementary functions of z - Conformal mapping - Bilinear transformation - Schwarz-Christoffel transformation - Transformation by other functions
Module IV: Functions of a complex variable & applications II (13 hours)
Integration in the complex plane - Cauchy's integral theorem - Cauchy's integral formula - Series of complex terms - Taylor's series - Laurent's series - Residue theorem - Evaluation of real definite integrals - The laplace inversion integral
Text book
Wylie C.R. & Barrett L.C., Advanced Engineering Mathematics, McGraw Hill (Chapters 13, 14, 17, 18, 19 & 20 excluding Sections 14.1, 14.2, 14.4)
Reference books
1. Churchill R.V., Brown J.W. & Verhey R.F., Complex variables & Applications, McGraw Hill
2. Hadley G., Linear Algebra, Addison Wesley
3. Kreider D.L., Kuller R.G., Ostberg D.R., & Perkins F.N., An Introduction to Linear Analysis, Addison Wesley
4. Kreyszig E., Advanced Engineering Mathematics, John Wiley
5. Lipschutz S., Linear Algebra, Schaum's Outline Series, McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to ]
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 302 : DATA STRUCTURES & ALGORITHMS
(Common with IT2K 302)
3 hours lecture and 1-hour tutorial per week
Module I (12 hours)
Review of data types - Scalar types - Primitive types - Enumerated types - Sub ranges Structures types - Character strings - arrays - records - sets - tiles - Data abstraction - Complexity of algorithms - Time and space complexity of algorithms using “big oh” notation - Recursion: Recursive algorithms - Analysis of recursive algorithms
Module II (12 hours)
Linear data structures - Stacks - Queues - Lists - Stack and queue implementation using array - Linked list - Linked list implementation using pointers
Module III (12 hours)
Non linear structures: Graphs -Trees - Sets - Graph and tree implementation using array linked list - Set implementation using bit string, linked list
Module IV (16 hours)
Searching - Sequential search - Searching arrays and linked lists - Binary search - Searching arrays and binary search trees - Hashing - Introduction to simple hash functions - resolution of collisions - Sorting: n2 Sorts - Bubble sort - Insertion Sort - Selection sort - NlogN sorts - Quick sort - Heap sort - Merge sort - External sort - Merge files
Text book
Aho A.V., Hopcroft J.E. & Ullman J.D., Data Structures and Algorithms, Addison Wesley
Reference books
1. Sahni S., Data Structures, Algorithms, & Applications in C++, McGraw Hill
2. Wirth N., Algorithms +Data Structures = Programs, Prentice Hall
3. Cormen T.H., Leiserson C.E., & Rivest R.L., Introduction to Algorithms, MIT Press, 1990
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 303 : DISCRETE COMPUTATIONAL STRUCTURES
(Common with IT2K 303)
3 hours lecture and 1-hour tutorial per week
Module I: Logic (13 hours)
Prepositional Logic - Logical arguments - Consistency completeness and independence - Formal proofs - Natural deduction - Soundness, completeness and compactness theorems - Predicate logic - Completeness - Resolution - Unification algorithm
Module II: Relational structures (13 hours)
Sets relations and functions - Pigeonhole principle - Cardinals - Countable and uncountable sets - Digonalization - Equivalence relations and partitions - Partial order - Lattices and Boolean algebra
Module III: Group theory (13 hours)
Groups and subgroups - Products and quotients - Homomorphism theorems - Cosets and normal subgroups - Lagrange’s theorem - Permutation groups - Cayley’s theorem - Hamming Codes and Syndrome decoding
Module IV: Rings and fields (13 hours)
Rings, integral domains and fields - Ideals and quotient rings - Euclidean domains - Polynomial rings and division algorithm - Factorization and unique factorization - Irreducibility - Field properties and extensions - Ruler and compass constructions - Introduction to cyclic codes
Text books
1. Truss J.K., Discrete Mathematics for Computer Scientists, Addison Wesley (Modules I & II)
2. Kolman B. & Busby R.C., Discrete Mathematical Structures for Computer Science, Prentice Hall of India (Modules III & IV)
Reference books
1. Liu C.L., Elements of Discrete Mathematics, McGraw Hill
2. Mott J.L., Kandel A. & Baker T.P., Discrete Mathematics for Computer Scientists & Mathematicians, Prentice Hall of
3. Grimaldi P., Discrete & Combinatorial Mathematics, Addison Wesley
4. Hernstein N., Topics in Algebra, Wiley Eastern
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 304 : BASIC ELECTRONICS ENGINEERING
(Common with IT2K 304)
3 hours lecture and 1-hour tutorial per week
Module I (15 hours)
Electronic components - Concepts of voltage and current sources - Energy bands in solids, metals, insulators and semiconductors - Intrinsic and extrinsic semiconductors - PN junction theory - V-I characteristics - Diode resistance - Rectifiers - Performance analysis of rectifiers - Filters, zener, varactor and power diodes - LEDs. Transistors - Working and amplifying action - Characteristics - Comparison between CE, CB and CC configurations - CE Amplifier, construction of transistors - Use of data sheet - Thermal runaway - UJT, introduction to FETs
Module II (12 hours)
Transistor biasing - Selection of operating point - Bias stabilization - Different biasing circuits - PNP biasing - Small signal amplifiers - Single stage amplifier - Graphical method - Equivalent circuit method - Amplifier analysis - FET amplifier - Multistage amplifiers - Gain analysis - RC coupled amplifier - Frequency response - Two stage RC coupled amplifier - Distortion in amplifiers - Classification of amplifiers
Module III (13 hours)
Power amplifiers - Single-ended power amplifier - Harmonic distortion - Push-pull amplifier - Tuned voltage amplifier - Resonance - Single-tuned voltage amplifier - Feedback in amplifiers - Types of feedback - Voltage gain with feedback - Negative feedback - Oscillators - Classification - LC oscillators - RC oscillators - Crystal oscillators - Astable multivibrator
Module IV (12 hours)
Operational amplifiers - Inverting and noninverting amplifiers - Adder - Voltage follower - Differential amplifier - Integrator and differentiator - Zero-crossing detector - Precision diode - Peak detector - Logarithmic amplifier - Square and triangle wave generator - Analog computation - Active filters
Text books
1. Bhargava N.N.,
2. Nagarath J., Electronics Analog & Digital, Prentice Hall
Reference books
1. Millman J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits & Systems, Tata McGraw Hill
2. Schilling D.L. & Belove C., Electronic Circuits: Discrete & Integrated, McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 305 : SWITCHING THEORY & LOGIC DESIGN
(common with IT2K 305)
3 hours lecture and 1 hour tutorial per week
Module I (14 hours)
Number Systems and codes - Boolean algebra - Postulates and theorems - Constants, variables and functions - Switching algebra - Electronic gates and mechanical contacts Boolean functions and logical operations - Normal and canonical forms - Self-dual functions - Logical operations - Karnaugh map - Prime cubes - Minimum sum of products and product of sums - Quine-McClusky algorithm
Module II (13 hours)
Combinational Logic - Analysis and design of combinational logic circuits - Universal property of the NAND and NOR gates – Adders - Parallel adders and look-ahead adders – Comparators - Decoders and encoders - Code conversion - Multiplexers and demultiplexers - Parity generators and checkers - ROMs, PLAs
Module III (10 hours)
Fault diagnosis and tolerance - Fault classes and models - Fault diagnosis and testing - Test generation - Fault table method - Path sensitization method - Boolean difference method - Fault-tolerance techniques. Programmable logic arrays - PLA minimization - Essential prime cube theorem - PLA folding - Design for testability
Module IV (15 hours)
Counters and shift registers - SR, JK, D and T flip-flops - Excitation tables - Triggering of flip-flops - Flip-flop applications - Latches - Ripple counters - Synchronous counters - Up-down counters - Design of sequential circuits - Counter decoding - Counter applications - Shift registers and their applications - Clock mode sequential machine - State tables and diagrams
Text books
1. Biswas N.N., Logic Design Theory, Prentice Hall of India (modules I, II & III)
2. Floyd T.L., Digital Fundamentals, Universal Book Stall (module IV)
Reference books
1. Kohavi Z., Switching & Finite Automata Theory, Tata McGraw Hill
2. Millman J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits & Systems, Tata McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 306 : ELECTRIC CIRCUITS AND SYSTEMS
(Common with IT2K 306)
3 hours lecture and 1-hour tutorial per week
Module I (12 hours)
Review of basic circuit concepts - node and mesh analysis, coupled circuits - Definition of graph, cut sets and loops - trees incidence matrix - Applications of graph theoretic methods for the formation of network equations - Application of Laplace transform for the solution of differential equations
Module II (12 hours)
Review of network theorems - Transient analysis of RL, RC and RLC circuits - concept of time constant - Polyphase circuit - 3 phase circuit with balanced and unbalanced loads - star-delta transformation
Module III (12 hours)
Bridge circuits - Principles of Maxwells bridge - Wiens bridge Adersons bridge and Scherring bridge - Two port networks - Concept of impedance - Admittance and hybrid parameters - Interconnection of two port networks - Driving point and transfer functions - Poles and zeros
Module IV (16 hours)
Introduction to systems - Systems engineering - Block diagram - Transfer function - Control system characteristics - Dynamic responses - Feedback control - System response - First and second order systems - System time constants - Frequency response - Stability analysis using frequency response (Bode plot) and using root locus
Text books
1. Siskind, Electrical Circuits, McGraw Hill
2. Smith R.J. & Dorf R.C., Circuits Devices & Systems, John Wiley
Reference books
1. Kuo F., Network Analysis & Synthesis, John Wiley
2. Chang D.K., Analysis of Linear Systems.
3. Edminister, Electric Circuits, Schaum ‘s Outline Series, McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 307(P) : PROGRAMMING LAB
[common with IT2K 307(P)]
3 hours practicals per week
Set 1 (3 lab sessions)
HCF (Euclid’s algorithm) and LCM of given numbers - Find mean - Median and mode of a given set of numbers - Conversion of numbers from binary to decimal, hexadecimal, octal and back - Evaluation of functions like ex, sinx, cosx etc. for a given numerical precision using Taylor’s series - Testing whether a given number is prime
Set 2 (2 lab sessions)
String manipulation programs: sub-string search, deletion - Lexicographic sorting of a given set of strings - Generation of all permutations of the letters of a given string using recursion
Set 3 (2 lab sessions)
Matrix operations: Programs to find the product of two matrices - Inverse and determinant (using recursion) of a given matrix - Solution to simultaneous linear equations using
Set 4 (3 lab sessions)
Files: Use of files for storing records with provision for insertion - Deletion, search, sort and update of a record
Reference books
1. Schildt H., C: The Complete Reference, Tata McGraw Hill
2. Tan H.H. & D'Orazio T.B., C Programming for Engineering & Computer Science, McGraw Hill
3. Cormen T.H. et al, Introduction to Algorithms, Prentice Hall of India
Sessional work assessment
Lab practicals & record = 30
2 tests 2x10= 20
Total marks = 50
CS2K 308(P) : ELECTRONICS LAB
[Common with IT2K 308(P)]
3 hours practicals per week
1. Silicon, germanium and zener diode characteristics
2. Characteristics of UJT and UJT relaxation oscillator
3. Static transistor characteristics in CE and CB configurations
4. Clipping, clamping, differentiating and integrating circuits
5. Series voltage regulator
6. Frequency response of CE amplifier with and without feedback
7. Emitter follower: measurement of input and output impedance
8. RC phaseshift oscillator
9. Op amp: inverting and noninverting amplifier, voltage follower
10. Op amp: differential amplifier
Reference books
Millman & Halkias, Integrated Electronics, Tata McGraw Hill
Bhargava et.al., Basic Electronic Circuits and Linear Circuits, Tata McGraw Hill
Sessional work assessment
Lab practicals & record = 30
2 tests 2x10= 20
Total marks = 50
CS2K 401 : ENGINEERING MATHEMATICS IV
(Common with IT2K 401)
3 hours lecture and 1-hour tutorial per week
Module I: Fourier transforms (13 hours)
Fourier integrals and Fourier transforms - Fourier integral as the limit of a Fourier series - Fourier integral approximations and the Gibbs phenomenon - Properties of Fourier transforms - Applications of Fourier integrals and transforms - Singularity functions and their Fourier transforms - Fourier integral to the
Module II: Probability distributions (13 hours)
Random variables - Introduction -Discrete random variables - Probability distributions - Continuous random variables - Probability density functions - Mathematical expectation - The expected value of a random variable - Moments - Moment generating function - Special probability distributions - Binomial distribution - Geometric distribution - Hypergeometric distribution - Poisson distribution - Special probability densities - Uniform density - Gamma, exponential and Chi-square distributions - Normal distribution - Normal approximation to binomial distribution
Module III: Jointly distributed random variables (13 hours)
Joint distribution functions - Independent random variables - Covariance and variance of sums of random variables - Joint probability distribution of functions of random variables - Limit theorems - Stochastic processes - Conditional probability and conditional expectation
Module IV: Markov chains and Poisson process (13 hours)
Markov Chains: Introduction - Chapman-Kolmogorov Equations - Classification of states - Limiting probabilities - Exponential distribution and Poisson process - Introduction - Exponential distribution - Properties of Exponential distribution - Poisson process - Counting processes - Definition of Poisson process - Interarrival and waiting time distributions - Further properties of Poisson processes
Text books
1. Wylie C.R. & Barrett L.C., Advanced Engineering Mathematics, McGraw Hill (Chapter 9 for module I)
2. Freund J.E., Mathematical Statistics, Prentice Hall of India (Sections 3.1 to 3.4, 4.1 to 4.5, 5.1 to 5.7 and 6.1 to 6.6 for module II)
3. Ross, S.M. Introduction to Probability Models, Academic Press (Sections 2.5 to 2.8, 3.1 to 3.3, 4.1 to 4.4, 5.1, 5.2.1 to 5.2.3, 5.3.1 to 5.3.4. for modules III & IV)
Reference books
1. Nagarath. I.J, & Gopal M., Systems Modeling and Analysis, Tata McGraw Hill
2. Kreyszig E., Advanced Engineering Mathematics, John Wiley
3. Johnson R.A., Miller & Freund's Probability and Statistics for Engineers, Prentice Hall of
4. Karlin S. & Tailor H., A First Course in Stochastic Processes, Academic Press
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 402 : SYSTEMS PROGRAMMING
(Common with IT2K 402)
3 hours lecture and 1-hour tutorial per week
Module I (15 hours)
Background - System software machine architecture - The simplified instructional computer - Traditional machines - RISC machines. Assemblers - Basic Assembler functions - Machine dependent and machine independent - Assembler features - Assembler design - Assembler design options - Implementation examples - AIX Assembler
Module II (13 hours)
Loaders and linkers - Basic loader functions - Machine dependent and machine independent loader features - Loader design options and implementation examples - Macro Processors - Basic macro processor functions - Machine-independent macro processor features - Macro processor design options and implementation examples
Module III (15 hours)
Introduction to Operating systems - Basic principles - Batch processing - Multiprogramming - Timesharing systems and real-time systems - Parallel and distributed systems - Computer system structure - Computer system operation - I/O structure - structure - Storage Hierarchy - Hardware protection - General system architecture - Operating system structure - System components - OS services - System calls - System structure - Virtual machines
Module IV (9 hours)
General Overview of the UNIX operating system - History of UNIX - System structure - User perspective - Services - Hardware assumptions - Unix Architecture - System concepts - Kernel data structures - System administration process (concepts only)
Text books
1. Beck L.L., System Software - An introduction to Systems Programming, Addison Wesley (modules I, II & III)
2. Bach M.J., The Design of the Unix Operating System,
Reference books
1. Dhamdhere D.M., Systems Programminmg & Operating Systems, Tata McGraw Hill
2. Godbole S., Operating Systems, Tata McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 403 : THEORY OF COMPUTATON
3 hours lecture and 1 hour tutorial per week
Module I (12 hours)
Preliminaries - Review of Proof techniques - Mathematical induction - Countable and uncountable sets - Basic concepts of Languages - Automata and Grammar - Regular Languages: Regular expressions - Finite deterministic and non deterministic automata - Regular grammar - Equivalence between various models (Kleene's theorem) - Boolean closure properties - Homomorphism, substitution - Decision Algorithms - Myhill Nerode theorem and DFA state minimization - Pumping Lemma and proof for existence of non-regular languages
Module II (16 hours)
Context Free Languages - Equivalence of CFG and PDA - Normal forms (CNF and GNF) - Closure properties of CFL's - DCFL's and their properties - Ambiguous CFL's - Decision procedures - CYK algorithm - Pumping Lemma and proof for existence of non context - Free languages - Context Sensitive Languages - Equivalence of LBA and CSG - Turing Machines: TM Computations - Equivalence of standard TM with multitape - Two-way infinite tape and non-deterministic TMs - Turing acceptable, Turing decidable and Turing enumerable language classes - Equivalence of Type 0 grammars with TM's - Church's thesis - Chomsky Hierarchy
Module III (12 hours)
Computability - Closure properties of recursive and recursively enumerable languages - Undecidability - Halting problem - Reductions - Post Correspondence Problem - Unsolvable problems about CFLs - Computational Complexity - Time and space bounded simulations - Classes P and NP - NP- Completeness - Cook's Theorem - Bounded Tiling Problem - Integer Programming - Traveling Salesman Problem
Module IV (12 hours)
Prepositional Calculus - Validity and satisfiability -
Text book
Lewis H.R.& Papadimitriou C.H., Elements of the Theory of Computation, Prentice Hall of
Reference books
1. Hopcroft J. E. & Ullman J. D., Introduction to Automata Theory, Languages and Computation, Narosa
2.
3. Martin J. C., Introduction to Languages & the Theory of Computation, Tata McGraw Hill
4. Savage J.E., Models of Computation, Exploring the Power of Computing, Addison Wesley
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 404 : ELECTRONIC CIRCUITS & SYTEMS
3 hours lecture and 1-hour tutorial per week
Module I (13 hours)
Diode switch, clipping and clamping circuits - Transistor switch - Bistable multivibrator - Schmitt trigger - Monostable and astable multivibrator - Miller and bootstrap sweep generators
Module II (13 hours)
Logic levels - Concepts of SSI, MSI, LSI and VLSI - Logic families: NOT gate, TTL, ECL, CMOS logic - Interfacing - Comparison of logic families - TTL and MOS flip-flops
Module III (13 hours)
Memories: Basic concepts - Read only memories - Programmable ROMs - Static and dynamic random access memories - Memory expansion - Magnetic bubble memories - Magnetic surface storage devices - CD-ROMs - Special memories - Sample and hold circuit - D/A converters - A/D converters - Timing circuits
Module IV (13 hours)
Communication systems - Need for modulation - External and internal niose - Noise figure definition - Amplitude modulation and demodulation - Frequency and phase modulation - Noise and FM - FM demodulation - TRF and superheterodyne receivers - Radiation and propagation of electromagnetic waves
Text books
1. Millman J. & Taub H., Pulse, Digital & Switching Waveforms, McGraw Hill (Module I)
2. Taub H. & Schilling D., Digital Integrated Electronics, McGraw Hill (Modules II & III)
3. Kennedy G., Electronic Communication Systems, Tata McGraw Hill (Module IV)
Reference books
1. Nagarath I.J., Electronics Analog & Digital, Prentice Hall
2. Floyd T.L., Digital Fundamentals, Universal Book Stall
3. Schilling D.L. & Belove C., Electronic Circuits: Discrete & Integrated, McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 405 : COMPUTER ORGANISATION & DESIGN
(Common with IT2K 405)
3 hours lecture and 1-hour tutorial per week
Module I (14 hours)
Computer abstraction and technology: Below your program - Under the covers - Historical perspective - Measuring performance - Relating the metrics - evaluating, comparing and summarizing performance - Case study: SPEC95 benchmark – Instructions - Operations and operands of the computer hardware - Representing instructions - Making decision - Supporting procedures - Beyond numbers - Other styles of addressing - Starting a program - Case study: 80x86 instructions
Module II (12 hours)
Computer arithmetic - Signed and unsigned numbers - Addition and subtraction - Logical operations - Constructing an ALU - Multiplication and division - Floating point - Case study: floating point in 80x86
Module III (11 hours)
The processor: Building a data path - Simple and multicycle implementations - Microprogramming - Exceptions - Case study: Pentium Pro implementation
Module IV (15 hours)
Memory hierarchy - Caches - Cache performance - Virtual memory - Common framework for memory hierarchies - Case study - Pentium Pro memory hierarchy - Input/output - I/O performance measures - Types and characteristics of I/O devices - Buses - Interfaces in I/O devices - Design of an I/O system
Text book
Pattersen D.A. & Hennesy J.L., Computer Organisation & Design: The Hardware/ Software Interface, Harcourt Asia
Reference books
1. Heuring V.P. & Jordan H.F., Computer System Design & Architecture, Addison Wesley
2. Hamacher, Vranesic & Zaky, Computer Organisation, McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 406 : HARDWARE SYSTEMS DESIGN
(Common with IT2K 406)
3 hours lecture and 1-hour tutorial per week
Module I (13 hours)
Historical background of microprocessors - Inside the PC: Motherboard - Graphic adapters and monitors - Drive controllers - Floppy and hard disk drives - Streamers and other drives - Parallel interfaces and printers - Serial interfaces and modems - Network adapters and LANs - CMOS RAM and real clock - Keyboard, mouse and other rodents - The power supply - Operating system - BIOS and memory organisation - 8086/8088 Hardware specification: Clock generator - Bus buffering and latching - bus timing - Ready and wait states - Minimum and maximum modes - Advanced processors - Features of 80386, 80486 and Pentium processors
Module II (13 hours)
Microprocessor architecture: Real mode and protected mode memory addressing - Memory paging - Addressing modes - Data addressing - Program memory addressing - Stack memory addressing - Data movement instructions - Arithmetic and logic instructions - Program control instructions - Programming the microprocessor: modular programming - Using keyboard and display - Data conversions - disk files - interrupt hooks
Module III (13 hours)
Memory interface: Memory devices - Address decoding, 8 bit (8088), 16 bit (8086), 32 bit (80486) and 64 bit (Pentium) memory interfaces - Dynamic RAM. I/O interface - Port address decoding - PPI, 8279 interface - 8254 timer interface - 16550 UART interface - ADC/DAC interfaces
Module IV (13 hours)
Interrupts: Interrupt processing - Hardware interrupts - Expanding the interrupt - 8259A programmable interrupt controller - DMA: DMA operation - 8237 DMA controller - Shared bus operation - Disk memory systems - Video displays - Bus interface: ISA bus - EISA and VESA buses - PCI bus
Text book
Brey B.B., The Intel Microprocessors 8086 to Pentium: Architecture, Programming and Interface, Prentice Hall of India
Reference books
1. Messmer H.P., The Indispensable PC Hardware Book, Addison Wesley
2. Ray K. & Bhurchandi K.M., Advanced Microprocessors & Peripherals, Tata McGraw Hill
3. Hall D.V., Microprocessors & Interfacing: Programming & Hardware, Tata McGraw Hill
4. Miller K., An Assembly Language Introduction to Computer Architecture using the Intel Pentium, Oxford University Press
5. Bigelow S.J., Troubleshooting, Maintaining & Repairing PCs, Tata McGraw Hill
Sessional work assessment
Assignments 2x10 = 20
2 tests 2x15 = 30
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks, 2 from each module
Q II - 2 questions A and B of 15 marks from module I with choice to
answer any one
Q III - 2 questions A and B of 15 marks from module II with choice to
answer any one
Q IV - 2 questions A and B of 15 marks from module III with choice to
answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to
answer any one
CS2K 407(P) : DATA STRUCTURES LAB
[common with IT2K 407 (P)]
3 hours practicals per week
1. Stack and Queue: Implementation using arrays and Linked lists
2. Searching Methods: Binary search and Hashing
3. Sorting: Recursive implementation of Quick Sort and Merge Sort
4. Binary Search Tree: Implementation with insertion, deletion and traversal
5. Infix Expression Evaluation: Using expression tree
6. Graph Search Algorithms: DFS and BFS on a connected directed graph
7. Minimal Spanning Tree: Implementation of Kruskal’s and Prim’s Algorithms
8. Shortest Path Algorithms: Dijkstra and Floyd Warshall Algorithms
9. Disjoint Set operations:
10. Applications of Heap: Priority Queue and Heap Sort
Reference books
1. Cormen T.H., Lieserson C.E. & Rivest R.L., Introduction to Algorithms, Prentice Hall of
2. Sahni S., Data structures, Algorithms & Applications in C++, McGraw Hill
Sessional work assessment
Lab practicals & record = 30
2 tests 2x10= 20
Total marks = 50
CS2K 408 (P) : DIGITAL ELECTRONICS LAB
3 hours practicals per week
1. Verification of truth tables of AND, OR, NOT, NAND, NOR and XOR gates, use for gating digital signals
2. TTL characteristics
3. Verification of the postulates of Boolean algebra and DeMorgan's theorem using logic gates
4. Half and full adders, half and full subtractors
5. Digital comparator, parity generator and checker, and code converter
6. Characteristics and operations of RS, gated RS, D, T, and JK master slave flipflops
7. Multiplexer and demultiplexer using gates
8. Shift register, ring counter, and twisted ring counter
9. Decade counter and variable modulo asynchronous counter
10. Astable multivibrator and schmitt trigger using gates, astable and monostable multivibrator and frequency divider using 555
Reference books
1. Nagarath J., Electronics Analog & Digital, Prentice Hall
2. Millman & Halkias, Integrated Electronics, Tata McGraw Hill
Sessional work assessment
Lab practicals & record = 30
2 tests 2x10= 20
Total marks = 50
No comments:
Post a Comment