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

2 ND FLOOR, SULTAN TOWERS, ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email :






A Focused Approach
Group A


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
P.B. NO.77, 2 ND FLOOR, SULTAN TOWERS, ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email :


77.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Role of information. NO. management information system and decision support system. project control (PERT. P. scheduling and monitoring. SULTAN TOWERS. project implementation. Information technology and management.) A Focused Approach project. Information technology-introduction to e-business. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : 3 . Project evaluation. project planning. CPM techniques including crashing). 2 ND FLOOR. ecommerce and integration tools like enterprise resource planning (ERP).B.

quick sort.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Order notation. Tail recursion. Breadth first search. selection sort. SULTAN TOWERS. B+ trees. binary trees. circular linked list. 2 ND FLOOR.77. binary search 4 . radix sort. doubly linked list and their applications. application of trees. Linear data structures: Sequential representations: Arrays and lists. stacks. P. Group B Nonlinear data structures: Trees. inverted files. B-trees. multi-indexed files. bubble sort. hashed files. collision resolving techniques. hashing functions. Sorting and searching algorithms. strings and their applications. depth first search. Hashing. insertion and deletion algorithms. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail.B. height-balanced and weight-balanced trees.) A Focused Approach Group A DATA STRUCTURE Time and space analysis of algorithms. traversals and threads. queues and dequeues. NO. merge sort. relative files. heapsort. Linked representations: Linear linked list. indexed files-B+tree as index. Recursion: Design of recursive algorithms. File structures: Sequential and direct access. when not to use recursion. removal of recursion. insertion sort. Graph representation.

control flow. block structured languages. multidimensional arrays. streams. concepts of inheritance. passing parameters to Applets. base class. common line arguments. Java files. nesting of classes. 2 ND FLOOR. library functions. types. unions. event-driven programming.) A Focused Approach Group A PROGRAMMING LANGUAGE Principles of high-level language programming. 5 . operators and expressions.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. NO. file concepts. structures. C language: Fundamentals of C. file I/O and streams. events and applets. iteration. LISP. artificial intelligence problems. Java arrays. control and data Structures. P.77. file structure and file handling. conditions. arrays of objects. SULTAN TOWERS. operator overloading.B. pointers and arrays. recursion. abstractions. recursion. design principles. Bitwise operators: file handling in C. class and objects. multilevel inheritance. Group B C++: Overview of C+ +. binding. two-dimensional array. application of LISP in. Java: Features of Java. parameter passing mechanism. Examples. C-functions. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. arithmetic. Overviews of LISP functions. derived class.

multiple output minimization. De Morgan's theorem. P. state assignments in asynchronous sequential circuits. prime cubes. fault table method. laws of Boolean algebra. maximum sum of products. synthesis. the finite-state model-basic definitions. NO. duality in Boolean algebra. five. the (inclusion) implication relation. Group B Sequential Circuits Introduction to synchronous sequential circuits. Quine-McCluskey algorithm. the degree of adjacency and essential prime cubes.77. designations. the dominance relation cyclic functions. Boolean constants. AND. fundamental products and sums. Reliable design and fault detection tests: Introduction. PLA folding. binary. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. programmable logic arrays (PLA). self-dual functions. bounds of Boolean algebra.and six-variable maps. pulse mode circuits. don't care forms. the normal form. electronic gates and mechanical contacts. fault diagnosis and testing. test generation. NAND and NOR operations. the non-uniqueness of minimal machines. read only memories. minimization and transformation of sequential machines. capabilities and limitations of finite-state machines. uniqueness properties. Logic synthesis of switching functions: Introduction. Boolean difference 6 . logical operations.B. fundamental theorems. J-K flip-flop. postulates of Boolean algebra. Fundamental mode circuits. functionally complete sets. state equivalence and machine minimization. path sensitization method. multiplexers. SULTAN TOWERS.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. minimum product of sums. the finite-state modelfurther definitions. Minimization of switching functions: The Karnaugh map-introduction cubes and the Karnaugh map. NAND and NOR networks. Asynchronous sequential circuits.D flip-flop. The compatible graph and the merger table. Capabilities. hazards and hazard-free designs. disjunctive and conjunctive normal forms. 2 ND FLOOR. PLA minimization. EXCLUSIVE-OR operation. octal and hexadecimal. essential prime cube theorems. OR and inverter networks.) A Focused Approach Group A PULSE AND DIGITAL CIRCUITS Combinational Logic Boolean algebra: Introduction. T flip-flop. reliability through redundancy. Boolean functions and logic operations: Introduction. closed set of compatibles. fault classes and models. synthesis of synchronous sequential circuits. simplification of incompletely specified machines compatible states. the memory elements and their excitation functions-S-R flip-flop. variables and functions. quaded logic. EXCLUSIVE-OR networks. Tabular methods of minimization: Introduction. the canonical form. two-valued Boolean algebra switching algebra.

