Computer Science Engineering
Computer Science Engineering
Computer Science Engineering
Engineering Mathematics
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions,
partial orders and lattices. Groups. Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value
theorem. Integration.
Digital Logic
Machine instructions and addressing modes. ALU, data-path and control unit. Instruction
pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface
(interrupt and DMA mode).
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search
trees, binary heaps, graphs.
Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.
Graph search, minimum spanning trees, shortest paths.
Page 1 of 2
Theory of Computation
Compiler Design
Operating System
Databases
Computer Networks
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,
switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state).
TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP,
POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public
key and private key cryptography, digital signatures and certificates, firewalls.
*********
Page 2 of 2