Recent posts in Useful Links


Best Exams in Computer Science

  1. IIITH: The International Institute of Information Technology - Hyderabad 

  2. CMI: Chennai Mathematical Institute  

  3. TIFR: Tata Institute of Fundamental Research

  4. BITS: Birla Institute of Technology and Science

  5. ISI: Indian Statistical Institute

  6. NIELIT: National Institute of Electronics & Information Technology

  7. ISRO: Indian Space Research Organisation

  8. BARC: Bhabha Atomic Research Centre

  9. DRDO: Defence Research and Development Organisation

  10. JEST: Joint Entrance Screening Test (JEST) 

  11. IIITD: Indraprastha Institute of Information Technology Delhi

  12. NSIT: Netaji Subhas University of Technology

For an explanation please watch this video:

Lakshman Bhaiya posted in Useful Links Feb 10 retagged Feb 11 by Lakshman Bhaiya

$$\textbf{Tata Institute of Fundamental Research}\\ \textit{(Deemed to be University)}$$

$\textbf{Admission Details:}$

$\textbf{Frequency:}\;\text{Once in a year.}$

$$\textbf{School of Technology and Computer Science}$$

Instructions for the written test There are two streams in the School of Technology and Computer Science:

  1. Computer Science.
  2. Systems Science.

The question paper will have three parts. Part A is common to both the streams. It will test the general mathematical aptitude of the candidate. There is no prescribed sylabus for Part A. Part B will be oriented towards the topics listed under ‘Computer Science’ below; and Part C will be oriented towards topics listed under ‘Systems Science’ below. Only one of Parts B, C, should be attempted. The duration of the written test will be three hours. The test will be of multiple choice type, with negative marking for incorrect answers. The use of calculators will not be allowed during the test.

$$\textbf{Syllabus: Computer Science}$$

  1. $\text{Discrete Mathematics:}$ Sets and Relations, Combinatorics (Counting) and Elementary Probability Theory, Graph Theory, Propositional and Predicate Logic.
  2. $\text{Formal Languages, Automata Theory and Computability.}$
  3. $\text{Data Structures and Algorithms:}$ Arrays, Lists and Trees, Sorting and Searching, Graph algorithms, Complexity of problems and NP-completeness.
  4. $\text{Fundamentals of Programming Languages and Compilers:}$ Control structures, Parameter passing mechanisms, Recursion, Parsing and type checking, Memory management.
  5. $\text{Operating Systems and Concurrency}$
  6. $\text{Switching Theory and Digital Circuits}$
  7. $\text{Theory of Databases}$

$\textbf{Previous Year Papers with Solution:}$ 

$$\textbf{Syllabus: Systems Science}$$

  1. $\text{Engineering Mathematics:}$ Complex Analysis, Linear Algebra, Elementary Numerical Analysis, Basic Optimization Theory and Algorithms, Introduction to Probability Theory and Statistics.
  2. $\text{Electrical and Computer Sciences:}$ Introduction to Signals and Linear Systems Analysis, Control Systems, Digital Signal Processing, Basic Circuit Theory, Introduction to Digital Communications, Digital Computer Fundamentals, Introduction to Computer Programming.

Reference: Syllabus & Sample Papers (or)

$$\textbf{GS2022 Selection Process for Mathematics}$$

The selection process for admission in 2022 to the various programs in Mathematics at the TIFR centres – namely, the PhD and Integrated PhD programs at TIFR, Mumbai as well as the programs conducted by CAM-TIFR, Bengaluru and ICTS-TIFR, Bengaluru – will have two stages.

  • $\text{Stage I.}$ A nationwide test will be conducted in various centres on December 12, 2021. Performance in this test will be used to decide whether a student progresses to the second stage of the evaluation process. The cut-off marks for a particular program will be decided by the TIFR centre handling that program. The score in the written test may also be used in Stage II.
  • $\text{Stage II.}$ The second stage of the selection process varies according to the program and the centre. More details about this stage will be provided at a later date.

$\text{Previous Year Papers with Solution:}$