NO. transition graphs.77.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. regular sets corresponding to transition graphs. 2 ND FLOOR. regular expressions. SULTAN TOWERS. converting nondeterministic into deterministic 7 . P. transition graphs recognizing regular sets. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail.) A Focused Approach Finite state recognizers: Deterministic recognizers.B.

some standard. Group B Introduction to RISC and CISC architecture and their comparison. pyramid and omega). SULTAN TOWERS. Introduction to some interconnection network (mesh. addressing modes. loosely coupled and tightly coupled). Pipelining: Classification. virtual memory. instruction sets and organisational features of some representative machines. instruction execution process. scalar and vector pipelining. I/O organisation: Addressing of I/O devices.) A Focused Approach Group A COMPUTER ARCHITECTURE Introduction to basic structure and operational concepts. interleaved memory and linear addressing techniques. NO. data transfer techniques-programmed. cube.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. micro sequencer and bit sliced microprocessor (AMD 2900) based micro program control unit design. interrupt driven. P. Control unit: Hardware control unit design. emulation. interface bus like VME/ 8 . cache memory. MIMD (both. Associative memory and its implementation with example algorithms to run on associative memory machines. nanoprogramming.77. stacks and subroutine handling. instruction pipelining and execution pipelining. memory mapped I/O and I/O mapped I/O. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. 2 ND FLOOR. cycle. SISD. data transfer over synchronous and asynchronous buses.B. horizontal and vertical microprogramming. control strategy for pipeline scheduling and performance analysis. DMA. microprogramming and micro programmed control unit design. SIMD. Flynn's classification of multiprocessor machines. hypercubes. Main memory organisation: Memory hierarchy. instruction formats. I/O channels programming.

com 9 .B. classic life cycle. security and control. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail.77. dialogue design. System implementation: System simulation. verification and validation. Project review and walkthrough. Prototyping. Software architecture. Physical and logical data flow diagrams. program design fundamentals. forms design. SULTAN TOWERS. Feasibility study: Cost estimation. Input-output design. Design documentation. Group B Structured programming modularity-cohesion and coupling. P.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. CASE tools. Requirement analysis: Entity-relationship diagrams. decision tables. 2 ND FLOOR. Systems design: Refinement. planning for coding and testing.) A Focused Approach Group A SYSTEMS ANALYSIS AND DESIGN Systems Development Life Cycle. File design. NO. Management Information System. cost-benefit analysis.

trees. Block design and error correcting codes.) A Focused Approach GRAPH THEORY AND COMBINATIONS Group A Graphs and digraphs. adjacency matrix. distance. 4-colour theorem.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. recurrence. Matching. Group B Planar and non-planar graphs. Graph enumeration-Polya's counting theorem. Finite geometries.77.B. etc. degree. SULTAN 10 . Max flowMin cut theorem. 2 ND FLOOR. connectivity. Basic combinatorial numbers. Hadamard matrix. Hamiltonian paths and circuits in graphs and tournaments. Polya's theorem. chromatic polynomial edge colouring. Kuratowgki's theorem. Eularian paths and circuits in graphs and diagraphs. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. cycle. inclusion and exclusion principles. vertex colouring. reactivity and reachability. NO. Network. Graph algorithms-shortest path. walk path. P. Counting principles. Euler's formula. perfect matching. subgraphs. generating functions. minimal spanning tree. spanning trees. multinomials.

message and packet switching. Introduction and overview of internet. NO. queuing theory and delay analysis. LANs: Ethernet and token ring.25. modems. terminal handling polling. MAN and LAN. Network architecture: ISO/OSI model. internet address. 2 ND FLOOR. Hamming codes and polynomial codes. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. FDM and TDM. flow control and congestion analysis. web design and search engine. Group B Data link layer and network layer: Framing 11 . WAN. SULTAN TOWERS. connectivity analysis. network protocols—stop and wait protocol and its performance. Mapping of internet address to physical address. Introduction to web.B. ARP. multiplexing and concentration. sliding window protocol. communication satellites. error detection and correction techniques. TCP/IP. CCITT recommendation of X. P.) A Focused Approach COMPUTER NETWORKS Group A Introduction: Goals and applications of networks.77. Physical layer: Theoretical basis of data communication.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. topology. computer networks and distributed computers. Routing. X21.

