GATE -Computer Science

For more than three decades, pratishtha has been the top choice when it comes to a GATE coaching centre. Of all the GATE coaching centres in bangalore,pratishtha has consistently held the title of the best GATE coaching centre. With multiple course options,pratishtha provides test preparation tailored to every student's needs. From scholarships for GATE coaching fees to expert faculty, pratishthaaims to help students at every step of their GATE journey.

There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR and XNOR. The AND gate is named so because, if 0 is false and 1 is true, the gate acts in the same way as the logical "and" operator. The following illustration and table show the circuit symbol and logic combinations for an AND gate.

Classroom Features

Pratishtha EDU classes is a place for learning, innovation, and success. Academy is known for leadership in quality education and is committed to the highest standards of teaching.



Study Material

Comprehensive material with quality, brief summarization of each topic with MCQ



Interactive Classes

Receive immediate feedback and comments, which significantly helps to improve.



Best Result

With expert and unmatched study material, we produce good result.



Best faculty

We have best and quality faculty panel from IIT NIT and Prestigious college.

Excellent Track Record

With consistency of quality education and faculty. We have best results.

Programme Details

Experience transformative learning with our dedicated team of educators at Pathfinder Academy. We combine passionate expertise with personalized guidance to empower students of all backgrounds. Our highly-qualified teachers, boasting years of experience, tailor their approach to meet individual needs, fostering scientific exploration and competitive confidence.


Testing Methodology

Commencement of Registration

Commencement of Programme

Early access

Duration of programme

Schedule of classes

Medium

Provision of tests

Scholarships

Personal Mentorship

Interview Guidance

Offline classroom

01st April 2024

08th July, 2024 -Noida, NCR

01st April 2024 onwards

Six months( 6 to7days/week)

9:30 AM to 2:00 PM

A hybrid of English and Hindi

Bimonthly (objective patterns)

Get Upto 90%* Scholarship

Included | By faculty members

Included | By field expertes

Gate-CS

Offline/online Coaching

Course Fee

₹35000

Including GST + Book + Test Series


Payment and Registration

Pay now for Free access to recorded lectures till June 2024 exam


Success Redefined



Raised image
Chandrashekar

Biology Educator

IISC Bengaluru
Raised image
Kumar Shiv

Maths Educator

IIT Dhanbad
Raised image
Abhilash

Maths Educator

NIT College
Raised image
Rishab Gupta

JEE mains & Advance

NIT Warangal
Raised image
Vinay

Physics educator

NIT Trichy

Engineering Mathematics Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, 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 and Statistics: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem. Computer Science and Information Technology

Digital Logic Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

Computer Organization and ArchitecturMachine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).

Programming and Data Structures Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.


Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths


Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata.Regular and contex-free languages, pumping lemma. Turing machines and undecidability.


Compiler Design Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.


Operating System System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.


Databases 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.

Computer Networks Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet,circuit and virtual circuitswitching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

Highlights of Gate-Mechanical Exam Pattern

Below is the expected exam pattern for Gate-Mechanical

  • GATE Exam Weightage
    • General Aptitude: 15% marks weightage
    • Engineering Mathematics: 13% marks weightage
    • Core Paper: Remaining 72% marks weightage
  • Multiple Choice Question (MCQ)
    • Each question carries 1 or 2 marks.
    • Objective type with four choices and one correct answer.
    • Negative marking:
      • For 1-mark MCQ: 1/3 will be deducted for a wrong answer.
      • For 2-mark MCQ: 2/3 will be deducted for a wrong answer.
  • Numerical Answer Type Question
    • No negative marks for wrong answers.


Particulars Details
Exam mode Online Computer based Test
Exam duration 3 hours
Total paper in GATE 2022 29
Sections of GATE 2022 exam General aptitude and subject paper
Questions Type MCQ & NAT (Numerical answer type)
Number of Questions 65
Total marks 100
Marks Distribution in all papers except (AR, CY, ET, MA, PH, GG, XL) GA – 15 marks
ENG maths - 13 marks
Core paper - 72 marks
Marks distribution in AR, CY, ET, MA, PH, GG, XL GA – 15 marks
Core paper marks - 85
Negative marks -1/3 for 1 mark
-2/3 for 2 marks
0 for Numerical answer type question

Books To Be Referred

Gate-CS Recommended Books

Books Authors
Computer science GK Publication
Hand book Made easy publication
Reference book Made easy book

Key Topics

Name of subjects Marks in each topic
General Topic 15
Engineering Mathematics 7
Discrete mathematics 8
Digital logic 5
Computer Organization and Architecture 8
Programming and data structure 9
Algorithm 9
Theory of computation 9
Compiler 6
Operating system 6
Data base 7
Computer Network 11
Yes, you surely can but you have to upload your degree certificate while filling the application form

Candidate with backlogs can apply for GATE 2024 using the marks sheet for the final semesters (any one) of your B.Tech/ graduation. However, you will have to clear your backlog by the time admissions in M.Tech commence.

Demo Videos

Explore our engaging YouTube tutorials for expert insights and practical learning tips. Subscribe for regular updates and enrich your knowledge!