NIT Surathkal Syllabus Department of Mining Engineering 2nd Year

NIT Surathkal Syllabus Department of Mining Engineering

2nd Year

 

CO200 INFORMATION SYSTEMS (3-0-0) 3 PREREQ: CO140

Information System Design and Development – phases; System analysis methods – Data, Process,

Network and Object modeling; System design approaches / methods – architectures and processes, input

and output, prototyping; system implementation, safety & security, maintenance.

Jeffrey.L.Whitten, Lonnie.D.Bentley, System analysis and design methods 4th edition, TMH, 2002

James.A.Senn, Analysis and Design of Information System, 2nd edition, McGraw Hill, 2002

 

 

CO201 COMPUTER ORGANISATION AND ARCHITECTURE (3-0-0) 3 PREREQ: CO100

Logical organization of computers; Processor basics, CPU organization, Data Representation, Instruction

Sets, Data path design, Fixed Point arithmetic, ALU design, Control design: Basic concepts, Micro

programmed Control & hardwired; Introduction to parallel processing: Principles of pipeline and vector

processing. Multiprocessor architectures and programming.

J.P.Hayes Computer Architecture and organization III Edition, McGraw Hill, 1998.

Patterson and Henessy, Computer Architecture A quantitative approach, Morgan Kanfmann – 2000

Hwang and Briggs, Computer Architecture and parallel processing, McGraw Hill, 1985.

David A. Patterson & John L. Hennessy, Computer Organization and design, Morgan Kaufmann Publ.,

3rd edition.

 

 

CO202 DESIGN OF DIGITAL SYSTEMS (3-0-0) 3 PREREQ : EC100/EC101

Switching algebra and logic circuits; combinational and sequential circuits and their algorithmic

synthesis; Computer aided synthesis and optimization (introduction); Hardware modeling using VHDL;

Logic optimization: two level, multi level, circuits; Introduction to VLSI design: MOS devices, system

level design; Introduction to VLSI testing: fault models, testing combination and sequential circuits.

Alan B.Marcovitz, Intro. To Logic Design, TMH, 2002.

Giovanni De Micheli, Synthesis and Optimization of Digital circuits, 2000

Zvi Kolavi, Switching and finite automata theory, Tata McGraw Hil 2000

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, 3rd 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,

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, 3rd ed, Addison Wesley 2003.

C.Thomas Wu, An Intro. To OOP with Java, 2nd 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.

CO300 OPERATING SYSTEMS (3-0-0) 3 PREREQ: CO203

Introduction to O.S, File Systems, CPU scheduling, Memory management, Disk Scheduling algorithms,

virtual memory concept, Deadlocks, Concurrent processes, Performance Evaluation, Operating system

Security, Case Studies – The UNIX operating system

Silberschartz & Galvin, Operating System

Leave a Comment