B. prevention and avoidance. synchronization. single user. partitioned. Distributed systems concepts and few basic results. recovery. Processor management and different scheduling 12 . device drivers and controllers. ROM resident and disk based I/O system. P. batch processing. Design issue of multiuser operating systems (with reference to UNIX). Resource management.. Interrupt handlers. NO. device independent I/O and piping.77. segmentation and thrashing. Advanced concepts of program and data security and protection. SULTAN TOWERS. Single user system: Basic I/O system.) A Focused Approach OPERATING SYSTEMS Group A Functions and features of OS. 2 ND FLOOR. time sharing. paging. multiprogramming. Memory management. interprocess communication. Different types of OS viz.Deadlock detection. Command interpreter with reference to any available operating systems (like MSDOS). ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. mutual exclusion. disk allocation and scheduling. Concept of conditional critical region and monitors. Primitives like semaphores and their implementation using machine primitives.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. File management and directory structures. Group B Concurrent processor issues—functionality.

search spaces and/or graphs. Solutions of artificial intelligence problems by PROLOG. Problem solving paradigm. Concept of neural network. Knowledge representation through propositional and predicate logic. Knowledge engineering. fuzzy logic and some applications. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : 13 . specialized search techniques. decomposable search strategies. introduction to search techniques.B.) A Focused Approach ARTIFICIAL INTELLIGENCE Group A Introduction. Basic heuristic search procedures. NO.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. Cognitive science and perception problems. problem representations through heuristics. P.77. 2 ND FLOOR. Computer vision and natural language processing. Group B Rule based deduction and expert systems with an example of MYCIN. SULTAN TOWERS. inference engines and expert system shells.

security and integrity. Features of a commercially available RDBMS as case study (ORACLE). relational algebra. functional dependencies. 2 ND FLOOR. etc.) A Focused Approach DATABASE MANAGEMENT SYSTEMS Group A Introduction. Data administration. DDL. Database concepts. Group B Database Management System (DBMS): Typical DBMS based on relational model. Relational model. creating. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. hierarchical and relational. office automation system. NO. formatted report. query optimisation.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. editing. Processing system life cycle. architecture. entity relationship. physical data organization. data models-network. relational operations.77. Storage 14 .B. searching. relational calculus. decomposition of relational schemes. P. query languages. SULTAN TOWERS. sorting.

Operating systems for parallel processors. Vector processors. namely. Cyber 205. Arithmetic and instruction pipelines. Interconnection networks—Hyper cubes.B. Cray X-MP. IBM 370. Fourier transform.) A Focused Approach PARALLEL PROCESSING Group A Introducing to parallel 15 . Super scalar architectures. Data flow architectures-merits and demerits.77. Cray 2. pipelining hazards and scheduling theory. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. 2 ND FLOOR. systolic arrays. sorting. Cray 1. shuffle exchange.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. shared memory multiprocessor systems. etc. asynchronous pipelines. Some case studies. NO. architectural classification and techniques. Mesh and Butterfly networks. P. SULTAN TOWERS. Tree. Group B Parallel algorithm for linear algebra.

2 ND FLOOR.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD.B. Group B Windowing and clipping techniques. P. Three-dimensional graphics and transformations. Animation techniques. scaling.) A Focused Approach COMPUTER GRAPHICS Group A Various graphic display devices and interactive devices. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. SULTAN TOWERS. Line and curve drawing algorithms.77. rotation. seed fill 16 . Hidden line and hidden surfaces removal algorithms. Area filling—Scan line algorithm. reflections and viewing projections. Two-dimensional transformation—translation. NO. half toning.

