COMPUTER SCIENCE AND ENGINEERING
SYLLABUS
Section 1:
Discrete Structure:
Sets, relations, Functions, Pigeonhole Principle, inclusion - Exclusion Principle,
Equivalence and Partial orderings, elementary counting techniques Probability, Measures
for Information and total information.
Computability: Model of computation-Finite Automata, Pushdown Automata,
Non- determinism and NFS, DPDA and PDAs and languages accepted by these structure,
Grammars languages, non-computability and example of non-computable problems.
Graph: definitions, 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, and centers of a tree, Hamiltonian and Eulerian
graphs, and planar graphs.
Groups: Finite fields and error correcting/detecting codes.
Computer Arithmetic:
Proportional (Boolean Logic), Predicate Logic, Well formed formula (WFF), Satisfactory
and tautology.
Logic Families: TTL, ECL and C-MOS sates, Boolean algebra and minimization of
Boolean functions, Flip-Flop-types, race conditions and comparison. Design of
combinational and sequential circuits.
Representation of Integer: Octal, Hex, Decimal and Binary, 2’s Complement and
1’s complement arithmetic, Floating point representation.
Section 2:
Programming in C and C++:
Programming in C: Element of C-Tokens, Identifiers, Data types in C, Control structure in
C, Sequence selection and iteration, Structured data types in C-arrays, structure, union,
string and pointers.
O-O Programming concepts: Classes, Object, installation, Inheritance, Polymorphism and
overloading.
C++ Programming: Element of C++ Tokens, identifiers, Variable and constants, Data types,
Operators, Control Statements, Functions parameter passing, Class and objects,
Constructors and destructors, overloading inheritance, templates , exception handling.
Relational Database Design and SQL:
E-R Diagram and their transformation to relation design, normalization - INF, 2NF, 3NF,
4NF and BCNF. 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.
Section 3:
Data and File Structure:
Data information, definition of data structure, arrays, stacks, queues, linked lists, trees,
Graphs, priority queues, and heaps.
File Structure: Fields, records, and files. Sequential, direct, index Sequential and relative
files. Hashing, inverted lists and multi lists, B trees and B+ trees.
Computer Network
Network Fundaments: 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. Light wave transmission, telephones-local loop, trunks, multiplexing switching,
narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular radio.
Communication satellite- Geosynchronous and low orbit.
Internetworking: Switch/hub, bridge, router, gateways, concatenated virtual circuits,
tunneling, fragmentation, firewalls.
Routing: Virtual circuits and datagrams, routing algorithms, congestion control.
Network security: Cryptography-public key, secret key, domain name system(DNS)-
Electronic mail and world wide web(WWW).The DNS, resource records, Name servers,
email architecture and servers.
Section 4
System Software:
Assemble language fundamentals (8085 based assembly language programming),
Assemblers-2 pass and single pass, Macros and Macro processors.
Loading, linking, relocation, program relocatability, linkage editing.
Text editors, programming environments, Debuggers and program generators.
Compilation and interpretation, bootstrap compilers, Phase of Compilation process, Lexical
analysis, Lex package on UNIX System
Context free grammars, parsing and parse tree, representation of parse trees as leftmost
and rightmost 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.
Operating System:
Main function of operating system, 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.
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.
Systems calls (like): Create, open, close, read, write, iseek, link, unlink, stat, fs tat, unmask,
chmod, exec, fork, wait, system.
Section 5:
Software engineering:
System development cycle (SDCL): 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.
Section 6:
Algorithms and Analysis:
Analysis of algorithms - Time and space complexity, Asymptotic notations,
Recursion, recurrences and methods of solving recurrences.
Sorting and searching algorithms - Bubble sort, Selection sort, Insertion sort, Shell sort,
Quick sort, Radix sort, Merge sort. Linear and Binary search.
Algorithm design techniques - Divide and Conquer, Brute force, Greedy method,
Dynamic programming, Back tracking, Branch and Bound.
