#1
6th May 2015, 03:11 PM
| |||
| |||
JNU Delhi M Tech Computer Science
As I want to do M.Tech in Computer Science from the Jawaharlal Nehru University, New Delhi so please give me details about the eligibility required to get admission in this course? Is there any entrance exam conducted by University for admission in M.Tech course?
|
#2
22nd March 2020, 05:47 PM
| |||
| |||
Re: JNU Delhi M Tech Computer Science
Can you provide me the syllabus for Master of Technology in Computer Science and Technology (M.Tech) Program offered by School of Computer and Systems Sciences Jawaharlal Nehru University?
|
#3
22nd March 2020, 05:49 PM
| |||
| |||
Re: JNU Delhi M Tech Computer Science
The syllabus for Master of Technology in Computer Science and Technology (M.Tech) Program offered by School of Computer and Systems Sciences Jawaharlal Nehru University is as follows: SEMESTER I Compulsory Course 1. Design and Analysis of Algorithms CS-773 Asymptotic Analysis, Growth of Functions and Recurrences, Divide and conquer, Dynamic programming, Greedy algorithms, Backtracking, Branch and Bound, Graph Algorithms, Computational Geometry, String Matching, Primality Testing, Probabilistic Recurrence, Basic Power and Efficiency of Randomization and Approximation, Computation Model and Complexity Classes, Reducibility, Las Vegas and Monte Carlo Algorithms, Randomized algorithms, Randomized Minimum cut algorithm, Bin-Balls Problem, Birthday-Paradox, Coupon-Collector, Stable Marriage Problem, and Basic inequalities (Markov, Chebyshev), Chernoff Bounds, Martingale Bound Algorithms for 2-SAT and 3-SAT, Randomized search algorithm, Random Graphs, Markov chains and random walks, Random graph models for real world networks, social networks, etc, Particle Swarm optimization (PSO), Multi-swarm optimization, Ant Colony optimization, Intelligent Water Drops algorithm, Genetic algorithm, Hill-Climbing optimization algorithm. References: 1. Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, ISBN: 0521474655, Published: August 25, 1995 2. Mitzenmacher and Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis Cambridge University Press, 2005 3. T Cormen, C Leisersson, R Rivest, C Stein, Introduction to Algorithms, PHI. 4. V. Aho, J. Hopcraft, J. Ulmann, The Design and Analysis of Computer Algorithms, Addison Wesley. 5. S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, Algorithms, McGraw-Hill Science/Engineering/Math; 1st edition, 2006 6. E Horowitz, S Sahni, S Rajasekaran, Fundamentals of Computer Algorithms, Universities Press Elective Courses 1. Elective I (see appendix-1) 2. Elective II (see appendix-1) 3. Elective III (see appendix-1) 4. Elective IV (see appendix-1) Syllabus M Tech in Computer Science and Technology Jawaharlal Nehru University |
|