$$\textbf{Syllabus for Stage I}$$ 

  1. $\text{Algebra:}$ Definitions and examples of groups (finite and infinite, commutative and non-commutative), cyclic groups, subgroups, homomorphisms, quotients. Group actions and Sylow theorems. Definitions and examples of rings and fields. Integers, polynomial rings and their basic properties. Basic facts about vector spaces, matrices, determinants, ranks of linear transformations, characteristic and minimal polynomials, symmetric matrices. Inner products, positive definiteness.
  2. $\text{Analysis:}$ Basic facts about real and complex numbers, convergence of sequences and series of real and complex numbers, continuity, differentiability and Riemann integration of real valued functions defined on an interval (finite or infinite), elementary functions (polynomial functions, rational functions, exponential and log, trigonometric functions), sequences and series of functions and their different types of convergence.
  3. $\text{Geometry/Topology:}$ Elementary geometric properties of common shapes and figures in $2$ and $3$ dimensional Euclidean spaces (e.g. triangles, circles, discs, spheres, etc.). Plane analytic geometry (= coordinate geometry) and trigonometry. Definition and basic properties of metric spaces, examples of subset Euclidean spaces (of any dimension), connectedness, compactness. Convergence in metric spaces, continuity of functions between metric spaces.
  4. $\text{General:}$ Pigeon-hole principle (box principle), induction, elementary properties of divisibility, elementary combinatorics (permutations and combinations, binomial coefficients), elementary reasoning with graphs, elementary probability theory.

Reference: Syllabus & Sample Papers (or)

Lakshman Bhaiya posted in Useful Links Jun 28, 2022 edited Jun 28, 2022 by Lakshman Bhaiya

$$\textbf{Indian Statistical Institute}$$

$\textbf{Frequency:}$ Once in a year.

$\textbf{Admission Details:}$

$$\textbf{1. M. TECH(CS)}  \\  \text{1.1. MCQ -Type for ISI Admission Test (MMA)}$$

$\text{Previous Year Papers with Solution:}$

$$ \textbf{Syllabus: MCQ-Type}$$

  • $\text{Analytical Reasoning.}$
  • $\text{Algebra:}$  Arithmetic, Geometric and Harmonic Progression. Continued fractions. Permutations and Combinations. Binomial theorem. Theory of equations. Inequalities involving arithmetic mean and geometric mean, Cauchy-Schwarz inequality. Complex numbers and De Moivre's theorem. Elementary Set Theory. Functions and relations. Elementary Number Theory: divisibility, congruence, primality. Matrices: determinant, rank and inverse, properties of symmetric and idempotent matrices, Eigenvalues and eigenvectors, quadratic forms. System of linear equations. Basic properties of a group. Principle of mathematical induction. Theory of polynomials, remainder theorem, factor theorem.
  • $\text{Coordinate geometry:}$ Straight line, Circle, Parabola, Ellipse and Hyperbola.
  • $\text{Calculus:}$ Sequences and its properties. Series: Power series, Taylor series and Maclaurin series, convergence. Limits and continuity of functions of one variable. Differentiation and integration of functions of one variable with applications. Rolle's theorem and Mean value theorem. Definite integrals. Maxima and minima. Functions of several variables: limits, continuity, differentiability. Double integrals and their applications. Ordinary linear differential equations.
  • $\text{Elementary discrete probability theory:}$ Combinatorial probability, Conditional probability, Bayes theorem and applications.
  • $\text{Trigonometric functions and identities.}$

Reference: ISI MMA Syllabus (or)

$$\text{1.2. Descriptive Type Test for ISI Admission Test (PCB)}$$

$\text{Previous Year Papers with Solution:}$

$$  \textbf{Syllabus: Descriptive-Type }$$

