KANNUR UNIVERSITY FACULTY OF ENGINEERING Curricula, Scheme of Examinations & Syllabi for B.

Tech Degree Programme (III-IV Semesters) in COMPUTER SCIENCE AND ENGINEERING With effect from 2007 Admissions
THIRD SEMESTER
Code Subject Hours/Wee k L T P/ D 3 3 3 3 3 3 1 8 1 1 1 1 1 1 6 3 3 6 Sessiona l Marks University Examinatio n Hr Marks s 3 100 3 100 3 100 3 3 3 3 3 100 100 100 100 100 800

2K6CS 301 2K6CS 302 2K6CS 303 2K6CS 304 2K6CS 305 2K6CS 306 2K6CS 307(P) 2K6CS 308(P)

Engineering Mathematics II Humanities Discrete Computational Structures Computer Programming Switching Theory & Logic Design Electronic Circuits & Systems Programming Lab Electronics Lab TOTAL

50 50 50 50 50 50 50 50 400

FOURTH SEMSTER
Code Subject Hours/Wee k L T P/ D 3 3 3 3 3 3 1 8 1 1 1 1 1 1 6 3 3 6 Sessiona l Marks University Examinatio n Hr Marks s 3 100 3 100 3 100 3 100 3 100 3 100 3 100 3 100 800

2K6CS 401 2K6CS 402 2K6CS 403 2K6CS 404 2K6CS 405 2K6CS 406 2K6CS 407(P) 2K6CS 408(P)

Engineering Mathematics III Data Structures & Algorithm Systems Programming Microprocessor & Microcontroller Computer Organization & Design Electric Circuits & Systems Data Structures Lab Hardware Lab TOTAL

50 50 50 50 50 50 50 50 400

