course contents - ug - National Institute of Technology Karnataka

More documents

Recommendations

Info

NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ Testing of rubber mats. Testing of Gas Insulated Substations. There will be few typical experiments based on the course content. Kamaraju, Naidu, High Voltage Engineering. Kuffel, Zeangle, High Voltage Engineering. Relevant Indian standards and Technical papers. EE476 OPTIMISATION TECHNIQUES (3-0-0) 3 Linear Programming: Simplex method and extensions. Network models: Shortest path, maximum flow and minimum cost problems. Dynamic programming: resource allocation, production scheduling and equipment replacement problem. Non-linear programming: selected unconstrained and constrained nonlinear programming algorithms like quasi Newton, reduced gradient and gradient projection methods. Penalty function methods, Quadratic programming. Lueneburger , Linear and Non linear Programming, McGraw-Hill. Fletcher, Optimization techniques, John Wiley and Sons. EE478 AN INTRODUCTION TO THE INTEL IA-32 ARCHITECTURE (3-1-0) 4 A brief history of the IA-32 architecture, the Intel P6 family of processors � Intel Pentium®, Xeon®, Pentium® M, Pentium® Extreme, Core� Duo and Core� Solo. SIMD instructions, Hyper-threading technology, Multicore technology. Basic execution environment, Memory Organization, Paging and Virtual memory, Address calculations in 64-bit mode. basic program execution registers, Instruction pointer, Operand addressing, memory operands, segmentation, I/O port addressing. Data types: numeric, pointer, bit-field, string, packed-SIMD, BCD. Implementation of the IEEE 754 floating point format. Overview of FP exceptions and FP exception handling. Instruction set summary � General purpose instructions, FPU instructions, MMX instructions, SSE instructions, SSE2 and SSE3 extensions. Programming with GP instructions, Programming with the x87 FPU. Instruction prefixes, encoding, displacement. Interrupts and exception handling. Programming the IA-32 in the GNU/Linux environment. Intel Corporation, IA-32 Intel Architecture Software Developer's Manual, Volume1:Basic Architecture, Intel Corporation, 2006. Intel Corporation, IA-32 Intel Architecture Software Developer's Manual, Volume 2A: Instruction Set Reference, A-M, Intel Corporation, 2006. Intel Corporation, IA-32 Intel Architecture Software Developer's Manual, Volume 2B: Instruction Set Reference, N-Z, Intel Corporation, 2006. Intel Corporation, IA-32 Intel Architecture Optimization Reference Manual, Intel Corporation, 2006. http://developer.intel.com/design/ http://www.intel.com/design/archives/ http://www.x86.org/intel.doc/ EE489 ADVANCED ELECTRIC DRIVES LAB (0-0-3) 2 Laboratory exercises and assignments to provide additional support to EE468. EE490 SEMINAR (0-0-2) 1 This course is a 1 credit course to be completed during 7 th / 8 th semester. The student will make presentations on topics of academic interest. EE491 INSULATION AND TESTING ENGINEERING LAB LAB (0-0-3) 2 Laboratory exercises and assignments to provide additional support to EE472. EE499 MAJOR PROJECT-II (0-1-6) 5 --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 70 of 134
NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ Department of Information Technology IT200 DATA STRUCTURES AND ALGORITHMS (4-0-0)4 PREREQ:CO100 Simple Data types and data structures, Concepts of complexity analyses, worst, best and amortized analyses, Linked lists, stacks, queues, arrays; Concepts of Priority Queues, Hash Tables. Sorting, Search Trees, Graphs; Algorithms design concepts like Divide & Conquer, Dynamic Programming and Greedy. Aho, Ullman and Hopcroft – Data Structures and Algorithms, Addison Wesley T.H Cormen, C.E. leiserson and R.L Rivest - Introduction to Algorithms – The MIT Press, Cambridge, Massachusetts, USA, 1990. IT201 FUNDAMENTALS OF SIGNAL PROCESSING (4-0-0) 4 PREREQ: MA101 Fundamentals of Signals and Systems, Fourier Transforms: DFT, Discrete Cosine; Laplace and Z Transforms, Concepts of Digital Filters, Applications-Waveform generator modulation /demodulation etc E. W. Kamen and B. S. Heck, “ Fundamentals of Signals & Systems using the WEB and MATLAB” , Prentice- Hall, 2000 S. K. Mitra, “ Digital Signal Processing Laboratory Using MATLAB” , McGraw-Hill, 1999 J. H. McClellan et al, “ Computer-Based Exercises for Signal Processing using MATLAB 5.0” , Prentice Hall, 1998 Sophocles J. Orfanidi, “ Introduction to Signal Processing” , Prentice Hall, 1995 IT202 MATHEMATICAL FOUNDATIONS OF INFORMATION (4-0-0)4 PREREQ:MA101 TECHNOLOGY Propositional and Predicate Calculus, Applications to AI, Lattice Theory and Boolean Algebra, Introduction to Graph Theory, Trees, Planarity, Groups, Posets, Normal Subgroups, Permutation Groups, Burnsides� theorem; Introduction to Probability and Statistics: PDF, CDF, Applications to IT. Tremblay and Manohar, “ Discrete Mathematical Structure with Applications to Computer Science” , McGraw-Hill C L Liu, “ Elements of Discrete Mathematics” , McGraw-Hill International Edition P L Meyer, “ Introductory Probability and Statistical Applications” , Addison - Wesley IT203 DIGITAL DESIGN AND COMPUTER ORGANIZATION (4-0-0) 4 PREREQ: CO100 Number systems and codes, logic functions, logic families, combinational circuits, sequential circuits, Basics of CPU, CPU organization, Data Representation. Instruction Sets, Data path design, Fixed Point arithmetic, ALU design, Memory organization, Control design, Introduction to Pipeline. N. S. Gill, J. B. Dixit, Digital Design and Computer Organization, USP, 2008 Hamaher, V.Carl, Vranesi, Zvonko Computer organization McGraw Hill J.P. Hayes Computer Architecture and organization III Edition, McGraw Hill, 1998 W. I. Fletcher, An Engineering Approach to Digital Design, PHI, 1999. D.D. Givone, Digital Principles and Design, TMH, 2002 IT204 UNIX PROGRAMMING AND PRACTICE (2-0-3) 4 PREREQ: CO100 Introduction to UNIX OS, history, features, architecture, basic utility commands such as cp, mv, mkdir,rm, ls, grep, find, sed, file utility commands, file attributes, ownerships, permissions and other related utility commands, Usage of vi/vim editor, for programming in C/C++, compilers, debuggers, profilers (like gprof), makefiles, IDEs (for Java development like eclipse), Shell and shell programming, process control commands such as ps, nice, at, mesg, cron, etc, Assignments for lab sessions. Sumitaba Das, Unix concept and applications Richard W Stevens, UNIX Network Programming, Prentice Hall PTR Roderick Smith O’relly UNIX Power Tools- IT205 DATA STRUCTURES AND ALGORITHMS LAB (0-0-3) 2 PREREQ: CO101 Implementation of array operations: Stacks, Queues, Circular 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 --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 71 of 134
Page 1 and 2:
NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20: NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 69: NATIONAL INSTITUTE OF TECHNOLOGY KA
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

Create successful ePaper yourself

Delete template?

Save as template?