$\textbf{Syllabus for the descriptive type test in computer science at the undergraduate level } \\ \textbf{for students seeking admission to the CS  stream of the M.Tech.(CS) and (CrS) course }$

  • $\text{Analytical Reasoning}$
  • $\text{Data structures -}$  array, stack, queue, linked list, binary tree, heap, AVL tree, B-tree.
  • $\text{Discrete Mathematics -}$ recurrence relations, generating functions, graph theory - paths and cycles, connected components, trees, digraphs.
  • $\text{Design and analysis of algorithms -}$ Asymptotic notation, searching, sorting, selection, graph traversal, minimum spanning tree.
  • $\text{Switching Theory and Logic Design -}$ Boolean algebra, minimization of Boolean functions, combinational and sequential circuits - synthesis and design.
  • $\text{Computer organization and architecture -}$ Number representation, computer arithmetic, memory organization, 1/O organization, microprogramming, pipelining, instruction level parallelism.
  • $\text{Operating systems -}$ Memory management, processor management, critical section problem, deadlocks, device management, file systems.
  • $\text{Formal languages and automata theory -}$  Finite automata and regular expressions, pushdown automata, context-free grammars, Turing machines, elements of undecidability.
  • $\text{Database management systems -}$ Relational model, relational algebra, relational calculus, functional dependency, normalization $\textsf{(2NF, 3NF and BCNF).}$
  • $\text{Computer networks-}$ OSI, LAN technology - Bus/tree, Ring, Star; MAC protocols; WAN technology - circuit switching, packet switching; data communications - data encoding, routing, flow control, error detection/correction, Inter-networking, TCP/IP networking including $\textsf{IPv4}.$

$\textbf{Syllabus for the descriptive type test in computer science at the undergraduate level } \\ \textbf{for students seeking admission to the non-CS stream of the M.Tech.(CS) and (CrS) course }$

  • $\text{Analytical Reasoning}$
  • $\text{Algebra -}$ Arithmetic, geometric and harmonic progressions. Continued fractions. Elementary combinatorics: Permutations and combinations, and Binomial theorem. Theory of equations. Polynomials of a single variable. Inequalities. Complex numbers and De Moivre's theorem. Elementary set theory. Functions and relations. Elementary number theory: Divisibility, congruences, and primality. Algebra of matrices. Determinant, rank and inverse of a matrix. System of linear equations. Eigenvalues and eigenvectors of matrices. Properties of symmetric and idempotent matrices. Quadratic forms. Groups and their properties. Subgroups, normal subgroups, and abelian groups. Boolean algebra.
  • $\text{Coordinate geometry -}$ Straight lines, circles, parabolas, ellipses and hyperbolas.
  • $\text{Calculus -}$ Sequences and series. Limits and continuity of functions of one variable. Differentiation and integration of functions of one variable with applications. Maxima and minima. Power series, Taylor and Maclaurin series. Definite integrals. Functions of several variables: limits, continuity, differentiability. Double integrals and their applications. Ordinary linear differential equations. Vector calculus.
  • $\text{Elementary discrete probability theory -}$ Combinatorial probability, Conditional probability, and Bayes theorem. Discrete random variables. Expectation and variance of discrete random variables.
  • $\text{Graph Theory -}$ Graphs, Adjacency matrix and adjacency list representations of graphs, subgraphs, connectivity, Trees and their properties.

Reference: ISI PCB Syllabus (or)

$$\textbf{2. JRF in Computer Science}$$

Previous Year Papers with Solution:

More Details:

Lakshman Bhaiya posted in Useful Links Jun 27, 2022 reshown Jun 27, 2022 by Lakshman Bhaiya

$$\textbf{Chennai Mathematical Institute (CMI)} \\ \text{MSc/PhD Computer Science/Data Science/Mathematics}$$

$\textbf{Frequency:}\; \text{Once in a year.}$

$\textbf{Admission Details:}$

$$\textbf{Chennai Mathematical Institute}  \\ \text{MSc / PhD Computer Science}$$

$\text{Previous Year Papers with Solution}:$


