You are on page 1of 20

SYLLABUS OF SECTION B

AMIE(I)

STUDY CIRCLE(REGD.)

A Focused Approach

Computer Science & Engineering
Compulsory Subjects IC 402 Engineering Management CP 403 Data Structures CP 404 Programming Languages CP 405 Pulse and Digital Circuits CP 406 Computer Architecture CP 407 Systems Analysis and Design

Optional Subjects (Any three from any one Group)
Group I Computer Applications CP 411 Graph Theory and Combinatorics CP 412 Computer Networks CP 413 Operating Systems CP 414 Artificial Intelligence CP 415 Database Management Systems Group II Hardware Engineering CP 421 Parallel Processing CP 422 Computer Networks CP 423 Operating Systems CP 424 Computer Graphics CP 425 Micro-processors and Micro-controllers Group III Information Technology CP 431 Pattern Recognition and Image Processing CP 432 Theory of Computation CP 433 Operating Systems CP 434 Computer Graphics CP 435 Software Engineering

î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³

ï

WEB: www.amiestudycircle.com

SYLLABUS OF SECTION B COMP SC & ENGG

AMIE(I)

STUDY CIRCLE(REGD.)

A Focused Approach
Group A

ENGINEERING MANAGEMENT
Management and Organisations Management process: Definition, planning organizing, directing, controlling, coordinating, types of management. Organisation Definition, planning, design and development, types of organizations. Management planning and control: Classical, new classical and modern principles. General Management, scientific management, engineering, management, systems management. Planning: Procedures, resources and constraints, objectives, goals, policies and procedures. Control: Setting of reference or standards, appraisal or evaluation, monitoring and controlling, types of control. Human resource planning and management, selection, recruitment, training, retraining, skill development, competence development, promotion and career development, participative management, trade unions, and collective bargaining, Management of Physical Resources Plant: site selection procedures, factors affecting selection. Layout-types and relative merits and demerits, Maintenance-Objectives, different types of associated decisions, strategies for effective maintenance, computer applications. Material : Functions, objectives, planning and control including inventory models with or without storage costs, price break ( excluding dynamic and probabilistic considerations). Different classes of inventory. Material Requirement Planning (MRP). Group B Financial management: Introduction to standard forms of financial statements, ie., balancesheet, profit and loss, and income statement. Fixed and current asset items. Fixed and current liability items. Linkage of two successive balance-sheets through income or profit and loss statement. Funds flow statement. Financial ratios and their implications. Managerial economics: Concepts, theory of production, marginal productivity and cost. Introduction to theory of firm. Quality management: Quality definition, quality planning, quality control and quality management, Total quality management, ISO 9000 systems, simple quality control techniques like control charts and acceptance sampling. Marketing management consumer behavior, market research, product design and development pricing and promotion. Project management: Introduction. Concept of a project, project management concepts, project simulation, cost or project and means of financing, economic evaluation criteria of the
ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³

î

project implementation. project control (PERT. A Focused Approach ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ í . project planning. ecommerce and integration tools like enterprise resource planning (ERP).SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Information technology and management. CPM techniques including crashing). scheduling and monitoring.) project. Role of information. Project evaluation. Information technology-introduction to e-business. management information system and decision support system.

heapsort. stacks. height-balanced and weight-balanced trees. depth first search. Hashing. B-trees. Order notation. Tail recursion. insertion sort. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ì . Group B Nonlinear data structures: Trees. B+ trees. application of trees. quick sort. inverted files. radix sort. insertion and deletion algorithms. Linear data structures: Sequential representations: Arrays and lists. circular linked list. bubble sort. File structures: Sequential and direct access. Graph representation. merge sort. when not to use recursion. Breadth first search. multi-indexed files. strings and their applications. traversals and threads.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. queues and dequeues. binary search trees. hashing functions. Linked representations: Linear linked list. doubly linked list and their applications. relative files. Sorting and searching algorithms. collision resolving techniques. removal of recursion. Recursion: Design of recursive algorithms.) A Focused Approach Group A DATA STRUCTURE Time and space analysis of algorithms. selection sort. indexed files-B+tree as index. binary trees. hashed files.

library functions. Group B C++: Overview of C+ +. Java arrays. application of LISP in. passing parameters to Applets. nesting of classes. multidimensional arrays.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. file structure and file handling. LISP.) A Focused Approach Group A PROGRAMMING LANGUAGE Principles of high-level language programming. recursion. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ë . base class. parameter passing mechanism. C-functions. C language: Fundamentals of C. arrays of objects. recursion. abstractions. file I/O and streams. artificial intelligence problems. events and applets. concepts of inheritance. class and objects. operators and expressions. two-dimensional array. event-driven programming. block structured languages. structures. Examples. iteration. unions. control flow. control and data Structures. Java files. templates. Overviews of LISP functions. design principles. derived class. conditions. pointers and arrays. types. binding. common line arguments. streams. operator overloading. file concepts. arithmetic. multilevel inheritance. Java: Features of Java. Bitwise operators: file handling in C.

