GATE Selection Program for CS & IT Engineering

A Rigorous Study Plan of Videos & Questions to help you crack GATE CS & IT Engineering Exam


WHAT YOU WILL GET

 

200+Hours of Video lectures covering entire Syllabus

 

30+  Practice Tests

 

5  All-India Mock Tests

 

Unlimited Doubts Resolution on WhatsApp & Live Classes 

 

Personalized Study Planning

 

No Limit on Number of Views

 

Interview Assistance

 

Online Access

CUSTOMIZABLE FEATURES

   

Validity

   

Personal Mentor

   

Pendrive Access



Rs 8000


Key Features

HD Videos

The best quality videos recorded by most illustrous faculty members and industry expertsto provide an insight and clarity of concepts like never before.

Boolean Algebra and Logic Gates

Design of DFA

Types of Sorting Algorithms

Personalised Study Planning Tool

Decide how you want to learn as per your needs

Regular Tests

Test your preparation at every step with actual GATE like exams

Doubt Resolution

Real time doubt resolution mechanism on WhatsApp, led by a mentor

Anytime Anywhere Access

Get rid of the time and location constraints and learn anywhere, any time of the day or night

Professors

Meet the faculty responsible for India's best GATE guidance

Darshana

B.Tech, M.Tech (IITK),
10 years of working experience in L&T

Dr. Ritu

B.Tech. (IITK),
M. Tech. and Ph.D (IISc Bangalore)

Dr. Tanvi

B.Sc., LSR, Delhi University
M.Sc., IITB

Dr. Sonakshi Mathur

B.Tech, M.Tech (IITK),
10 years of working experience in L&T

Syllabus

  • Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring.
  • Combinatorics:counting, recurrence relations, generating functions.
  • Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
  • Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
  • Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Mathematical modeling and representation of systems, Feedback principle, transfer function, Block diagrams and Signal flow graphs, Transient and Steady‐state analysis of linear time invariant systems, Routh-Hurwitz and Nyquist criteria, Bode plots, Root loci, Stability analysis, Lag, Lead and Lead‐Lag compensators; P, PI and PID controllers; State space model, State transition matrix.
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

FAQs

  • Offline courses rely on the locally available teachers, which are not always best quality.
  • They also carry with themselves a constraint of time and location.
  • If you are a working professional you can't join one.
  • Similarly, if you are in a small town you can't join any good institute.
  • GATESchool brings you the best of academics and training to your doorstep.
  • It's very simple.
  • Choose the package you want to get.
  • Make the payment and you are done!
  • Within next 30 minutes you will get the login and password for the online access and within a week you will get the pendrive.
  • There are a number of ways to do that.
  • Firstly, you will be getting a mentor who will be a subject matter expert and will be calling you regularly.
  • He/she will be able to address your doubts.
  • Apart from that, you will be added to a WhatsApp group, which will be led by a mentor, who will be solving the doubts on a daily basis.
  • Live classes is an opportunity to interact with a teacher live.
  • They will be conducted online on a predecided topic.
  • You can suggest the topic you find difficult for the live class topic and also ask questions in real time.
  • Mock tests will be online and will be conducted as per the GATE pattern.
  • They will be timed and will have the marking scheme same as the real GATE exam.