Topics covered in entrance examination

  • $\text{Discrete Mathematics}$
    • Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders,
  • $\text{Elementary probability theory}$
  • $\text{Automata Theory}$
    • Regular expressions, non deterministic and deterministic finite automata, subset construction, regular languages, non regularity (pumping lemma), context free grammars, basic ideas about computable and noncomputable functions.
  • $\text{Algorithms}$
    • O notation, recurrence relations, time complexity of algorithms, sorting and searching (bubble sort, quick sort, merge sort, heap sort).
  • $\text{Data structures}$
    • Lists, queues, stacks, binary search trees, heaps.
  • $\text{Graphs}$
    • Basic definitions, trees, bipartite graphs, matchings in bipartite graphs, breadth first search, depth first search, minimum spanning trees, shortest paths.
  • $\text{Algorithmic techniques}$
    • Dynamic programming, divide and conquer, greedy.
  • $\text{Logic}$
    • Boolean logic, truth tables, boolean circuits - and, or, not, and, nand gates.

$\textbf{Suggested reading material}$

  1. Frank Harary: Graph Theory, Narosa.
  2. John Hopcroft and Jeffrey D Ullman: Introduction to Automata, Languages and Computation, Narosa.
  3. Jon Kleinberg and Eva Tardos: Algorithm Design, Pearson.
  4. C. Liu: Elements of Discrete Mathematics, Tata McGraw-Hill.

Reference: Computer Science Syllabus   (or)

$$\textbf{Chennai Mathematical Institute} \\ \text{ M.Sc. Data Science}$$

$\text{Previous Year Papers with solution}:$


The entrance examination will primarily check mathematical aptitude and the ability to logically interpret data. Candidates should be familiar with following topics:

  • $\text{School Level Mathematics}$
    • Arithmetic and geometric progressions; arithmetic, geometric and harmonic mean; polynomials, matrices (basic operations, inverse, transpose), determinants, solving linear equations, prime numbers and divisibility, GCD, LCM, modular arithmetic, logarithms, basic properties of functions (domain, range, injective, bijective, surjective), elementary calculus (differentiation, maxima-minima, integration and its applications)
  • $\text{Discrete Mathematics}$
    • Sets and relations, combinations and permutations, elementary counting techniques, pigeonhole principle, binomial theorem, mathematical induction, boolean logic and truth tables
  • $\text{Probability Theory}$
    • Elementary probability theory, conditional probability, and Bayes theorem; random variables, density functions, distribution functions; standard distributions (Gaussian etc.); expectation and variance; data interpretation; summary statistics
  • $\text{Programming}$
    • Ability to read and interpret algorithms written in simple pseudocode (variables, conditionals, loops)

$\textbf{Suggested textbooks}$

There are many books that cover this material. The questions asked will only test basic concepts. Here are a few suggestions.

  1. C.L. Liu: Elements of Discrete Mathematics, McGraw Hill (1986)
  2.  Norman Biggs: Discrete Mathematics, Oxford University Press (2002)
  3.  Sheldon M. Ross: A First Course in Probability (9th ed), Pearson (2013)
  4.  Henk Tijms: Understanding Probability, Cambridge University Press (2012)
  5.  R.G. Dromey: How to Solve it By Computer, Pearson (2006)

Reference: Data Science Syllabus  (or)

$$\textbf{Chennai Mathematical Institute}  \\ \text{MSc / PhD Mathematics}$$

$\text{Previous Year Papers with Solution}:$ 

  • $\textbf{Important note}$
    • The syllabus includes topics for PhD entrants too and so contains material which may often be found only in MSc courses and not BSc courses in the country. Our policy generally has been to have a common question paper for MSc and PhD levels but have separate cut-offs for them.


  • $\text{Algebra.}$
    • Groups, homomorphisms, cosets, Lagrange's Theorem, group actions, Sylow Theorems, symmetric group $\text{S}_{n}$, conjugacy class, rings, ideals, quotient by ideals, maximal and prime ideals, fields, algebraic extensions, finite fields
    • Matrices, determinants, vector spaces, linear transformations, span, linear independence, basis, dimension, rank of a matrix, characteristic polynomial, eigenvalues, eigenvectors, upper triangulation, diagonalization, nilpotent matrices, scalar (dot) products, angle, rotations, orthogonal matrices, $\text{G L}_{n}, \text{S L}_{n}, \text{O}_{n}, \text{S O}_{2}, \text{S O}_{3}$.


  1. Algebra, M. Artin
  2. Topics in Algebra, Herstein
  3. Basic Algebra, Jacobson
  4. Abstract Algebra, Dummit and Foote