programmable logic arrays (PLA). Boolean constants. two-valued Boolean algebra switching algebra. the degree of adjacency and essential prime cubes. capabilities and limitations of finite-state machines. path sensitization method. hazards and hazard-free designs. functionally complete sets.and six-variable maps. state assignments in asynchronous sequential circuits. minimization and transformation of sequential machines. reliability through redundancy. disjunctive and conjunctive normal forms. J-K flip-flop. the finite-state model-basic definitions. multiple output minimization. the normal form. fundamental theorems. pulse mode circuits. the dominance relation cyclic functions. logical operations. the finite-state modelfurther definitions. binary. state equivalence and machine minimization. bounds of Boolean algebra. The compatible graph and the merger table. the canonical form. multiplexers. closed set of compatibles. minimum product of sums. synthesis of synchronous sequential circuits. essential prime cube theorems. Boolean difference method. EXCLUSIVE-OR networks. Asynchronous sequential circuits. the (inclusion) implication relation. PLA folding. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ê . the memory elements and their excitation functions-S-R flip-flop. Fundamental mode circuits. don't care forms. Boolean functions and logic operations: Introduction.) A Focused Approach Group A PULSE AND DIGITAL CIRCUITS Combinational Logic Boolean algebra: Introduction. laws of Boolean algebra. NAND and NOR operations. fault classes and models. Capabilities. Minimization of switching functions: The Karnaugh map-introduction cubes and the Karnaugh map. uniqueness properties. synthesis. duality in Boolean algebra. NAND and NOR networks. variables and functions. EXCLUSIVE-OR operation. self-dual functions. electronic gates and mechanical contacts. quaded logic. Logic synthesis of switching functions: Introduction. Group B Sequential Circuits Introduction to synchronous sequential circuits. Reliable design and fault detection tests: Introduction. read only memories. octal and hexadecimal. test generation. maximum sum of products. five. the non-uniqueness of minimal machines. OR and inverter networks.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. postulates of Boolean algebra. fault diagnosis and testing. Quine-McCluskey algorithm. T flip-flop. fault table method. PLA minimization. Tabular methods of minimization: Introduction. simplification of incompletely specified machines compatible states.D flip-flop. AND. designations. prime cubes. De Morgan's theorem. fundamental products and sums.

) Finite state recognizers: Deterministic recognizers. converting nondeterministic into deterministic graphs. transition graphs. regular sets corresponding to transition graphs. regular expressions.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. transition graphs recognizing regular sets. A Focused Approach ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ é .

Associative memory and its implementation with example algorithms to run on associative memory machines. MIMD (both. stacks and subroutine handling. cache memory. Pipelining: Classification. interleaved memory and linear addressing techniques. some standard. SISD. instruction sets and organisational features of some representative machines. I/O channels programming. Main memory organisation: Memory hierarchy. Introduction to some interconnection network (mesh. microprogramming and micro programmed control unit design. instruction pipelining and execution pipelining. DMA.) A Focused Approach Group A COMPUTER ARCHITECTURE Introduction to basic structure and operational concepts. addressing modes. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ è .SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. I/O organisation: Addressing of I/O devices. instruction execution process. Group B Introduction to RISC and CISC architecture and their comparison. pyramid and omega). virtual memory. cycle. scalar and vector pipelining. hypercubes. micro sequencer and bit sliced microprocessor (AMD 2900) based micro program control unit design. horizontal and vertical microprogramming. emulation. control strategy for pipeline scheduling and performance analysis. interrupt driven. Control unit: Hardware control unit design. interface bus like VME/IEEE-488. cube. SIMD. instruction formats. nanoprogramming. memory mapped I/O and I/O mapped I/O. loosely coupled and tightly coupled). data transfer techniques-programmed. data transfer over synchronous and asynchronous buses. Flynn's classification of multiprocessor machines.

SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. System implementation: System simulation.) A Focused Approach Group A SYSTEMS ANALYSIS AND DESIGN Systems Development Life Cycle. Feasibility study: Cost estimation. Requirement analysis: Entity-relationship diagrams. Input-output design. dialogue design. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ç . planning for coding and testing. Management Information System. Project review and walkthrough. Systems design: Refinement. classic life cycle. Physical and logical data flow diagrams. Design documentation. cost-benefit analysis. security and control. File design. Software architecture. CASE tools. decision tables. program design fundamentals. verification and validation. Prototyping. forms design. Group B Structured programming modularity-cohesion and coupling.

ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïð . Hadamard matrix. perfect matching. Matching. spanning trees. vertex colouring. chromatic polynomial edge colouring. etc.) A Focused Approach GRAPH THEORY AND COMBINATIONS Group A Graphs and digraphs. Eularian paths and circuits in graphs and diagraphs. distance. Network. subgraphs. generating functions. Kuratowgki's theorem. multinomials. 4-colour theorem. Polya's theorem. Euler's formula. Counting principles. Block design and error correcting codes. Basic combinatorial numbers. degree. Finite geometries. cycle. trees. walk path. connectivity. Hamiltonian paths and circuits in graphs and tournaments. recurrence.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. inclusion and exclusion principles. Group B Planar and non-planar graphs. Graph algorithms-shortest path. Max flowMin cut theorem. Graph enumeration-Polya's counting theorem. adjacency matrix. minimal spanning tree. reactivity and reachability.

