|
|
Detailed Outline of the course as per rule (5) examination scheme of M .Sc. in Information Technology.
Note to the Examiners: -
MIT - 101: Computer Architecture Note: Students who have not been studied Basic electronics are required to undertake 20 hrs of basic electronics course in addition to 50 hrs of normal teaching in this paper. Introduction: Digital Logic: Logic gates, Map Simplification, Combinational circuits: Half Adder and Full Adder. Sequential circuits: Flip-flops SR, JK, D, T, Edge triggering and level triggering. Brief idea about sequential circuits and combinational circuits design. Digital components: Integrated Circuits, Decoders: NAND gates decoder, Decoder expansion, Multiplexer, Registers, Registers with parallel load, Shift Registers, Binary Counter, Random Access Memory, Read Only Memory. Brief history of computer architecture and progresses. Von Neumann model of a digital computer. Chapter 1 & 2 of text book by Morris Mano Note: Two questions may be set from above topics. Only block schematic approach to be made. Data Representation: Data types, Complements, Fixed points representation; Floating-point representations, Error detection codes. Register Transfer and Micro operations: Register Transfer language, Register transfer, Bus and Memory transfer, Arithmetic, Logic and shift microoperations. Hardware implementation: Arithmetic Shift Unit. Chapter 3 & 4 of text book by Morris Mano Note: One question may be set from above topics Basic Computer Organization and Design: Instruction codes, stored program organization, indirect addressing, Computer Registers, Computer Instructions, Timing and control, Instruction cycle, Memory reference instructions, I/O and Interrupts, Design of a basic computer, Design of Accumulator logic. Chapter 5 of text book by Morris Mano Note: One question may be set from above topics Programming of BASIC Computer: Machine Language, Assembly Language, Assembler, Programming, Arithmetic and Logic operations, Input and Output programming. Microprogrammed Control Unit: Control memory, Basic ideas of address sequencing. Decoding of microoperation fields. Chapter 6 & 7 of text book by Morris Mano Note: One question may be set from above topics Central Processing Unit: Central Register Organization, Stack organization, Instruction formats, Addressing modes, Data Transfer and manipulation, Program Control. Chapter 8 of text book by Morris Mano Assembly Language Programming: Assembly Language Programming 8085 and 8088 Microprocessors: Basic architecture, Registers, addressing modes, Instruction sets. Assembly language programming. Reference book: R.S.Gaonkar Note: One question may be asked from above topics Computer Arithmetic: Addition and Subtraction, Multiplication, Division algorithms, Floating-points operations, Decimal Arithmetic operations. Memory: Organization of a basic random access memory, cache memory and virtual memory: Direct, associative, and set associative cache mapping schemes, multilevel caches. Overlays, replacement policies, segmentation, fragmentation, and the translation look aside buffer. Memory management, memory modules used in PC’s: SDRAM, DDR, Rambus memories. Chapter 11 and 12 of text book by Morris Mano Note: One question may be asked from above topics Input and Output: Bus communication, bus access methods and Bus-to-bus bridging. Various I/O devices commonly used such as disks, keyboards, printers, and displays. Computer buses & interfaces. PC hardware components: Motherboard and components, chipsets PCI bus, AGP IDE and SCSI Interfaces. I/O ports: Serial, Parallel, USB ports. Specification of typical PC, Workstation and Server computers. Trends in Computer Architecture: To cover advanced architectural features that have either emerged or taken new forms in recent years. Reduced instruction set computer (RISC) processors and the architectural implications of RISC. Multiple instruction issue machines and very large instruction word (VLIV/) machines. Introduction to parallel and distributed architectures. Case Study: Pentium IV processor. Reference Book: -
Text books: - M. Morris Mano, Computer System Architecture, Third Edition, Pearson Education Asia R. S. Gaonkar, Microprocessor Architecture Programming & Application MIT - 102: Programming Languages Introduction to programming languages: Abstractions, language definitions, translation and design, development of programming languages Language Design Principles: Design criteria, efficiency, generality, Orthogonality, Uniformity. Ref: Robert Sabesta - Chapter 1, 2 Pratt- chapter 2 Note: One question may be set from above topics Syntax: Lexical Structure of Programming Languages, Context-Free Grammars and BNFs, Parse Trees and Abstract Syntax Trees, Ambiguity, Associativity, and Precedence, EBNFs and Syntax Diagrams, Parsing Techniques and Tools Lexics Versus Syntax Versus Semantics. Formal Semantics of Programming Languages: Operational Semantics, Denotational Semantics Axiomatic Semantics, Proofs of Program Correctness. Ref: Robert Sabesta - Chapter 3 Pratt - Chapter 3 Note: One question may be set from above topics Basic Semantics: Names,Attributes, Constants and Variables, Binding, Functions, Declarations, Blocks, and Scope The Symbol Table, Allocation, Referencing Environment, Pointers & Aliases. Ref: Robert Sabesta - Chapter 4, 5 Note: One question may be set from above topics Data Types: (Primitive Data Types, Character String, Arrays, Slices, Associative Array, Records ) and Type Information, Simple Types, Type Compatibility, Type Equivalence, Type Checking, Type Conversion, Pointers & Dangling Reference, Garbage Collection. Ref: Robert Sabesta - Chapter 4, 5 Pratt chapter 5 Note: One question may be set from above topics Expressions: Evaluation, Assignment Statements, Control Statements Guarded Commands and Conditionals Statement, Assignment Statements, Loops WHILE, FOR, DO WHILE, The GOTO Controversy Ref: Robert Sabesta - Chapter 6, 7 Pratt- chapter 6 Note: One question may be set from above topics Fundamentals of Subprogram, Basic meaning of Call and Return Procedures, Functions, Parameters Passing, ProcedureEnvironments, Activations Records , Accessing non local Environment, Allocation, Exception Handling Ref:Robert Sabesta - Chapter 8, 9 Pratt- chapter 9 Note: One question may be set from above topics Abstract Data Types: The Algebraic Specification of Abstract Data Types, Abstract Data Types in Ada, Abstract Data Types in C++, Encapsulation, Modules, Separate Compilation, Parameterized Abstract Data Type. Introduction to Object Oriented Programming - Fundamentals of Classes, Objects,Inheritence, Polymorphism, Function Overloading. Ref: Robert Sabesta - Chapter 10, 11 Pratt- chapter 7 Note: One question may be set from above topics. Take only fundamentals of OOPs, Functional Programming: Programs as Functions, Functional Programming in a Procedural. Language Scheme: A Dialect of LISP, ML and Miranda: Functional Programming with Static Typing, Delayed Evaluation, Lambda Calculus: A Mathematical View of Functional Programming, Dynamic Memory Management for Functional Languages. Logic Programming Logic and Logic Programs, Horn Clauses, Resolution and Unification The Language Prolog, Problems with Logic Programming, Extending Logic. Parallel Programming: Introduction to Parallel Processing, Parallel Processing and Programming Languages, Pseudoparallelism, Semaphores, Monitors, Coroutines, Message Passing, Parallelism in Nonprocedural Languages. Ref: Robert Sabesta - Chapter 12, 14, 15 Note: One question may be set from above topics. Reference Books: -
ADT’s: Abstract Data type, semi-formal method of specifying an ADT. Pre and Post conditions. Examples of different data structures as ADT. Data Structure & C: Arrays (single as well as multidimension), Structures, Unions. Chapter 1 of Text book by Tanenbaum Note: One question may be set from above topics Stacks: Definition, primitive operations, representing in C: Array implementation, linked list implementation. Application: Infix, postfix and prefix expression, conversion and evaluation. Chapter 2 of Text book by Tanenbaum Note: One question may be set from above topics Queue: Definition, implementation of queue: Linear, Physical and Circular queue. Application of queue, priority queue. Linked list: Simple, circular, doubly linked list. Advantages and disadvantages of linked representation. Linked stack, linked queue. Application: Polynomial arithmetic Chapter 4 of Text book by Tanenbaum, Chapter 4 of text book by Kruse Note: One question may be set from above topics Sorting: Efficiency consideration, bubble sort, selection sort, merge sort, quick sort, radix sort, heap sort. Comparison of methods. Chapter 6 of Text book by Tanenbaum, Chapter 7 of text book by Kruse Note: One question may be set from above topics Searching: Efficiency consideration, sequential, binary interpolation search, Comparison of methods. Chapter 6 of Text book by Tanenbaum, Chapter 7 of text book by Kruse Note: One question may be set from above topics Trees: Binary trees, binary search tree, Building a binary search tree, AVL trees, Splay Trees. External searching: B -Trees, Red Black Trees. Hashing: Hashing, hashing functions, analysis of hashing. Chapter 8, 9 & 10 of Text book by Kruse Note: One question may be set from above topics Graphs: Application of graphs,Represenation of graphs, Graph Travesal: Depth-First and Breadth-First algorithm. Minimum spanning tree, Digikstra’s algorithm, Shortest path algorithm, Huffman encoding. Chapter 11 of text book by Kruse Note: One question may be set from above topics Dynamic Algorithms: Fibonacii numbers, Binomial coefficients, Optimal Binary search trees, Matrix chain multiplications, longest common subsequence, optimal triangularisation. Reference Book: Arts of Programming by KnuthNote: One question may be set from above topics Text books: -
Data communication: Theoretical model of communication; analog and digital signal, Fourier analysis; bandwidth, channel, baud rate of transmission; modulation and demodulation of digital signals; (Encodong of digital data signals, NRZ-L, NRZ-I, Bipolar AMI, Manchester, Differential Manchester B8ZS and HDB3), ASK, FSK and PSK, Pulse Code and Digital modulations). Digital multiplexing-FDM, TDM. Section II: Transmission media: Twisted pair cable, OFC, wireless transmission: radio, microwave, infrared and light wave, Telephone system: Structure, RS -232C, CCITT V.24 and RS-449, SONETT/SDH (Chapter 1.1, 1.2, 2.1, 2.2, 3.1, 4.1 - 4.4, 7.1, 7.2 of William Stallings and chapter 2.4 of Tanenbaum) Note: Three questions may be asked from the above topics Section III: Switching circuit, packet, crossbar and space division and time division switches The following topics are to be covered from chapter 8 and 9 of William stallings Circuit Switching: Switched Networks, circuit switching Networks, Switching concepts, routing in Switched Networks, Control Signalling. Packet Switchings: Packet switching principles, Routing, congestion control, X.25 Note: Two questions may be asked from above topics Section IV: Narrow band ISDN: Services, architecture, interface. Broad band ISDN, Virtual circuits, ATM switches Appendix: A of William Stallings, Section 2.5 and 2.6 of Tanenbaum Note: Two questions may be asked from above topics Section V: Cellular radio: Paging systems, analog cellular and AMPS, digital cellular and personal communication services, communication satellites: Geosynchronous, low orbit, satellite versus Fiber. Chapter 2.7, 2.8 and Chapter 4.6 of Tannebaum Note: One question may be asked from above topics Text Books: -
Parmochand Gupta, Comprehensive Mathematics Part - A, Laxmi publications Harbans Lal, Systematic Mathematics Part-A S. Chand & Sons MIT - 107: Marketing & Business Strategy for IT Professionals Note: Students who have not been studied business functions and accounting principles are required to undertake 20 hrs of basic course in above in addition to 50 hrs of normal teaching in this paper. Marketing concepts and thinking, Analysis of the business environment. Marketing segmentation and targeting product decisions. Pricing decisions. Distribution management. Advertisement and promotion, Industrial marketing, services marketing, Introduction to international marketing. The concept of strategic environment and analysis, analysis of internal strengths and weaknesses, achieving and maintaining competitive advantage, strategy formulation, translating strategies in to policies and plans. Strategy implementation, Measurement, control and feedback, Case studies Books recommended: -
|