$\text{Complex Analysis.}$
Holomorphic functions, Cauchy-Riemann equations, integration, zeroes of analytic functions, Cauchy formulas, maximum modulus theorem, open mapping theorem, Louville's theorem, poles and singularities, residues and contour integration, conformal maps, Rouche's theorem, Morera's theorem


  1. Functions of one complex variable, John Conway
  2. Complex Analysis, L V Ahlfors
  3. Complex Analysis, J Bak and D J Newman
  • $\text{Calculus and Real Analysis.}$
    • Real Line: Limits, continuity, differentiablity, Reimann integration, sequences, series, limsup, liminf, pointwise and uniform convergence, uniform continuity, Taylor expansions,
    • Multivariable: Limits, continuity, partial derivatives, chain rule, directional derivatives, total derivative, Jacobian, gradient, line integrals, surface integrals, vector fields, curl, divergence, Stoke's theorem
    • General: Metric spaces, Heine Borel theorem, Cauchy sequences, completeness, Weierstrass approximation.


  1. Principles of mathematical analysis, Rudin
  2. Real Analysis, Royden
  3. Calculus, Apostol

$\text{Topology.}$ Topological spaces, base of open sets, product topology, accumulation points, boundary, continuity, connectedness, path connectedness, compactness, Hausdorff spaces, normal spaces, Urysohn's lemma, Tietze extension, Tychonoff's theorem,

$\textbf{References:}$ Topology, James Munkres

Reference: Mathematics Syllabus (or)

Lakshman Bhaiya posted in Useful Links Jun 27, 2022 edited Jun 27, 2022 by Lakshman Bhaiya

I'm not saying this is the universal truth to achieve great results, every individual has his/her own thinking and mindset and capabilities.

So Take my input & work according to yourself. For first six months give proper time in concepts buildings of each & every topic in the syllabus....

GATE is mostly Numerical based Exam. So Focus on Numericals & Practice questions as much as you can.…

Give subject wise online test as you finish the subject, Leave mock Tests for the last 2 months....

In given test, right down the tough & different conceptual question in one handbook, study this in last 2 months ... While giving test series, Work on yourmistakes & NEVER compare yourself to others…


Remember -

a. Give tests Sincerely

b. Don't care about its Rank ...

Revision is MUST. Without revision you can't do anything, Our brain has a tendency to forget things in some time. So Revise finished subject in every 15 days to be sharp.…

Otherwise after one month, this subject will be new to you, and your hard work will be wasted....

If possible, make short notes, because it will be helpful in last days of revision time, you could revise concepts in 1-2 days.....

Don't make thesis in short notes, be very precise & specific....

Last Two months give your time mostly in mock tests & practice & revision....

You should solve previous year question of last 10 years Atleast 3 times....

Concepts revision should be done Atleast 10 times till the date of exam....

One thing you should remember Hard work beats talent, If talent doesn't work hard....



Can you tell me how you make your own notes while preparing from the books?

Reasons of not getting 90+ in cs ..

There was no need to get 90+ marks when you are getting rank 1 in 80s and top 200 are in like 70s range and last year in 2022 you were in top 500 if you get 55+ out of 100. So if you are in top 200 you are getting same college as air 1 or an equivalent college so that's why nobody thinks of getting 90+. second thing is gate cs paper is one of the conceptual papers so scoring 90+ requires a lot of accuracy and brainwork since there is time bound. other papers in which there are 90+ score it is because most of the paper is formula based and less conceptual as compared to computer science. if one is able to remember formulaes and has accuracy in calculation then he/she can easily get 60+ and with hard work he/she can push himself/herself to 90+.


I am not saying that other papers are easy. third thing due to which student get 90+ is competition. you have a high level of pressure to get as much marks as possible because someone is there who is preparing harder than you to get more marks. There are lot of CS jobs available and after mtech placement of cs is better than most of the branches so people are less serious for getting 90+ coz they have backup options available whereas other branches mainly compete for psu as core jobs are less in other branches as compared to cs and most of them are less interested in doing mtech due to poor placement as compared to cs branch.