25. sliding window protocol.) COMPUTER NETWORKS Group A A Focused Approach Introduction: Goals and applications of networks. computer networks and distributed computers. Mapping of internet address to physical address. multiplexing and concentration. terminal handling polling. Group B Data link layer and network layer: Framing techniques. Physical layer: Theoretical basis of data communication. Introduction and overview of internet. TCP/IP. flow control and congestion analysis. FDM and TDM. web design and search engine. topology. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïï . Hamming codes and polynomial codes. X21. internet address. LANs: Ethernet and token ring. error detection and correction techniques.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Network architecture: ISO/OSI model. Introduction to web. modems. WAN. message and packet switching. connectivity analysis. ARP. Routing. MAN and LAN. network protocols stop and wait protocol and its performance. queuing theory and delay analysis. CCITT recommendation of X. communication satellites.

paging. prevention and avoidance. partitioned. Concept of conditional critical region and monitors.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Different types of OS viz. File management and directory structures. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïî . Design issue of multiuser operating systems (with reference to UNIX). device drivers and controllers. Processor management and different scheduling techniques. interprocess communication. Advanced concepts of program and data security and protection. Command interpreter with reference to any available operating systems (like MSDOS). Single user system: Basic I/O system.) OPERATING SYSTEMS Group A A Focused Approach Functions and features of OS. Primitives like semaphores and their implementation using machine primitives. disk allocation and scheduling. Distributed systems concepts and few basic results. ROM resident and disk based I/O system. segmentation and thrashing. recovery. Memory management. mutual exclusion. time sharing.. synchronization. Resource management. single user. Group B Concurrent processor issues functionality. multiprogramming. Interrupt handlers. device independent I/O and piping.Deadlock detection. batch processing.

problem representations through heuristics. Problem solving paradigm. Knowledge engineering. Computer vision and natural language processing. Knowledge representation through propositional and predicate logic.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. inference engines and expert system shells. Cognitive science and perception problems. specialized search techniques. decomposable search strategies. Group B Rule based deduction and expert systems with an example of MYCIN. search spaces and/or graphs.) ARTIFICIAL INTELLIGENCE Group A A Focused Approach Introduction. introduction to search techniques. Basic heuristic search procedures. Solutions of artificial intelligence problems by PROLOG. Concept of neural network. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïí . fuzzy logic and some applications.

creating. etc. security and integrity. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïì . Storage organization. office automation system. Features of a commercially available RDBMS as case study (ORACLE). relational calculus. entity relationship. editing. architecture.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. data models-network. formatted report. relational algebra. hierarchical and relational. sorting. Group B Database Management System (DBMS): Typical DBMS based on relational model. relational operations. Data administration. physical data organization. DDL. searching. decomposition of relational schemes. Relational model. query languages. Database concepts. functional dependencies. query optimisation.) DATABASE MANAGEMENT SYSTEMS Group A A Focused Approach Introduction. Processing system life cycle.

Arithmetic and instruction pipelines. Super scalar architectures. architectural classification and techniques. Operating systems for parallel processors. Cyber 205. namely. shared memory multiprocessor systems. Fourier transform. Cray X-MP. Cray 1. Tree.) PARALLEL PROCESSING Group A A Focused Approach Introducing to parallel processing.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. asynchronous pipelines. etc. pipelining hazards and scheduling theory. Interconnection networks Group B Parallel algorithm for linear algebra. sorting. IBM 370. Mesh and Butterfly networks. Hyper cubes. Cray 2. Data flow architectures-merits and demerits. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïë . systolic arrays. Vector processors. Some case studies. shuffle exchange.

rotation.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Hidden line and hidden surfaces removal algorithms. seed fill algorithm.) COMPUTER GRAPHICS Group A Various graphic display devices and interactive devices. Area filling Scan line algorithm. scaling. half toning. A Focused Approach Three-dimensional graphics and transformations. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïê . Line and curve drawing algorithms. translation. Two-dimensional transformation Group B Windowing and clipping techniques. reflections and viewing projections. Animation techniques.

