Syllabus for Computer Science

1. Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial
Orderings, Elementary counting Techniques, Probability. Measure(s) for information and Mutual
Information.

Computability: Models of computation-Finite Automata, Pushdown Automata, Non-determinism and NFA

DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non-computability
and Examples of non-computable problems.

Graph: Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits.
Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central
Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs.

Groups: Finite fields and Error correcting/detecting codes.

2. Propositional (Boolean) Logic, Predicate Logic, Well-formed-formulae (WFF), Satisfiability and

Tautology.

Logic Families: TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-
flops-types, race condition and comparison. Design of combinational and sequential circuits.

Representation of Integers: Octal, Hex, Decimal, and Binary. 2’s complement

And 1’s complement arithmetic. Floating point representation.

3. Programming in C : Elements of C—Tokens, Identifiers. data types in C. Control structures in C.

Sequence, selection and iteration(s). Structured data types in C. arrays, struct, union, string and pointers.

O-O Programming concepts: Class, object, instantiation. Inheritance, polymorphism and overloading.

C++ Programming: Elements of C++-Tokens, identifiers. Variables and constants. Data types, Operators,
Control statements. Functions parameter passing. Class and objects. Constructors and destructors.
Overloading. Inheritance, Templates, Exception handling.

4. E-R diagrams and their transformation to relational design, normalization—1NF,2NF

3NF,BCNF and 4NF.Limitations of 4NF and BCNF.

SQL : Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL)
commands. Database objects like -Views, indexes, sequences, synonyms, data dictionary.

5. Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists , trees graphs, priority
queues and heaps.

File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing,
inverted lists and multi-lists. B trees and B+ trees.
6. Network fundamentals : Local Area Networks (LAN), Metropolitan Area Networks(MAN). Wide Area
Networks (WAN), Wireless Networks, Inter Networks.

Reference Models :The OSI model, TCP/ IP model.

Data Communication: Channel capacity. Transmission media—twisted pair, coaxial cables, fiber-optic
cables, wireless transmission—radio, microwave, infrared and millimeter waves. Lightwave
transmission. Telephones-local loop, trunks, multiplexing, switching, narrowband ISDN, broadband
ISDN, ATM, High speed LANS. Cellular Radio. Communication satellites—geosynchronous and low-
orbit.

Internetworking: Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunneling,

Fragmentation, Firewalls.

Routing: Virtual circuits and datagram. Routing algorithms. Conjestion control.

Network Security: Cryptography—public key, secret key. Domain Name System (DNS)—Electronic
Mail and Worldwide Web (WWW). The DNS, Resource Records, Name servers-mall-architecture and
Serves.

7. Assembly language fundamentals (8085 based assembly language programming). Assemblers-2-

pass and single-pass. Macros and microprocessors.
Loading, linking, relocation, program relocatability. Linkage editing.
Text editors. Programming Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis.
Lex package on UNIX system.
Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as
rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR.
YACC package on UNIX system.
Topdown parsers—left recursion and its removal. Recursive descent parser. Predictive parser.
Intermediate codes—Quadruples, Triples, Intermediate code generation, Code generation, Code
optimization.

8. Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.

Memory Management: Virtual memory, paging, fragmentation.

Concurrent Processing: Mutual exclusion. Critical regions lock and unlock.

Scheduling: CPU scheduling, I/O scheduling, Resource scheduling, Deadlock

And scheduling algorithms. Banker's algorithm for deadlock handling.

UNIX

The Unix System: File system, process management, bourne shell, shell variables, command line
programming.
Filters and Commands: Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed,
awk, etc.

System Calls (like): Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec,
fork, wait, system.

9. System Development life Cycle (SDLC).Steps, Water fall model, Prototypes, Spiral model.
Software Metrics: Software Project Management.
Software Design: system design, detailed design, function oriented design, object oriented design, user
Interface design. Design level metrics.
Coding and Testing: Testing level metrics. Software quality and reliability. Clean room approach,
software reengineering.

10. The topics of current interest in Computer Science and Computer Applications shall be covered.
The experts shall use their judgment from time to time to include the topics of popular interest, which
are expected to be known for an application development software professional, currently,they include:

Parallel Computing

Parallel virtual machine (pvm) and message passing interface (mpi) libraries and calls. Advanced
architectures. Today's fastest computers.

Mobile Computing

Mobile connectivity—Cells, Framework, wireless delivery technology and switching methods, mobile
Information access devices, mobile data internetworking standards, cellular data communication
protocols, mobile computing applications. Mobile databases—protocols, scope, tools and technology.
M-business.

E-Technologies
Electronic Commerce : Framework, Media Convergence of Applications, Consumer Applications,
Organization Applications.

