AMIE Computer Science and Engineering Syllabus 2021
- Introduction to basic structure and operational concepts, instruction formats, instruction execution process, addressing modes, stacks and subroutine handling, instruction sets and organisational features of some representative machines.
- Control unit : Hardware control unit design, microprogramming and micro programmed control unit design, micro sequencer and bit sliced microprocessor ( AMD 2900 ) based micro program control unit design, horizontal and vertical microprogramming, nanoprogramming, emulation.
- Main memory organisation : Memory hierarchy, virtual memory, cache memory, interleaved memory and linear addressing techniques.
- I/O Organisation : Addressing of I/O devices, memory mapped I/O and I/O mapped I/O, data transfer techniques – programmed, interrupt driven, DMA, I/O channels programming, data transfer over synchronous and asynchronous buses, some standard. interface bus like VME / IEEE – 488.
- Introduction to RISC and CISC architecture and their comparison.
- Pipelining : Classification, scalar and vector pipelining, instruction pipelining and execution pipelining, control strategy for pipeline scheduling and performance analysis.
- Associative memory and its implementation with example algorithms to run on associative memory machines.
- Flynn’s classification of multiprocessor machines, SISD, SIMD, MIMD ( both, loosely coupled and tightly coupled ).
- Introduction to some interconnection network ( mesh, cube, cycle, hypercubes, pyramid and omega ).
Systems Analysis and Design
- Systems Development Life Cycle, classic life cycle. Prototyping.
- Feasibility study : Cost estimation, cost – benefit analysis.
- Physical and logical data flow diagrams.
- Requirement analysis : Entity – relationship diagrams. decision tables, CASE tools.
- Systems design : Refinement. Software architecture, program design fundamentals.
- Structured programming modularity – cohesion and coupling.
- Design documentation.
- System implementation : System simulation, planning for coding and testing, verification and validation.
- Project review and walkthrough.
- Input – output design, forms design, dialogue design.
- File design, security and control.
- Management Information System.
Graph Theory and Combinations
- Graphs and digraphs, subgraphs, degree, walk path, cycle, trees, spanning trees, distance, connectivity, reactivity and reachability, adjacency matrix.
- Eularian paths and circuits in graphs and diagraphs.
- Hamiltonian paths and circuits in graphs and tournaments.
- Matching, perfect matching, 4 – colour theorem, vertex colouring, chromatic polynomial edge colouring.
- Planar and non – planar graphs, Euler’s formula, Kuratowgki’s theorem. Network, Max flow – Min cut theorem. Graph enumeration – Polya’s counting theorem. Graph algorithms – shortest path, minimal spanning tree, etc.
- Basic combinatorial numbers, recurrence, generating functions, multinomials. Counting principles. Polya’s theorem, inclusion and exclusion principles. Block design and error correcting codes. Hadamard matrix. Finite geometries.
- Introduction : Goals and applications of networks, WAN, MAN and LAN, computer networks and distributed computers.
- Network architecture : ISO / OSI model, topology, connectivity analysis, queuing theory and delay analysis.
- Physical layer : Theoretical basis of data communication, modems, FDM and TDM, X21, communication satellites, message and packet switching, terminal handling polling, multiplexing and concentration, error detection and correction techniques. Hamming codes and polynomial codes.
- Data link layer and network layer : Framing techniques, network protocols—stop and wait protocol and its performance, sliding window protocol.
- LANs : Ethernet and token ring. CCITT recommendation of X.25.
- Introduction and overview of internet, TCP / IP, internet address. Introduction to web, web design and search engine. Mapping of internet address to physical address, ARP.
- Routing, flow control and congestion analysis.
- Functions and features of OS. Different types of OS viz., single user, batch processing, multiprogramming, time sharing.
- Single user system : Basic I / O system, ROM resident and disk based I / O system.
- Command interpreter with reference to any available operating systems ( like MSDOS ).
- File management and directory structures.
- Memory management, partitioned, paging, segmentation and thrashing.
- Processor management and different scheduling techniques.
- Resource management, disk allocation and scheduling.
- Deadlock detection, recovery, prevention and avoidance.
- Concurrent processor issues – functionality, mutual exclusion, synchronization, interprocess communication.
- Primitives like semaphores and their implementation using machine primitives.
- Concept of conditional critical region and monitors.
- Interrupt handlers, device drivers and controllers, device independent I / O and piping.
- Design issue of multiuser operating systems ( with reference to UNIX ).
- Advanced concepts of program and data security and protection.
- Distributed systems concepts and few basic results.
- Introduction. Cognitive science and perception problems. Problem solving paradigm, introduction to search techniques, problem representations through heuristics, search spaces and / or graphs.
- Basic heuristic search procedures, specialized search techniques, decomposable search strategies.
- Knowledge representation through propositional and predicate logic, fuzzy logic and some applications. Solutions of artificial intelligence problems by PROLOG.
- Rule based deduction and expert systems with an example of MYCIN.
- Knowledge engineering, inference engines and expert system shells.
- Computer vision and natural language processing.
- Concept of neural network.
Online Application 14 December 2020 to 21 January 2021.
Application Form Submission 16 Dec 2020 to 16 Jan 2021.