Software development systems: Assemblers and cross assemblers. direct memory access. Interfacing I/O devices. 8085 assembly language programming: 8085 instructions-addressing modes. memory read and write operations. Bi-directional data ports. accessing lookup tables. Peripheral devices. internal RAM and bit addressable memory. Memory map. internal ROM and RAM. Microprocessor based system design aids and troubleshooting techniques. Accessing external program memory. Microprocessor applications. Arithmetic routines. addressing modes. 2s complement and arithmetic operations. Stack and subroutines. Concept of debugger and MASM/T ASM for PC assembly language programming. Software delay and counting routines. Oscillator and clock. counters/timers. 8259 programmable interrupt controller.) A Focused Approach MICROPROCESSOR AND MICRO CONTROLLERS Group A Microprocessor architecture and microcomputer systems. Alternate ports functions. Microcontroller based system design and applications. input and output devices. 8085 interrupts. available I/O ports during external memory access. Analog and digital I/O interface routines-ADC and DAC. accessing external data memory. 8051 microcontroller architecture. serial communication with SID and SOD. 8255 programmable peripheral interface. Power down modes. keyboard and display interface routines. Memory interfacing address decoding techniques. Serial interface. memory systems. External memory systems and I/O interface.Memory-mapped I/O and I/O mapped I/O. registers. 8253 programmable counter timer. Software development systems. special functions. Group B Introduction to microcontroller: Comparison of various microcontrollers. Memory organisations-program memory and data memory. 8085 microprocessor architecture. Introduction to 16-bit microprocessor using 8086 as an example. hexadecimal and BCD numbers. 8051instruction sets. Addition. counting and timing under interrupt control. Logical operations.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Number systems-binary. memory map. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïé . Assemblers and simulators. 8085 programmer's model-CPU registers. bit level operations. keyboard and display devices. 8051 interrupts. 8051 registers. subtraction and multiplication routines. Polled and interrupt modes of data transfer. 8051 assembly language programming. 8251 programmable communication interface.

Description of line and shape. Minimum distance pattern classification with simple and multiple prototypes. Robbins-Monre algorithm. Group B Image representation. quantization. bayes classifier. Karhuner-Lucke expansion and divergence maximization.) PATTERN RECOGNITION AND IMAGE PROCESSING Group A A Focused Approach Hyperplane properties and decision functions. potential functions and least mean square errors. compression and coding. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïè . segmentation. Trainable pattern classifier Gradient technique. restoration enhancement. learning and estimation of mean vector and covariance matrix. Morphological methods of image analysis. Feature selection by entropy minimization. Transform for image processing. thinning. digitization. statistical and syntactic models of image classification. pattern classification by likelihood functions. Clustering: K means and isodata algorithm.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD.

Space complexity. deterministic and non-deterministic and finite automata.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. pumping lemma for context-free languages. Group B Turing machines and its variants. recursiveness of context-sensitive grammar. automata for syntaxdirected translations. Chomsky hierarchy of grammars. equivalent finite automation of both. Minimization of states for deterministic finite automata. Complexity theory. NP-completeness concepts and some standard NP-complete problems. time complexity. syntax-directed translations.) THEORY OF COMPUTATION Group A A Focused Approach Regular sets and regular expression. Chomsky normal form. Equivalence of recursive functions and computable functions. recursive functions and sets. universal luring machines. equivalent context-free grammars. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ ïç . simulation of RAM by TM and its complexity. Pushdown automata.

successive versions model.' concurrency mechanism. user defined data types. information hiding. abstraction. Program verification and validation. Empirical and heuristic estimation techniques. pseudo code. team structure. event tables. milestone. data encapsulation. Group B.SYLLABUS OF SECTION B COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. integration testing. cost models. Reliability and software quality assurance. FS mechanism. transition tables. structure charts. regular expressions. coupling and cohesion. stepwise refinement. documentation. Software design: Architectural and detailed design. ÐòÞò ÒÑòééô î ÒÜ ÚÔÑÑÎô ÍËÔÌßÒ ÌÑÉÛÎÍô ÎÑÑÎÕÛÛ Š îìéêêé ËÌÌßÎßÕØßÒÜ ÐØæ øðïííî÷ îêêíîè Û³¿·´ æ °½±«®-»-ั¬³¿·´ò½±³ îð . Unit testing. decision tables. Software maintenance: Source code metrics. recursion. object oriented concepts. Specifications. formal verification. petri nets. generic facilities. Modern programming language features: Typeless. project structure. data How diagrams. acceptance testing. Test plan and implementation issues-structured coding. modularity. Halstead's effort equation. etc. top-down and bottom-up programming. concurrency.) SOFTWARE ENGINEERING Group A A Focused Approach Software project planning and management: Basic concepts of life cycles models. cyclomatic metric. strong type and pseudo strong type checking. algebraic axioms. Requirement analysis. Software cost estimation.