Electronic Payment Systems: Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment
System, Designing Electronic Payment Systems.

Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy) issues, EDI
and Electronic Commerce, Standardization and EDI, EDI Software Implementation, EDI Envelope for
Message Transport, Internet-Based EDI.

Digital Libraries and Data Warehousing : Concepts, Types of Digital documents, Issues behind
document Infrastructure, Corporate Data Warehouses.

Software Agents: Characteristics and Properties of Agents, Technology behind Software Agents
(Applets, Browsers and Software Agents)

Broadbands Telecommunications: Concepts, Frame Relay, Cell Relay, Switched Multimegabit

Data Service ,Asynchronous Transfer Mode.
Main concepts in Geographical Information System (GIS), E-cash, E-Business, ERP packages.

Data Warehousing: Data Warehouse environment, architecture of a data warehouse methodology,

analysis, design, construction and administration.
‘
Data Mining: Extracting models and patterns from large databases, data mining techniques,
classification, regression, clustering, summarization, dependency modeling, link analysis, sequencing
analysis, mining scientific and business data.

11. Windows programming

Introduction to Windows programming—win32, Microsoft Foundation Classes (MFC), Documents
and views, Resources, Message handling in windows.

12. Simple Applications (in window)

Scrolling, splitting views, docking toolbars, status bars, common dialogs.

13. Advanced Windows Programming

Multiple Document Interface (MDI), Multithreading. Object linking and Embedding (OLE). Active X
controls. Active Template Library (ATL).Network programming.

14. Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro programmed
processor design, Instruction formats, Addressing modes, Memory types and organization, interfacing
peripheral devices, interrupts.
Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV), Microprocessor
applications.
15. Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalization,
SQL and QBE, Query Processing and Optimization, Centralized and Distributed Database, Security,
Concurrency and Recovery in Centralized and Distributed Database Systems, Object Oriented
Database Management Systems (Concepts, Composite objects. Integration with RDBMS
applications), ORACLE.

16. Display systems, Input devices, 2D Geometry, Graphic operations. 3D Graphics, Animation,
Graphic standard, Applications.
Concepts, storage Devices, Input Tools, Authoring Tools, Application, Files.

17. Programming language concepts, paradigms models.

Data. Data types, Operators, Expressions, Assignment. Flow of Control—Control structures, I/O
statements, User-defined and built-in functions, Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference
semantics and their implementation.
Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation,
equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling
the search order, program development in prolog, implementation of prolog, example programs in
prolog.
Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM)
and Message Passing Interface (MPI) routines and calls. Parallel programs In PVM paradigm as well
as MPI paradigm for simple problems like matrix multiplication.
Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational
semantics.
Compiler structure, compiler construction tools, compilation phases.
Finite Automata, Pushdown Automate. Non-determinism and NFA, DPDA, and PDAs and languages
accepted by these structures. Grammars, Languages-types of grammars—type 0, type 1, type 2, and
type 3. The relationship between types of grammars, and finite machines. Pushdown automata and
Context Free Grammars. Lexical Analysis—regular expressions and regular languages. LEX
package on UNIX. Conversion of NFA to DFA. Minimizing the number of states in a DFA.
Compilation and Interpretation. Bootstrap compilers.
Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as
rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR.
YACC package on UNIX system. Top down parsers-left recursion and its removal. Recursive descent
parser. Predictive parser, Intermediate codes-Quadruples, triples. Intermediate code generation,
code generation. Code optimization.

18. Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission
media, Multiplexing and Concentration, Switching techniques, Polling.
Topologies, Networking Devices, OSI Reference Model, Protocols for—(1) Data link layer, (ii)
Network layer and (iii) Transport layer, TCP/IP protocols, Networks security, Network administration.

19. Definition, Simple and Composite structures, Arrays, Lists. Stacks queues, Priority queues,
Binary trees, B-trees, Graphs.
Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary search,
Asymptotic notations—big ohm, omega and theta. Average case analysis of simple programs like
finding of a maximum of n elements. Recursion and its systematic removal. Quick sort—Non-
recursive implementation with minimal stack storage. Design of Algorithms (Divide and Conquer,
Greedy method, Dynamic programming, Back tracking, Branch and Bound). Lower bound theory,
Non-deterministic algorithm—Non-deterministic programming constructs. Simple non-deterministic
programs. NP—hard and NP—complete problems.
20. Object, messages, classes, encapsulation, inheritance, polymorphism, aggregation, abstract
classes, generalization as extension and restriction. Object oriented design. Multiple inheritances,
metadata.
HTML, DHTML, XML, Scripting, Java, Servelets, Applets.