B. External memory systems and I/O interface. accessing lookup tables. 8051 microcontroller architecture. 8085 microprocessor architecture. internal RAM and bit addressable memory. counters/timers. Assemblers and simulators. 8051 registers. Memory organisations-program memory and data memory. 8259 programmable interrupt controller. Serial interface. 8251 programmable communication interface. 8051instruction sets. Peripheral devices. special functions. Stack and subroutines. accessing external data memory.) A Focused Approach MICROPROCESSOR AND MICRO CONTROLLERS Group A Microprocessor architecture and microcomputer systems. Accessing external program memory. 8051 17 . Microcontroller based system design and applications. SULTAN TOWERS. 8085 programmer's model-CPU registers. counting and timing under interrupt control. 2s complement and arithmetic operations. Microprocessor based system design aids and troubleshooting techniques. subtraction and multiplication routines. Logical operations. 8255 programmable peripheral interface. Polled and interrupt modes of data transfer. NO. available I/O ports during external memory access. Software development systems: Assemblers and cross assemblers. Group B Introduction to microcontroller: Comparison of various microcontrollers. 2 ND FLOOR. Memory map. Interfacing I/O devices. direct memory access. addressing modes. keyboard and display interface routines. registers. memory map. Oscillator and clock. Number systems-binary. Concept of debugger and MASM/T ASM for PC assembly language programming.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. keyboard and display devices. Arithmetic routines. memory read and write operations. bit level operations. Software development systems. 8051 assembly language programming.Memory-mapped I/O and I/O mapped I/O. 8085 interrupts. P. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. Software delay and counting routines. Microprocessor applications. Bi-directional data ports. serial communication with SID and SOD. memory systems. Addition. 8085 assembly language programming: 8085 instructions-addressing modes.77. hexadecimal and BCD numbers. input and output devices. internal ROM and RAM. Memory interfacing address decoding techniques. Analog and digital I/O interface routines-ADC and DAC. Alternate ports functions. 8253 programmable counter timer. Introduction to 16-bit microprocessor using 8086 as an example. Power down modes.

77.) A Focused Approach PATTERN RECOGNITION AND IMAGE PROCESSING Group A Hyperplane properties and decision functions. learning and estimation of mean vector and covariance matrix. Morphological methods of image analysis. 18 . statistical and syntactic models of image classification. pattern classification by likelihood functions. digitization. NO. Group B Image representation. compression and coding. quantization.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. segmentation. Clustering: K means and isodata algorithm. restoration enhancement. P. Trainable pattern classifier—Gradient technique. Robbins-Monre algorithm. Transform for image processing. Description of line and shape. 2 ND FLOOR. Feature selection by entropy minimization. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. SULTAN TOWERS.B. potential functions and least mean square errors. Karhuner-Lucke expansion and divergence maximization. Minimum distance pattern classification with simple and multiple prototypes. bayes classifier.

pumping lemma for context-free languages.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. equivalent context-free grammars. 2 ND FLOOR. Minimization of states for deterministic finite automata.B. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. NO. Pushdown automata. NP-completeness concepts and some standard NP-complete problems. Equivalence of recursive functions and computable functions. equivalent finite automation of both. Chomsky hierarchy of grammars. Chomsky normal form. 19 . Space complexity.77. Complexity theory. recursiveness of context-sensitive grammar. simulation of RAM by TM and its complexity. recursive functions and sets. Group B Turing machines and its variants. time complexity. universal luring machines. deterministic and non-deterministic and finite automata.) A Focused Approach THEORY OF COMPUTATION Group A Regular sets and regular expression. SULTAN TOWERS. automata for syntaxdirected translations. syntax-directed translations.

top-down and bottom-up programming. 2 ND FLOOR. cost models.) A Focused Approach SOFTWARE ENGINEERING Group A Software project planning and management: Basic concepts of life cycles models. acceptance testing.B. decision tables. Specifications. strong type and pseudo strong type checking. FS mechanism. coupling and cohesion. Program verification and validation. transition tables. regular expressions. integration testing.' concurrency mechanism. milestone. user defined data types. Test plan and implementation issues-structured coding. structure charts. NO.SYLLABUS OF SECTION B – COMP SC & ENGG AMIE(I) STUDY CIRCLE(REGD. team structure. generic facilities. algebraic axioms. Software cost estimation. data How diagrams. stepwise refinement. P. recursion. Reliability and software quality assurance. concurrency. pseudo code. ROORKEE – 247667 UTTARAKHAND PH: (01332) 266328 Email : pcourses@hotmail. Empirical and heuristic estimation techniques. Unit testing. project structure. etc. petri nets. SULTAN TOWERS. object oriented concepts. Software maintenance: Source code metrics. Halstead's effort equation. abstraction. successive versions model. Software design: Architectural and detailed design. documentation. formal verification. Group B. Requirement 20 . event tables. information hiding. modularity.77. data encapsulation. Modern programming language features: Typeless. cyclomatic metric.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.