IIT Kanpur has put up the names of the people who got direct admission and those of whom are invited for test/interview.
IIT KANPUR M.Tech
IIT Delhi has started updating the shortlisting criteria in their site but the final result of short listed candidates are not out.
IIT DELHI M.TECH Criteria
IIT Bombay Results will be out on May 5th 2009
Thursday, April 30, 2009
Saturday, April 18, 2009
NIT Ranking for M.Tech and B.Tech
Based on the current placements the following ranking holds
1. NIT Calicut
2. NIT Thrichy
3. NIT Surathkal
4. NIT Warangal
All these 4 NITs are equally good.
NIT Calicut has one of the best placement results with high packages from Goldman Sachs, Adobe, D E Shaw, Microsoft, Yahoo, Google, Bank of America, IBM and Amazon
1. NIT Calicut
2. NIT Thrichy
3. NIT Surathkal
4. NIT Warangal
All these 4 NITs are equally good.
NIT Calicut has one of the best placement results with high packages from Goldman Sachs, Adobe, D E Shaw, Microsoft, Yahoo, Google, Bank of America, IBM and Amazon
Ranking of IITs for M.Tech
For M.Tech IISc is the best in India with its flagship course 'ME'. The IIT's follows:
1. IIT Bombay
2. IIT Kanpur
3. IIT Delhi
4. IIT Kharagpur
5. IIT Madras
6. IIT Rourke
1. IIT Bombay
2. IIT Kanpur
3. IIT Delhi
4. IIT Kharagpur
5. IIT Madras
6. IIT Rourke
ISRO COMPUTER SCIENCE SYLLABUS FOR SCIENTISTS/ENGINEERS EXAM
I got this one from net. Can't guarantee anything :)
(1) Computer H/W Digital Logic: Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits -- Number representation and Computer Arithmetic (fixed and floating point)
(2) Computer Organization: Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage.
(3) SOFTWARE SYSTEMS Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph --
(4) Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming --
(5) Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths -- Hashing, Sorting, Searching -- Design techniques (Greedy, Dynamic Programming, Divide-and-conquer) --
(6) Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic) --
(7) Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
(8) Databases: Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control --
(9) Computer Networks: ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), TCP/UDP, IP, Basic concepts of switches, gateways, and routers.
(1) Computer H/W Digital Logic: Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits -- Number representation and Computer Arithmetic (fixed and floating point)
(2) Computer Organization: Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage.
(3) SOFTWARE SYSTEMS Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph --
(4) Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming --
(5) Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths -- Hashing, Sorting, Searching -- Design techniques (Greedy, Dynamic Programming, Divide-and-conquer) --
(6) Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic) --
(7) Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
(8) Databases: Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control --
(9) Computer Networks: ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), TCP/UDP, IP, Basic concepts of switches, gateways, and routers.
Subscribe to:
Posts (Atom)