Syllabus for Jadavpur University PG Course in M.Tech Computer Technology

Syllabus for PG courses in Jadavpur University: M.Tech in Computer Technology

Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of nonlinear algebraic equations by Secant, Bisection and Newton Raphson Methods; Numerical integration by trapezoidal and Simpson's rules. 

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits;Numberrepresentation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes, ALU and datapath, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis. Design: Greedy approach, Dynamic programming, Divide and conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P,NP,NP hard,NP complete. 

Theory of Computation: Regular languages and finite automata, Context free languages and push - down automata, Recursively enumerable sets and Turingmachines,Undecidability. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. 

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control. Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning andmanaging the project, design, coding, testing, implementation, maintenance.

Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic concepts of public key and private key cryptography, digitalsignature, firewalls. 

Graph Theory: Connectivity, Spanning trees; Cut vertices and edges; Covering; Matching; Independent sets; Colouring; Planarity; Isomorphism.

Related Articles:

Jadavpur University Introduces M. Tech. in Computer Technology (MTCT) Course for 2013