Jadavpur university M Tech CS

Hi guys I have completed B.tech in computer science and want to do M.tech from Jadavpur university in same subject , so can you here tell me admission related info ??

[sumit]

As you completed B.tech in computer science and want to do M.tech from Jadavpur university in same subject , so on your demand I am telling require info:

Key dates for admission :
Availability of PG Application form 19 Apr 2016
Last date of online Registration 04 May 2016
Last date of online submission of application receipt 06 May 2016 (till 5 pm)
Verification of Documents 23 May 2016
Date of Entrance Test 23 May to 31 May 2016
1st Provisional Selection list and Waiting list to be published 27 May to 06 Jun 2016

Document require for admission :
Admit Card and Score Card of GATE/GPAT (if applicable).
Mark-sheets and Certificates from Secondary exam ination to Undergraduate degree examination in Engineering or to Postgraduate degree examination in Science courses and Admit Card of Admission Test.
SC/ST Certificate issued by the Govt. of W est Bengal, PWD (Person with Disability) Certificate and Fam ily Incom e Certificate issued by the competent authority.

Jadavpur university M Tech CS entrance exam syllabus

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; Number representation 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 Turing machines, 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 and managing 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, digital signature, firewalls.
Graph Theory: Connectivity, Spanning trees; Cut vertices and edges; Covering; Matching; Independent
sets; Colouring; Planarity; Isomorphism