21. Software development models, Requirement analysis and specifications, Software design,
Programming techniques and tools, Software validation and quality assurance techniques, Software
maintenance and advanced concepts, Software management.
22. Introduction, Memory management, Support for concurrent process. Scheduling, System
deadlock, Multiprogramming system, I/O management, distributed operating systems, Study of Unix
and Windows NT.

23. Definitions, AI approach for solving problems.

Automated Reasoning with propositional logic and predicate logic—fundamental proof procedure,
refutation, resolution, refinements to resolution (ordering/pruning/restriction strategies).
State space representation of problems, bounding functions, breadth first, depth first. A, A*, AO*. etc.
Performance comparison of various search techniques.

Frames, scripts, semantic nets, production systems, procedural representations. Prolog

programming.
Components of an expert system, Knowledge representation and Acquisition techniques, Building
expert system and Shell.
RTNs, ATNs, Parsing of Ambiguous CFGs.Tree Adjoining Grammars (TAGs).
Systems approach to planning, Designing, Development, Implementation and Evaluation of MIS.
Decision-making processes, evaluation of DSS, Group decision support system and case studies,
Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and
Decision support systems.

24. Theory of Computation: Formal language, Need for formal computational models, Non-
computational problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton (NFA), Regular languages
and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of a DFA. Non-
regular languages and pumping lemma.
Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA),
Nou-equilvalence of PDA and DPDA.
Context frees Grammars: Greibach Normal Form (GNF) and Chomsky Normal Form
(CNF).Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA’s and CFG's.
Parsing techniques for parsing of general CFG’s—Early’s, Cook-Kassami-Younger (CKY), and
Tomita's parsing.
Linear Bounded Automata (LAB): Power of LBA. Closure properties.
Turing Machine(TM): One tape, multitape. The notions of time and space complexity in terms of TM.
Construction of TM for simple problems. Computational complexity.
Chomsky Hierarchy of Languages: Recursive and recursively-enumerable languages.

25. Models for information Channel: Discrete Memoryless Channel, Binary Symmetric Channel
(BSC), Burst Channel, Bit-error rates. Probability, Entropy and Shannon’s measure of information.
Mutual information. Channel capacity theorem. Rate and optimality of Information transmission.
Variable Length Codes : Prefix Codes, Huffman Codes, Lempel-Ziev (LZ) Codes. Optimality of these
codes. Information content of these codes.
Error Correcting and Detecting Codes: Finite fields, Hamming distance, Bounds of codes, Linear
(Parity Check) codes, Parity check matrix, Generator matrix, Decoding of linear codes, Hamming
codes.
Image Processing: Image Registration, Spatial Fourier Transforms, Discrete Spatial (2-dimensional)
Fourier Transforms, Restoration, Lossy Compression of images (pictures).
Data Compression Techniques: Representation and compression of text, sound, picture, and video
files(based on the JPE and MPEG standards).

26. Linear Programming Problem (LPP) in the standard form, LPP in Canonical form. Conversion of
LPP in Standard form to LPP in Canonical form. Simplex—Prevention of cyclic computations in
Simplex and Tableau, Big-M method, dual simplex and revised simplex.
Complexity of simplex algorithm(s). Exponential behavior of simplex.
Ellipsoid method and Karmakar’s method for solving LPPs. Solving simple LPPs through these
methods. Comparison of complexity of these methods.
Assignment and Transportation Problems: Simple algorithms like Hungarian method, etc.
Shortest Path Problems: Dijkstra’s and Moore’s method. Complexity.

Network Flow Problem: Formulation, Max-Flow Min-Cut theorem. Ford and Fulkersor's algorithm.
Exponential behavior of Ford and Fulkerson's algorithm. Malhotra- Pramodkumar- Maheshwari
(MPM) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings;
Solving matching problems using Network flow problems.
Matroids: Definition. Graphic and Cographic matroids. Matroid intersection problem.
Non-linear Programming: kuhn-Tucker conditions. Convex functions and Convex regions. Convex
programming problems. Algorithms for solving convex programming problems- Rate of convergence
of iterative methods for solving these problems.

27. Neural Networks: Perceptron model, Linear separability and XOR problem. Two and three
layered neural nets. Backpropagation-Convergence, Hopfield nets. Neural net learning, Applications.
Fuzzy Systems : Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy
reasoning, Applications of Fuzzy systems.

28. Unix :Operating System, Structure of Unix Operating System, Unix Commands, Interfacing with
Unix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shell
programming.
Windows: Windows environment, Unicode, Documents and Views, Drawing in a window, Message
handling, scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and
Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.