How to get 90+ working hard is the only option to get 90+. for me working hard means that you should be able to attain a level such that whatever question I give you related to gate syllabus you should be able to give me the answer within 3 to 10 minutes. ways to achieve 90+ Ways to achieve it is by practicing good quality of new questions and learning each and every concept thoroughly....

whenever some asks you some concept you should be able to visualize what is happening in the question. if that is not happening then you are weak in that concept. Nowadays competition is increasing in cs , so you can expect someone to get 90+ in the coming 4 to 5 years.…

If you think about backups for GATE, you should only try for those backups and not GATE. This is what I have seen from previous people....











asqwer posted in Useful Links Jul 17, 2021 edited Jul 23, 2021 by asqwer
by asqwer

Here you can see how pointers point and how data is stored in which allocations and data structures, among the several other stuff.

Data Structure Visualizations

Mohitdas posted in Useful Links Jul 3, 2021 edited Jul 3, 2021 by Mohitdas

Hi All,

Please find this awesome resource on the operating system subject.


You will learn how xv6 kernel is implemented along with all the fundamental OS concepts. 
What is xv6?


dd posted in Useful Links Jun 20, 2021
by dd

IIsc has released dates for written test.

I know nearly all the current/previous toppers are on GO, can you guys please share what to read for the test? I’ve read past year interviews but most of them had choice of subject to get asked on, a liberty we might not have in the written test.

zxy123 posted in Useful Links Mar 25, 2021
by zxy123


To all, whoever finds following contents useful.

MIT’s 6.824 is a very good course on distributed system. Currently this course is available online:


CMU’s Database course is also a good implementation oriented course:

For both the courses, videos, lectures material, papers, assignments and projects are available online.

You might want to make use of these good quality resources. 

dd posted in Useful Links May 2, 2020
by dd

$$\textbf{IIST Admission GATE 2019}$$

$\textbf{Interview Experience}$

$\text{IIST ML Interview Experience}$

Experience shared by: Suraj Kumar 1

Lakshman Bhaiya posted in Useful Links Apr 24, 2020

$$\textbf{IIIT Hyderabad Admission GATE 2019}$$

$\textbf{Interview Experience}$

$\text{IIIT Hyderabad interview Experience - 2017}$

Experience shared by: Neelay Upadhyaya

$\text{IIIT Hyderabad Interview Experience}$

Experience shared by: rushitjasani

$\text{IIIT Hyderabad Interview Experience}$

Experience shared by: priyendu mori 1

Lakshman Bhaiya posted in Useful Links Apr 24, 2020 edited Apr 24, 2020 by Lakshman Bhaiya

The below links for Text Solution are already completed but Video Links are just starting to be made. 

For those interested in sharing their video solution:

  • The csedoubts site has other questions too which you can restrict by going to page, scroll down and selecting "Show Previous GATE questions only". With this selection, once you go to say Theory of Computation Subject page, all questions will be from previous GATE.
  • In the editor, there is an embed youtube option. Youtube URLs can be directly put there. You can put videos from your youtube channel or any similar site as long as the video is not for advertisement point of view.