Power Series: Interval of convergence – Taylors and Maclaurins series representation of functions – Leibnitz formula for the derivative of the product of two functions – use of Leibnitz formula in the Taylor and Maclaurin expansions Module II: Matrices: Concept of rank of a matrix –echelon and normal forms – System of linear equation .2 questions A and B of 15 marks from module III with choice to answer any one Q V . scalar potential. Wiley Eastern 2.absolute convergence – Test for alternating series. Kreyszing E. Viswanathan Publishers Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Mc Grawhill.2 questions A and B of 15 marks from module I with choice to answer any one Q III .consistency – Gauss elimination– Homogeneous liner equations-Fundamental system of solutions. Advanced Engineering Mathematics. Narayanan . Advanced Engineering Mathematics.C.2K 301) 3 hours lecture and 1 hour tutorial per week Module I: Infinite Series: Convergence and divergence of infinite series – Ratio test – Comparison test – Raabe’s test – Root test – Series of positive and negative terms. Engineering Mathematics. S. Module IV: Vector Spaces: subspaces–linear dependence and independence–bases and dimension-linear transformations -sums. conservative force fields. products and inverse of linear transformations. 3.S.2 questions A and B of 15 marks from module IV with choice to answer any one .D.Stoke’s theorem (proof of these not required).2 questions A and B of 15 marks from module II with choice to answer any one Q IV . 4. Prentice Hall of India. Sastri. Greenberg. Advanced Engineering Mathematics. Khanna Publishers. B .Inverse of a matrix – solution of a system of equations using matrix inversion – eigen values and eigen vectors .2K6CS 301 : ENGINEERING MATHEMATICS II (common with EC/IT/EE. Module III: Vector Integral Calculus: Evaluation of line integral. 5.8 short type questions of 5 marks.Cayley. Higher Engineering Mathematics. Advanced Mathematics for Engineering Students. R. Wylie . 6. Pearson Education Asia. Grewal.Green’s theorem. surface integral and volume integrals – Line integrals independent of the path.Hamilton Theorem.S.. S. 2 from each module Q II . S. M. Manickavachagom Pella and Ramaiah.Gauss’ divergence theorem. References: 1.

speaking. 7. Growing need. Science and Technology 1.Reported Speech Module II (14 hours) Technical Communication 1. Penguin Books Ltd. Schrödinger. Cambridge University Press 4. McCarthy. Ashraf Rizvi. Harper and Row 12. Relation between science. Technical reports – types and format Professional Ethics: 1. National Academy of Science. Cambridge University Press 6. New Delhi. History of Science. Cambridge University Press 13. Nature and Greeks and Science and Humanism. Cambridge University Press 2. Cambridge University Press 9. Organization in technical communication – spatial.. Nature. brevity. Cambridge University Press 15. Cambridge University Press 5. History of Science. Effective Technical Communication.Active and Passive Voice . Tata McGraw Hill.cultural differences etc. Cambridge University Press 3. Murphy. copyright – IPR.patents . Science in History. 4. Style in technical communication . India 11. Encyclopedia Britannica. History of Inventions. society and culture – the views of modern thinkers 4. D. 8. Bernal J. Subrayappa. Brownoski J. Intermediate English Grammar. C. Verbal Group. H. 2005 Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . clarity etc.. Pennyor. Ethics in Engineering. History of Science in India. Engineering. Grammar Practice Activities.Tenses – Conditionals . Education and Society 2. 3. English Vocabulary in Use. and writing. M.10 short type questions of 2 marks. chronological etc. English Grammar – An outline. History of Technology 10. Intermediate English Grammar. and Adverbial Group. Supplementary Exercises with answers. from Module 1 . bypassing inter. Cambridge University Press 14. Importance of humanities to technology. Reference books 1.. accuracy. Thompson Press India Ltd. reading. Earth at a Crossroads – paths to a sustainable future. Science and Human Values.2K6CS 302 : HUMANITIES (common with 2K6IT/EC/ 302) 3 hours lecture and 1 hour tutorial per week Module I (20 hours) Functional English Grammar: Sentence Analysis -Basic Patterns -Noun Group. Vesilind. The development of science and technology in society – science and technology in ancient Greece and India – the contribution of the Arabs to science and technology – recent advances in Indian science. Bossel. 5. and importance of technical communication – technical communication skills – listening. Ethics and the Environment. 2. Hashemi. Larson E.Module III (10 hours) Humanities. Relevance of a scientific temper 3. Barriers to effective communication – improper encoding.objectivity. Huddleston R. Dampier W.

2 questions A and B of 15 marks from module III for writing essay answer any one Q V .Q II .10 questions/topics from module II and III for writing short notes answer any seven Q III .2 questions A and B of 15 marks from module III for writing essay answer any one Q IV .2 questions A and B of 15 marks from module III for writing essay answer any one with choice to with choice to with choice to with choice to .

Lagrange’s theorem .Ruler and compass constructions Introduction to cyclic codes Text books 1. 2 from each module Q II . Computer Science – Tata McGraw-Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . completeness and compactness theorems Predicate logic . McGraw Hill 2.Partial order .Factorization and unique factorization Irreducibility .Natural deduction .Consistency completeness and independence Formal proofs . & Busby R.Lattices and Boolean algebra Module III: Group theory (13 hours) Groups and subgroups . J P Manohar R . integral domains and fields .Cosets and normal subgroups .Products and quotients . Elements of Discrete Mathematics.Countable and uncountable sets .Euclidean domains Polynomial rings and division algorithm .Logical arguments .2 questions A and B of 15 marks from module III with choice to answer any one Q V . Discrete Mathematical Structures for Computer Science.Pigeonhole principle .Ideals and quotient rings .Homomorphism theorems . Grimaldi P Discrete & Combinatorial Mathematics.Field properties and extensions . Truss J..L.Resolution .Discrete Mathematical Structures to Applications to . Kolman B.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Addison Wesley (Modules I & II) 2.Cayley’s theorem . Addison Wesley .Soundness.8 short type questions of 5 marks.Unification algorithm Module II: Relational structures (13 hours) Sets relations and functions .Cardinals . 3.Hamming Codes and Syndrome decoding Module IV: Rings and fields (13 hours) Rings.Equivalence relations and partitions ..Permutation groups .2 questions A and B of 15 marks from module I with choice to answer any one Q III .K..Digonalization . Tremblay.. Prentice Hall of India (Modules III & IV) Reference books 1.2 questions A and B of 15 marks from module IV with choice to answer any one . Discrete Mathematics for Computer Scientists. Liu C.2K6CS 303 : DISCRETE COMPUTATIONAL STRUCTURES 3 hours lecture and 1 hour tutorial per week Module I: Logic (13 hours) Prepositional Logic .C.Completeness ..

. Operators Control Statements – if. Pearson Education (Modules I &II) 2.. Programming with Java: A Primer.2 questions A and B of 15 marks from module I with choice to answer any one Q III . Arrays of Pointers. Interfaces. Object Oriented Programming – Concept of Classes. while.. Bruce. switch Functions. Balagurusamy E.. Al & Pohl.. 2 from each module Q II . Benefits Java and OOPPolymorphism and Overriding of methods.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Balagurusamy E.. 3rd Ed.8 short type questions of 5 marks. Strings – Operations and functions ..2K 304) 3 hours lecture and 1 hour tutorial per week Module I (15 hours) Overview of C – Variables. Lexical Elements. Tata McGraw-Hill (Module III &IV) Reference books 1. Kelley. Dynamic Memory Allocations. 4th Ed. Packages – Putting Classes together – Managing Errors and Exceptions – Applet Programming and Graphics Programming (Basics only) – Managing Input/Output Files in Java Text books 1. goto. Expressions and assignments. Operators and Expressions Control Structures – Decision Making. Programming in ANSI C. switch-case. Bitwise Operators and Enumeration Types . Eckel... scope rules. Branching and Looping. recursion Module II (12 hours) Arrays – One dimensional and Multi Dimensional. Pointer-Linked List. break. do.2K6CS 304 : COMPUTER PROGRAMMING (common with 2K6 EC/IT/EE.2 questions A and B of 15 marks from module IV with choice to answer any one . Multiple Inheritance. Thinking in Java. Ira. A Book on C. for . 2nd Ed. Objects and Methods. Files and File Operations Module III (13 hours) Overview of Java Language.Programming in C. Pearson Education Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Tata McGraw Hill 2.Parameter passing .2 questions A and B of 15 marks from module III with choice to answer any one Q V . Inheritance Module IV (12 hours) Arrays and Strings. Fundamental Data Types. Structures and Unions. Variables and Data Types.Constants.

Self-dual functions Logical operations .. Biswas N. Tata McGraw Hill 2. Tata McGraw Hill 3. Introduction to Logic and Computer Design.Clock mode sequential machine . 6th Ed.Shift registers and their applications .PLA minimization .Constants. Leach D.2 questions A and B of 15 marks from module IV with choice to answer any one .Design for testability Module IV (15 hours) Counters and shift registers . JK.Karnaugh map . Prentice Hall of India (modules I. Digital Integrated Electronics.Essential prime cube theorem . Floyd T.Normal and canonical forms .L.8 short type questions of 5 marks.Code conversion .Switching algebra . D and T flip-flops . Kohavi Z.Parallel adders and look-ahead adders – Comparators .State tables and diagrams Text books 1.. McGraw Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .Counter decoding .Triggering of flipflops .SR.Fault diagnosis and testing .2 questions A and B of 15 marks from module I with choice to answer any one Q III .Electronic gates and mechanical contacts Boolean functions and logical operations .Flip-flop applications .Multiplexers and demultiplexers .Parity generators and checkers .Test generation . & Schilling. Alan.Synchronous counters .2 questions A and B of 15 marks from module II with choice to answer any one Q IV .Up-down counters . Malvino A P & Saha-Digital Principles and Applications. 2 from each module Q II .Quine-McClusky algorithm Module II (13 hours) Combinational Logic .. Digital Fundamentals.Prime cubes . Herbert. Marcovitz.Fault table method . Switching & Finite Automata Theory.Ripple counters .Design of sequential circuits . PLAs Module III (10 hours) Fault diagnosis and tolerance .Counter applications .Analysis and design of combinational logic circuits .Latches .Universal property of the NAND and NOR gates – Adders .Postulates and theorems . Tata McGraw Hill 4.Decoders and encoders .2K6CS 305 : SWITCHING THEORY & LOGIC DESIGN (common with 2K6IT 305) 3 hours lecture and 1 hour tutorial per week Module I (14 hours) Number Systems and codes .Excitation tables . Programmable logic arrays .Path sensitisation method .Boolean algebra .ROMs.Fault classes and models .PLA folding . Logic Design Theory. variables and functions . Universal Book Stall (module IV) Reference books 1..Minimum sum of products and product of sums .N.2 questions A and B of 15 marks from module III with choice to answer any one Q V . II & III) 2.Boolean difference method Fault-tolerance techniques. Taub.

Universal Book Stall 3. Millman J. Digital & Switching Waveforms.Magnetic bubble memories . & Belove C.Memory expansion .. ECL.Timing circuits Module IV (13 hours) Communication systems .Special memories . Electronic Circuits: Discrete & Integrated. Electronic Communication Systems. & Taub H. Kennedy G..CD-ROMs .Static and dynamic random access memories . clipping and clamping circuits .Radiation and propagation of electromagnetic waves Text books 1.Interfacing .. Taub H.Sample and hold circuit .Magnetic surface storage devices .Bistable multivibrator Schmitt trigger . TTL.Noise figure definition .TRF and superheterodyne receivers . Tata McGraw Hill (Module IV) Reference books 1.Amplitude modulation and demodulation .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 IV with choice to answer any one . Electronics Analog & Digital.Frequency and phase modulation Noise and FM . Pulse.External and internal niose .Comparison of logic families .8 short type questions of 5 marks..Concepts of SSI. McGraw Hill (Module I) 2.FM demodulation . Digital Fundamentals. Schilling D.Transistor switch .Programmable ROMs . & Schilling D.D/A converters . Prentice Hall India 2. Digital Integrated Electronics. 2 from each module Q II .Read only memories . Floyd T.L. Nagarath I.Need for modulation .L.. McGraw Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I ..Monostable and astable multivibrator .Logic families: NOT gate.2K6CS 306 : ELECTRONIC CIRCUITS AND SYSTEMS (ommon with 2K6IT 306) 3 hours lecture and 1 hour tutorial per week Module I (13 hours) Diode switch.2 questions A and B of 15 marks from module II with choice to answer any one Q IV .TTL and MOS flip-flops Module III (13 hours) Memories: Basic concepts .Miller and bootstrap sweep generators Module II (13 hours) Logic levels .2 questions A and B of 15 marks from module III with choice to answer any one Q V . LSI and VLSI . CMOS logic .A/D converters . MSI. McGraw Hill (Modules II & III) 3.J.

C: The Complete Reference. search.Deletion. Overriding and Exceptions Set 4 (3 lab sessions) JAVA.Programming in C. Schildt H. sinx. Balagurusamy E. 4th Ed.Evaluation of functions like e x. for a given numerical precision using Taylor’s series . Polymorphism. Pearson Education 3.HCF (Euclid’s algorithm) and LCM of given numbers .Conversion of numbers from binary to decimal.. Kelley. deletion .2K6CS 307(P) : PROGRAMMING LAB [common with IT2K 307(P)] 3 hours practicals per week Set 1 (3 lab sessions) C Programming .Lexicographic sorting of a given set of strings Generation of all permutations of the letters of a given string using recursion Set 2 (2 lab sessions) C Programming . hexadecimal. sort and update of a record Set 3 (2 lab sessions) JAVA ..Input/Output File Operations. cosx etc. Files: Use of files for storing records with provision for insertion ..Inverse and determinant (using recursion) of a given matrix . Al & Pohl..Matrix operations: Programs to find the product of two matrices . Tata McGraw Hill 2.. 3rd Ed. Tata McGraw-Hill Sessional work assessment Lab practicals & record 2 tests 2x10= 20 Total marks = 50 = 30 .String manipulation programs: sub-string search. Programming with Java: A Primer. Applet and Graphic Programming Reference books 1. Implementation of Inheritance.Solution to simultaneous linear equations using Jordan elimination.String handling programs. Ira. A Book on C.. octal and back ..

Series voltage regulator 5. NOT.al. voltage follower Set 2: Digital Electronics 1. parity generator and checker.2K6CS 308(P) : ELECTRONICS LAB 3 hours practicals per week Set 1: Circuits 1. T. Reference books 1. Static transistor characteristics in CE and CB configurations 3. Electronic Devices and Circuit Theory. Digital comparator. UJT relaxation oscillator 7. 9th Ed. Astable multivibrator and Schmitt trigger using gates. use for gating digital signals 2. Integrated Electronics. Bhargava et.. Pearson/PHI 3. and JK master slave flipflops 7. Electronics Analog & Digital. ring counter. Shift register. D. Clipping. half and full subtractors 5. Basic Electronic Circuits and Linear Circuits. Verification of truth tables of AND. Nagarath J. and twisted ring counter 9. RC phase shift oscillator. and code converter 6. Decade counter and variable modulo asynchronous counter 10. Half and full adders. Silicon.. Tata McGraw Hill 2. Boylestead & Nashelski. Astable and Monostable multivibrator using 555 IC. Prentice Hall India 4. differentiating and integrating circuits 4. Millman & Halkias. Frequency response of RC coupled amplifier 6. NAND. OR. Characteristics and operations of RS. Multiplexer and demultiplexer using gates 8. gated RS. germanium and Zener diode characteristics 2. Tata McGraw Hill Sessional work assessment Lab practicals & record 2 tests 2x10= 20 Total marks = 50 = 30 . NOR and XOR gates. clamping. Verification of the postulates of Boolean algebra and DeMorgan's theorem using logic gates 4. TTL characteristics 3. OPAMP: inverting and non-inverting amplifier.

Probability and Statistics for Engineers. around semicircle. correlation and regression.2 questions A and B of 15 marks from module I with choice to answer any one Q III .) 3 hours lecture and 1 hour tutorial per week Module I: (13 hours) Complex analytic functions and conformal mapping: Complex functions – limits.mapping by elementary functions Module II: (13 hours) Complex integration: Line integral.2K 401…. Curve fitting: Method of least squares.Cauchy-Riemann equations. logarithmic.elementary complex functions such as powers. Khanna Publishers. Pearson Education Asia. Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Laurent series – residue theorem – evaluation of real integrals using integration around unit circle. B. Cauchy’s integral theorem . Mc Grawhill.2 questions A and B of 15 marks from module III with choice to answer any one Q V . Miller and Freud. 3. J.8 short type questions of 5 marks.S.E. conditional probability and conditional expectations.C.Cauchy’s integral formula – Taylor’s series. 2 from each module Q II . Grewal.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Module IV: (13 hours) Vibrating strings: One dimensional wave equation – D’ Alembert’s solution – solution by method of separation of variables One dimensional heat equation . Prentice hall of India. Kreyszig E. Wylie . derivative. trigonometric and hyperbolic functionsConformal mapping – Linear fractional transformations. Advanced Engineering Mathematics. Freund. analytic function. 4. Johnson. Mathematical Statistics. exponential function.2K6CS 401 : ENGINEERING MATHEMATICS III (common with EC/IT/EE. joint probability distribution functions of random variables. line of regression. Higher Engineering Mathematics. Wiley Eastern 2.solution of the equation by the method of separation of variable Solutions of Laplace’s equation over a rectangular region and a circular region by the method of separation of variable Reference books 1. covariance and variance of sums of random variables.. integrating contours having poles on the real axis Module III: (13 hours) Jointly Distributed Random Variables: Joint distribution functions. 5. Advanced Engineering Mathematics.R.2 questions A and B of 15 marks from module IV with choice to answer any one .. independent random variables .

. Waite. Introduction to Algorithms.Stacks .Heap sort .Heaps and Priority Queues. indirect reference. Text book 1. Thompson Learnig.Enumerated types . Module II (13 hours) Object oriented Programming: Concepts. 3rd Ed.Quick sort . SAMS publishing 5..L.2 questions A and B of 15 marks from module IV with choice to answer any one .Binary search . Algorithms +Data Structures = Programs. 2nd Ed..sets . & Ullman J.Merge sort .Recursion: Recursive algorithms ... Hopcroft J.Selection sort .. Data Structures and Algorithms in Java.BFS. Linear Data structures: linked structures– Ordered array.E..E.. insertion and deletion in linked lists .8 short type questions of 5 marks. Linked nodes.Pearson Education Reference books 1. Sedgewick. Adams. Data Structures with JAVA – Pearson Education (Module II.Sequential search ..Queues – Collections -Lists .Primitive types . Module IV (16 hours) Searching . 1990 4. Data Structures and Algorithms in Java.resolution of collisions .Analysis of recursive algorithms – Solution of recurrences. & Rivest R.2 questions A and B of 15 marks from module III with choice to answer any one Q V ... Lafore Robert.. Aho A.NlogN sorts . MIT Press. Data Structures and Algorithms in Java. Shortest path algorithms. Binary trees – traversals.Time and space complexity of algorithms using “big oh” notation .Scalar types ..2K6CS 402 : DATA STRUCTURES & ALGORITHMS (common with 2K6IT 402) 3 hours lecture and 1 hour tutorial per week Module I (10 hours) Review of data types . Spanning trees . Prentice Hall 7.V.Introduction to simple hash functions ..H. ADT. Algorithms in JAVA.Stack and queue implementation using array Module III (13 hours) Non linear structures: -Trees . Drozdeck. Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . SAMS publishing 6. 2nd Ed. DFS.records . Data Structures and Algorithms. Robert. Addison Wesley (Module I) 2. III & IV) 3.Insertion Sort .Searching arrays and binary search trees Hashing .Complexity of algorithms . Graphs..2 questions A and B of 15 marks from module II with choice to answer any one Q IV . 2 from each module Q II .Data abstraction . Mitchell.D. Cormen T. Wirth N. Hubbard J R & Huray Anita.Character strings arrays . Leiserson C.Sorting: n2 Sorts Bubble sort .2 questions A and B of 15 marks from module I with choice to answer any one Q III .

M.Basic loader functions . Beck L. different phases of compilers (Introduction only). (4th module) Reference books 1.Computer system structure . loader features Loader design options – Linkage editors. ANSI C Macro language . The Design of the Unix Operating System. Sun OS linker Module III (9 hours) Macro Processors .2 questions A and B of 15 marks from module III with choice to answer any one Q V . Addison Wesley (First 3 Modules) 2.MS-DOS Linker. P. Introduction to Operating systems .Storage Hierarchy Hardware protection .J. Operating system (5th edition).2 questions A and B of 15 marks from module I with choice to answer any one Q III . Pearson edn. Galvin..Assembler design ..Machine dependent and machine independent . Dhamdhere D.Basic macro processor functions .Basic Assembler functions . System Software .L.8 short type questions of 5 marks. Addison Wesley (4th Module) 3.An introduction to Systems Programming. Machine independent features . Tata McGraw Hill 2. Assemblers . Interpreters.2 questions A and B of 15 marks from module IV with choice to answer any one .RISC machines. Dynamic linking. Aho.Assembler features .structure . Godbole S.Assembler design options . Operating Systems. implementation examplesMASM Macro processor. Recursive Macro expansion.2K6CS 403 : SYSTEMS PROGRAMMING (common with2K6IT 403) 3 hours lecture and 1 hour tutorial per week Module I (15 hours) Background . techniques & Toolss ..code compilers. Revi sethi.The simplified instructional computer Traditional machines .Basic principles – Batch processing .Multiprogramming Timesharing systems and real-time systems .2 questions A and B of 15 marks from module II with choice to answer any one Q IV .Parallel and distributed systems .automatic library search .Machine dependent features – relocation and program linking.Implementation examples .Machine-independent macro processor features – Macro processor Algorithm and Data structures.System software machine architecture . 2 from each module Q II .I/O structure . Compilers Principles. Conditional Macro expansion. Tata McGraw Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .AIX Assembler Module II (13 hours) Loaders and linkers . Prentice Hall India (module IV) 3.. Silberschatz.General system architecture – Case Study: General Overview of the UNIX operating system Text books 1. General purpose macroprocessors .Computer system operation . Module IV (15 hours) Basics of Compilers: Basic compiler functions. Systems Programminmg & Operating Systems. Bach M. Boot strap loaders and implementation examples.

Prentice Hall of India 4.CPU operation .Minimum and maximum mode . Mohammed R.High speed inputs and outputs ..Pin configuration . 2 from each module Q II .Software overview . selectors...A.Peripheral overview . Microcomputer System: The 8086/8088 Family..J.Superscalar architecture Module IV (13 hours) Intel 80196 microcontroller . EBK 6485 Embedded Microcontrollers Data Book 6. Liu Y. description tables and TSS .Addressing modes . Microcontrollers-Architecture.Memory addressing .Assemblers .Architecture .Interfacing chips .Special features of the pentium processor . Tribel W.Real and protected mode .2K6CS 404 : MICROPROCESSORS & MICROCONTROLLERS (common with 2K6IT 404) 3 hours lecture and 1 hour tutorial per week Module I (15 hours) Intel 8086 processor . Microprocessors & Interfacing. Microprocessors & Microcomputer Based System Design. McGraw Hill 3.Serial port . Programming & Interfacing.C. Embedded Microcontrollers and Processors 2.Branch prediction logic . Intel Data Book Vol.B..Architecture.Programmable communication interface (8251) . & Gibsen G. McGraw Hill 2.Descriptors.V.Interrupts .Programmable interrupt controller (8257) .1.8 short type questions of 5 marks.PWM timers . Implementation & Programming. The 8088 and 8086 Microprocessors.Memory management unit .Instruction set .Special modes of operation Text books 1.Programmable timer (8253) .DMA controller (8259) . Intel Data Book.Interrupts .Keyboard display interface (8279) Module III (12 hours) Introduction to 80386 . The Intel Microproessors . Brey B.Assembly language programming . & Singh A. Prentice Hall 3.Memory paging . Universal Bookstall 4. & Tabak D.Timing diagrams . Intel Data Book. McGraw Hill Reference books 1. EBK 6486 Embedded Applications Book Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .2 questions A and B of 15 marks from module I with choice to answer any one ..Memory space .Address decoding .Programmable peripheral interface (8255) .Multiprocessor configuration Module II (12 hours) Interfacing . Hintz K.A. Intel Data Book EBK 6496 16 bit Embedded Controller Handbook 5. Hall D.

2 questions A and B of 15 marks from module IV with choice to answer any one .2 questions A and B of 15 marks from module II with choice to answer any one Q IV .Q III .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 II with choice to answer any one Q IV .Case study: floating point in 80x86 Module III (11 hours) The processor: Building a data path . Pattersen D. McGraw Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Computer Organisation.Relating the metrics ..F.Simple and multicycle implementations Microprogramming .Cache performance .Operations and operands of the computer hardware .2 questions A and B of 15 marks from module III with choice to answer any one Q V .P & Jordan H.2 questions A and B of 15 marks from module IV with choice to answer any one .Common framework for memory hierarchies . Computer Organisation & Design: The Hardware/ Software Interface.Virtual memory ..Signed and unsigned numbers .Multiplication and division .Addition and subtraction .Case study: Pentium Pro implementation Module IV (15 hours) Memory hierarchy .Input/output .Representing instructions .Measuring performance .evaluating. & Hennesy J.Logical operations .L.Caches .Constructing an ALU . Hamacher.Starting a program Case study: 80x86 instructions Module II (12 hours) Computer arithmetic .Exceptions .Making decision Supporting procedures .Pentium Pro memory hierarchy . Vranesic & Zaky. Harcourt Asia Reference books Heuring V. 2.A.Historical perspective .Under the covers .Interfaces in I/O devices .Case study: SPEC95 benchmark – Instructions .8 short type questions of 5 marks.Beyond numbers . Computer System Design & Architecture. 1.Case study .2K 6CS 405 : COMPUTER ORGANISATION & DESIGN 3 hours lecture and 1 hour tutorial per week Module I (14 hours) Computer abstraction and technology: Below your program .Buses .I/O performance measures . comparing and summarizing performance .Types and characteristics of I/O devices .Other styles of addressing .Design of an I/O system Text book 1. 2 from each module Q II .Floating point . Addison Wesley .2 questions A and B of 15 marks from module I with choice to answer any one Q III .

Block diagram ..K. Electric Circuits. 2 from each module Q II . Schaum ‘s Outline Series. Module II (12 hours) Laplace transform .2 questions A and B of 15 marks from module IV with choice to answer any one .Frequency response .Dynamic responses . John Wiley Reference books 1.Poles and zeros .. Edminister.node and mesh analysis.Application of Laplace transform for the solution of differential equations . Siskind. Electrical Circuits. Module IV (16 hours) Introduction to systems . coupled circuits . & Dorf R.Interconnection of two port networks .concept of time constant .C.System response .Transfer function .Definition of graph. cut sets and loops .Stability analysis using frequency response (Bode plot) and using root locus Text books 1.trees incidence matrix .Admittance and hybrid parameters .2 questions A and B of 15 marks from module III with choice to answer any one Q V . Kuo F. Andersons bridge and Scherring bridge . Circuits Devices & Systems.Polyphase circuit 3 phase circuit with balanced and unbalanced loads .Driving point and transfer functions.Transient analysis of RL. Smith R.Applications of graph theoretic methods for the formation of network equations. McGraw Hill 2. Network Analysis & Synthesis. Chang D.Control system characteristics .Wiens bridge.Principles of Maxwells bridge .Two port networks . 3.Systems engineering .Concept of impedance .Feedback control .. RC and RLC circuits . McGraw Hill Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .First and second order systems .J.2K6CS 406: ELECTRIC CIRCUITS AND SYSTEMS 3 hours lecture and 1-hour tutorial per week Module I (12 hours) Network theorems – Kirchoff’s current and voltage law-superposition theorem – Thevenin’s theorem – Norton’s theorem .star-delta transformation Module III (12 hours) Bridge circuits .2 questions A and B of 15 marks from module I with choice to answer any one Q III .8 short type questions of 5 marks. Analysis of Linear Systems. John Wiley 2.2 questions A and B of 15 marks from module II with choice to answer any one Q IV .

Searching Methods: Binary search and Hashing 3. Graph Search Algorithms: DFS and BFS on a connected directed graph 7.E.. Insertion Sort 4.. & Rivest R. Hubbard J R & Huray Anita. Prentice Hall of India 2. Shortest Path Algorithms: Dijkstra and Floyd Warshall Algorithms 9. Sorting: Recursive implementation of Quick Sort and Merge Sort 5. Minimal Spanning Tree: Implementation of Kruskal’s and Prim’s Algorithms 8. Cormen T. Binary Search Tree: Implementation with insertion. Introduction to Algorithms. Stack and Queue: Implementation using arrays and Linked lists 2. Applications of Heap: Priority Queue and Heap Sort Reference books 1. Data Structures with JAVA – Pearson Education Sessional work assessment Lab practicals & record = 30 2 tests 2x10= 20 Total marks = 50 . Lieserson C. N2 algorithms – Bubble sort..H.L. deletion and traversal 6.2K 6CS 407(P) : DATA STRUCTURES LAB [common with IT2K 407 (P)] 3 hours practicals per week 1.

Lab 11 : Familiarization of Microcontroller Kit Lab 12 : Interfacing with Microcontroller Kit Reference books 1.9 : Parallel Interface: Printer and HEX keyboard.. 3/e..P The Indispensable PC Hardware Book. Jan. Implementation & Programming.3 : Assembly language programming Lab 8.. 2/e. 3.J. Tata McGraw Hill Norton P. & Tabak D.. Microcontrollers-Architecture. Ayala. Axelson. Messmer H. The Microcontroller Idea Book. 2. Dos Internals Hintz K. Addison Wesley . 4.. McGraw Hill 5. Kenneth J.V. Lab 10 : Serial Interface: PC to PC serial interface using NULL MODEM. Hall D. Penram Publishers Sessional work assessment Laboratory practicals and record Test/s Total marks = 20 = 50 = 30 . Microprocessors and Interfacing. Penram Publishers 6.2K6CS 408(P) : HARDWARE LAB 3 hours practical per week Lab 1 Lab 4 Lab 5 Lab 6 Lab 7 : Identification of components/cards and PC assembling from components : TSR (Terminate and Stay Resident) Programming : ADC and DAC interface : Waveform Generation : Stepper Motor interface Lab 2. The 8051 Microcontroller.