course contents - ug - National Institute of Technology Karnataka

More documents

Recommendations

Info

NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ Pucknell & Shrayhian, Basic VLSI design systems and circuits, PH India 2000 ParagK.Lala, Fault tolerant & fault testable hardware design, B.S pub, 2003. CO203 UNIX PROGRAMMING (2-0-3) 4 PREREQ : CO100 Introduction to Unix / Linux Operating System;. Basic commands- such as cp, mv, mkdir, rm, ls, ln, grep, wc, find, sed, awk. Usage of gcc and gdb. Basic system administration skills. Usage of the vi editor. Shell programming. Installation of the Linux Operating System and precautions to be taken. Basics of Kernal modules. Introduction to Linux device drivers. MAKE Files. Brian W.Kernighan, The Unix Programming Environment, Pearson Education 2003 Jeff Horwitz,Unix System Management-Primer Plus, Sams / Pearson Education, 2003 Mark G.Sobell, A Practical Guide to Red Hat Linux 8 Pearson Education, 2003. www.tldp.org (The Linux Documentation Project) CO204 DATA STRUCTURES AND ALGORITHMS (3-1-0) 4 PREREQ: CO 100 Algorithm analysis and design techniques. Basic data structures � Stack, Queue and List �their sequential and linked representations, variations, operations with algorithms on these; Trees and graphs and sets - variations, operations and representation methods. Algorithms for Searching & Sorting. Data structures and algorithms for external storage. Data structures & Algorithms- Alfred V Aho, John E Hoperoft, Jeffrey D. Ullman- Addison Wesley. 2003 Data Structures and Algorithms using C/C++, Horowitz and Sahni, 2003 CO205 DATA STRUCTURES LAB (0-0-3) 2 PREREQ: C0 101 Implementation of array operations: Stacks, Queues, Circular Queues, Multiple stacks and queues. Implementation of linked lists: stacks, queues, polynomial operations. Doubly linked lists. Tree traversal: AVL tree implementation, application of trees. Hash Table. Searching and sorting. Mark Allen Weiss, Algorithms Data structures and problem solving with C++, Addison Wesley CO206 DIGITAL SYSTEMS LAB (0-0-3) 2 PREREQ: EC150 Design of basic gates, adders, subtractors, encoders, decoders, shifters: up, down, up-down, counters, flipflops, code conversion, multiplexers(All using behavioral modeling). Introduction to structural modeling: Adders, subtractors, multiplexors, counters, multiplier(array multiplier), Design of FSM: Moore machine, Melay machine. J. Bhasker, VHDL primer, 3 rd edition, Addison Wesley Longmen Singapore Pvt. Ltd. Douglas Perry, VHDL by McGraw Hill International, 1998. Peter Ashenden, The Designer Guide to VHDL by 1998 CO207 INTRODUCTION TO COMPUTER HARDWARE (0-0-2) 1 Study of Digital IC�s, Oscilloscopes, Function Generators, Regulated Power Supply (RPS). CO250 MICROPROCESSOR AND INTERFACING (3-1-0) 4 PREREQ: CO201 Microprocessor Architecture, 8086, Instruction set, Subroutines, Programming examples, Software development with Interrupts; Intel 80286, 80386; Programmable peripheral devices, 8255, 8253, 8259,8257, Motorola 68000 Processors, 68020, 68030; Mother boards, I/o bus, I/o channel, BIOS, DOS, PC bus, Multibus I & II, VME, CRT Controller, Floppy disc Controller, Hard disc Controller, CD ROM Drive, Serial Communication Controller, Pen drive, Mouse drive. Doughlas V. Hall, Microprocessors & Interfacing, TMH, 2000 Govindarajlu, IBM PC & Clones, 2003. CO251 OBJECT TECHNOLOGY (3-0-0) 3 PREREQ: CO100 Problems in software development & Complexity; importance of Design & Development; Object Oriented Vs Algorithmic decomposition; Concepts in Object Technology-Abstraction/Objects, --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 28 of 134
NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ Encapsulation, Inheritance, Polymorphism; potential benefits of Objects; Applications of Object Technology � OOA, OOD, OOP and OO Systems Engineering-OOSE; Study of UML and its role in OOA and OOD; RUP; OOP using Java and Program development; Introduction to Component Objects and current trends. Grady Booch, Object Oriented Analysis & Design with Applications, 3 rd ed, Addison Wesley 2003. C.Thomas Wu, An Intro. To OOP with Java, 2 nd Ed, McGraw Hill International, 2001 CO252 PRINCIPLES OF DATA COMMUNICATION (3-0-0) 3 PREREQ: CO202 Evolution of Data Communication and Networks; Transmission fundamentals: Signals, media, encoding and modulation, multiplexing, devices, error detection and correction, Data link control and protocols, data transmission over networks - switching techniques and LAN. William Stallings, Data and Computer Communications and Networking, 2nd Edition, TMH, 2002. Behrouz A Forouzan, Data Communications and Networking, 2nd edition, TMH, 2002 Leon, Garcia and Widjaja - Communication Networks, TMH 2002. CO253 COMPUTER GRAPHICS (3-0-0) 3 PREREQ: CO 100, CO 204 GRAPHICS hardware. Scan conversion: lines, circles, ellipses. Filling algorithms. Clipping algorithms. 2D Graphics & Transformations; Viewing in 3D, 3D projections & transformations. Curves and surfaces, Visible surface determination. Illumination and shading. Animation. Hearn & Baker, Computer Graphics Principles and Practice- C version, 2003 Van Dam, foley, Feimer, Hugher, Computer Graphics Principles and Practice in C, Addison Wesley CO254 THEORY OF COMPUTATION (3-0-0) 3 PREREQ: MA 252 Formal Languages and Automata Theory: Generative grammar, Chomsky hierarchy, Finite state Automata: Definition, Concept of Non-determinism, Equivalence of deterministic and Non-deterministic Automata; Relation between CFL and Type3 grammars; Pumping Lemma for CFL; Closure properties. Push down Automata: Definition, Equivalence between NPDA and context free grammars, Pumping Lemma for C.F.L's,Decision problems, Closure properties. Turing machines:Definition, extension to turing machines: Multi-track, Multi-tape, and Non determinism. TM as an acceptor, TM as a computing device; Relation between TM and type-0-grammars. Universal Turing Machine, Concept of computability, Undecidable problems. Recursive function theory: Primitive recursive functions, general recursive function, relation between general recursive functions and Turing machines, Church�s thesis, P, NP, NP- Hard & NP- Complete problems. J.E.Hopcroft and J.D.Ullman, Introduction to automata, Languages and computation, Narossa/Addison Wesley. H.E.Lewis and C.H. Papadimitiou,Elements of the Theory of Computation,Prentice-Hall of India, 1981. Derickwood, Theory of Computation, John Wiley & Sons. CO255 MICROPROCESSOR LAB (0-0-3) 2 PREREQ: CO206 Experiments based on 8086 microprocessor, Programming 8086, Using various interrupts, BIOS, DOS, Assembly level Programming, Display Controller, Keyboard & Mouse Controller, FDC and CDC; interfacing with ADC, DAC, PLC etc. ROM-BIOS service summary- Programmer’s Guide to the IBM PC. CO256 COMPUTER GRAPHICS LAB (0-0-3) 2 PREREQ: CO 101, CO 205 Scan conversions: lines, circles, ellipses. Filling algorithms, clipping algorithms. 2D and 3D transformation. Curves. Visible surface determination. Simple animations Application of these through exercises in C/C++/ Open GL Van Dam, foley, Feimer, Hugher, Computer Graphics Principles and Practice in C- - Addison Wesley. --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 29 of 134
Page 1 and 2: NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 27: NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 79 and 80:
NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
show all

course contents - ug - National Institute of Technology Karnataka

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?