$\textbf{Year}$ $\textbf{From CSE Doubts}$ $\textbf{From GO}$
2020 Video Solution Text Solution
2019 Video Solution Text Solution
2018 Video Solution Text Solution
2017-1 Video Solution Text Solution
2017-2 Video Solution Text Solution
2016-1 Video Solution Text Solution
2016-2 Video Solution Text Solution
2015-1 Video Solution Text Solution
2015-2 Video Solution Text Solution
2015-3 Video Solution Text Solution
2014-1 Video Solution Text Solution
2014-2 Video Solution Text Solution
2014-3 Video Solution Text Solution
2013 Video Solution Text Solution
2012 Video Solution Text Solution
2011 Video Solution Text Solution
2010 Video Solution Text Solution
2009 Video Solution Text Solution
2008 Video Solution Text Solution
2008-it Video Solution Text Solution
2007 Video Solution Text Solution
2007-it Video Solution Text Solution
2006 Video Solution Text Solution
2006-it Video Solution Text Solution
2005 Video Solution Text Solution
2005-it Video Solution Text Solution
2004 Video Solution Text Solution
2004-it Video Solution Text Solution
2003 Video Solution Text Solution
2002 Video Solution Text Solution
2001 Video Solution Text Solution
2000 Video Solution Text Solution
1999 Video Solution Text Solution
1998 Video Solution Text Solution
1997 Video Solution Text Solution
1996 Video Solution Text Solution
1995 Video Solution Text Solution
1994 Video Solution Text Solution
1993 Video Solution Text Solution
1992 Video Solution Text Solution
1991 Video Solution Text Solution
1990 Video Solution Text Solution
1989 Video Solution Text Solution
1988 Video Solution Text Solution
1987 Video Solution Text Solution
Lakshman Bhaiya posted in Useful Links Apr 18, 2020 edited Apr 18, 2020 by Lakshman Bhaiya

IIT Kanpur has launched a Python Programming Course, taught by Prof. Amey Karkare.

There are two versions of this course:

1. Free version: Pre-recorded video lectures and practice problems, without certification.

2. Paid version: Costs 999 INR. Pre-recorded video lectures and practice problems with certification and support over whatsapp for  doubts.

Do check it out.

Sambhrant Maurya posted in Useful Links Mar 29, 2020

COAP2020  info. brochure :










iitk(direct admission):







starting on 25th march




IIT Bhubaneswar (Mtech in Computer Science and Engineering , Mtech in Climate Science & Technology)



IIT Ropar (MTech in Computer Science and Engineering , Mtech in Artificial Intelligence )



IIT Bhilai (Mtech in Computer Science & Engineering)



IIT Tirupati (Mtech in Computer Science & Engineering)



IIT Palakkad (M.Tech in Data Science , M.Tech in Computing and Mathematics ,M.Tech in System-on-Chip-Design)



IIT Indore (M.S. (Research) in Computer Science and Engineering )



IIT Patna (Mtech in Computer Science & Engineering , Mtech in Mathematics and Computing ,) 



IIT (ISM) Dhanbad  ( Mtech in Computer Science and Engineering , Mtech in Computer Science and Engineering [Specialisation in Information Security] ,Mtech in Data Analytics ,Mtech in Geomatics)






IIT Gandhinagar  (MTech in Computer Science and Engineering.)



IIT Jammu (M.Tech In Data Science ,M.Tech In Information Security )


comment when rest are started...if anybody finds out immediately.


blackcloud posted in Useful Links Mar 15, 2020 edited Mar 25, 2020 by blackcloud

$\textbf{Admission Experience}$

Experience shared by: Ritik Sunita Jain

#nsit #counseling #process
Hi friends,

I got selected for mtech cse in NSIT delhi. In this post i am telling some important information about counseling process.

First you have to fill the application form after that the institute publish a list of eligible candidates (candidates with valid GATE score). After that you have to report to the institute for counseling (all the candidates). You should have these compulsory things:-

1. Demand draft of fees
2. 10th marksheet
3. 8th sem marksheet or Provisional degree
4. Any govt ID

There are total of 20 seats in CSE dept and 10 for general candidates.
My gate score is 566, rank is 2893 gen category. And in the list published by nsit i am on 40 number instead of this i got selected on 5th number.
Many of the candidates who applied didn't appear.
(Because dtu also have the same date for physical reporting). So overall the cutoff of nsit went low for this year.

I hopes this information help you guys.

Lakshman Bhaiya posted in Useful Links Mar 4, 2020

$\textbf{Interview Experiences}$

Collection of interview experience at IIIT Delhi.

Lakshman Bhaiya posted in Useful Links Mar 4, 2020


Experience shared by Saswat Swarup:

$\textbf{IOCL interview preparation and experience}$

Experience shared by Kishan Kumar:

Previous Year NIELIT Papers: Link

Lakshman Bhaiya posted in Useful Links Feb 26, 2020