Recent Posts

GATE 2020 ORGANIZING BODY IIT DELHI HAS RELEASED THE OFFICIAL MOCK TEST FOR THE UPCOMING GATE 2020 EXAMINATION ON IT’S OFFICIAL WEBSITE.

IT WILL HELP THE STUDENTS TO GET FAMILIARIZED WITH THE REAL GATE EXAMINATION ENVIRONMENT.

GO AND ATTEMPT IT AS SOON AS POSSIBLE . CLICK HERE 

IIIT HYDERABAD WINTER ADMISSION 2019: http://pgadmissions.iiit.ac.in/pgee_WREE.html

Last Date for Submission of Applications online: November 18, 2019

TIFR :- http://univ.tifr.res.in/gs2020/Imp_Dates/Imp_Dates.htm

JEST :- https://www.jest.org.in/joint-entrance-screening-test

These exams are conducted mainly for admissions in Ph.D / Integrated Ph.D Programme.

JEST score is also accepted for IISc M.Tech. Research admissions

Please visit their official website for further details.

Let the i/p alphabet = {0,1} for the following questions :

$\color{red}{Q) \mathbf{About\; String \;Lengths : }}$

$\color{green}{i) \text{ Length of the strings exactly = n  :  }}\color{blue}{\text{  n+2}}$

$\color{green}{ii) \text{ Length of the strings atmost = n  :  }}\color{blue}{\text{  n+2}}$

$\color{green}{iii) \text{ Length of the strings atleast = n  :  }}\color{blue}{\text{  n+1}}$

$\color{green}{iv) \text{ Length of the strings divisible by n  :  }}\color{blue}{\text{  n}}$

$\color{green}{v) \text{ Length of the strings atleast = m & atmost = n  :  }}\color{blue}{\text{  n+2}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

 

$\color{red}{Q) \mathbf{About\; Prefix\; Lengths : }}$

$\color{green}{i) \text{ Length of the prefix  = n  :  }}\color{blue}{\text{  n+2}}$

$\color{green}{ii) \text{ Length of the prefix  = m & total length of the string exactly = n :  }}\color{blue}{\text{ n+2}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iii) \text{ Length of the prefix  = m & total length of the string atmost = n :  }}\color{blue}{\text{ n+2}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iv) \text{ Length of the prefix  = m & total length of the string atleast = n :  }}\color{blue}{\text{  max(m,n)+2}}$

$\color{green}{v) \text{ Length of the prefix  = m & total length of the string divisible by n :  }}\color{blue}{\text{ m+n+1}}$

 

$\color{red}{Q) \mathbf{About\; Suffix\; Lengths : }}$

$\color{green}{i) \text{ Length of the suffix  = n  :  }}\color{blue}{\text{  n+1}}$

$\color{green}{ii) \text{ Length of the suffix  = m & total length of the string exactly = n :  }}\color{blue}{\text{ n+2}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iii) \text{ Length of the suffix  = m & total length of the string atmost = n :  }}\color{blue}{\text{ (n-m+1)*(m+1)+1}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iv) \text{ Length of the suffix  = m & total length of the string atleast = n :  }}\color{blue}{\text{  max(m,n)+1}}$

$\color{green}{v) \text{ Length of the suffix  = m & total length of the string divisible by n :  }}\color{blue}{\text{ m+n}}$

 

$\color{red}{Q) \mathbf{About\; Substring\; Lengths : }}$

$\color{green}{i) \text{ Length of the substring  = n  :  }}\color{blue}{\text{  n+1}}$

$\color{green}{ii) \text{ Length of the substring  = m & total length of the string exactly = n :  }}\color{blue}{\text{ (n-m+1)*(m+1)+1}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iii) \text{ Length of the substring  = m & total length of the string atmost = n :  }}\color{blue}{\text{ (n-m+1)*(m+1)+1}}\color{magenta}{\text{ [ note:- n ≥ m ]}}$

$\color{green}{iv) \text{ Length of the substring  = m & total length of the string atleast = n :  }}\color{blue}{\text{  (n-m+1)*(m+1)}}$

$\color{green}{v) \text{ Length of the substring  = m & total length of the string divisible by n :  }}\color{blue}{\text{ (n)*(m+1)}}$

 

$\color{red}{Q) \mathbf{About\; Fixed\; position : }}$

$\color{green}{i) \;\;n^{th}\text{ position from the left side of the string is fixed to ‘0’  : }}\color{blue}{\text{  n+2}}$

$\color{green}{ii) \;\;n^{th}\text{ position from the right side of the string is fixed to ‘0’  : }}\color{blue}{\text{ }2^{n}}$

$\color{red}{Q) \mathbf{About\; Number \;of\;occurances : }}$

$\color{green}{i) \text{ Number of ZERO’s the strings exactly = n  :  }}\color{blue}{\text{  n+2}}$

$\color{green}{ii) \text{ Number of ZERO’s in the strings atmost = n  :  }}\color{blue}{\text{  n+2}}$

$\color{green}{iii) \text{ Number of ZERO’s in the strings atleast = n  :  }}\color{blue}{\text{  n+1}}$

$\color{green}{iv) \text{ Number of ZERO’s in the strings divisible by n  :  }}\color{blue}{\text{  n}}$

let two positive integers m and n, neither m divides n nor n divides m:

$\color{green}{v) \text{ Number of ZERO’s in the strings divisible by n and m  :  }}\color{blue}{\text{ LCM(n,m) }}$

$\color{green}{vi) \text{ Number of ZERO’s in the strings divisible by n or m  :  }}\color{blue}{\text{ LCM(n,m) }}$

$\color{green}{vii) \text{ Number of ZERO’s in the strings divisible by n but not by m  :  }}\color{blue}{\text{ LCM(n,m) }}$

let two positive integers m and n, either m divides n or n divides m:

$\color{green}{viii) \text{ Number of ZERO’s in the strings divisible by n and m  :  }}\color{blue}{\text{ MAX(n,m) }}$

$\color{green}{ix) \text{ Number of ZERO’s in the strings divisible by n or m  :  }}\color{blue}{\text{ MIN(n,m) }}$

$\color{green}{v) \text{ Number of ZERO’s in the strings divisible by n but not by m  :  }}\color{blue}{\text{ MAX(n,m) }}$

$\color{red}{Q) \mathbf{About\; independent Data items : }}$

While multiplying, you should take care of productive states.

$\color{green}{i) \text{ no.of ZERO’s are exactly ‘n’ and no.of ONE’s exactly ‘m’  : }}$

$\;\;\;\color{blue}{ \text{ Number of ZERO’s the strings exactly = n  :  }}\color{blue}{\text{  n+2}} = \color{magenta}{\text{  (n+1)+(1 DS)}}$

$\;\;\;\color{blue}{ \text{ Number of ONE’s the strings exactly = m  :  }}\color{blue}{\text{  m+2}} = \color{magenta}{\text{  (m+1)+(1 DS)}}$

$\color{DarkOrange}{\text{Answer = (n+1)*(m+1) + 1}}$

$\color{green}{ii) \text{ no.of ZERO’s are exactly ‘n’ and no.of ONE’s atleast ‘m’  : }}$

$\;\;\;\color{blue}{ \text{ Number of ZERO’s the strings exactly = n  :  }}\color{blue}{\text{  n+2}} = \color{magenta}{\text{  (n+1)+(1 DS)}}$

$\;\;\;\color{blue}{ \text{ Number of ONE’s the strings exactly = m  :  }}\color{blue}{\text{  m+2}} = \color{magenta}{\text{  (m+1)}}$

$\color{DarkOrange}{\text{Answer = (n+1)*(m+1) + 1}}$

Supported Documents : https://drive.google.com/open?id=1haPRlS78p7RA7ugMhaK9Li6370ZjaEcx

$\textbf{Initial Version of PDF:}$ https://github.com/GATEOverflow/GO-PDFs/releases/tag/initial-draft

$$\textbf{1. Theory Of Computation}$$

$$\textbf{2. Compiler Design}$$

$$\textbf{3. Programming}$$

$$\textbf{4. Data Structures}$$

$$\textbf{5. Algorithms}$$

$$\textbf{6. Discrete Mathematics}$$

$$\textbf{7. Databases}$$

$$\textbf{8. Operating System}$$

$$\textbf{9. Computer Networks}$$

$$\textbf{10. Digital Logic}$$

$$\textbf{11. Computer Organization}$$

$$\textbf{12. Probability}$$

$$\textbf{13. Linear Algebra}$$

$$\textbf{14. Calculus}$$

Graph theory in an interactive way!

You can easily customize the edges and vertices to learn more.

1.Click to add vertex

2.Drag to connect edges

https://d3gt.com/index.html 

ISRO SC (58 POST): https://www.isro.gov.in/recruitment-to-post-of-scientist-engineer-sc-electronics-mechanical-and-computer-science

Advertisement : https://www.isro.gov.in/sites/default/files/billingual_advertisement.pdf

Last Date for Submission of Applications online:  Nov 04, 2019.

$$\textbf{Contents}$$

Web Page

Syllabus: 

• Limits, Continuity, and Differentiability.
• Maxima and minima, Mean value theorem.
• Integration.

$$\textbf{Contents}$$

Web Page

Syllabus: 

• Matrices, determinants.
• System of linear equations.
• Eigenvalues and eigenvectors.
• LU decomposition.

$$\textbf{Contents}$$

Web Page

Syllabus: Combinatorics: Counting, Recurrence relations, Generating functions.

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&2&1&0&0&1&0&0&0.7&1
\\\hline\textbf{2 Marks Count}&0&1&0&1&2&1&0&0.8&2
\\\hline\textbf{Total Marks}&2&3&0&2&5&2&0&2.3&5\\\hline
\end{array}}}$$

Topics to be Covered:

$$\textbf{Contents}$$

Web Page

Syllabus:

• Sets, Relations, Functions.
• Partial orders, Lattices.
• Monoids, Groups.

$$\textbf{Contents}$$

Web Page

Syllabus: 

• Propositional and first order logic.

$$\textbf{Contents}$$

Web Page

Syllabus: 

• Random variables.
• Uniform, Normal, Exponential, Poisson and Binomial distributions.
• Mean, median, mode and standard deviation.
• Conditional probability and Bayes theorem

$$\textbf{Contents}$$

$$\textbf{1.Verbal Aptitude }$$

Web Page

Syllabus: 

• Basic English grammar: tenses, articles, adjectives, prepositions, conjunctions, verb-noun agreement, and other parts of speech
• Basic vocabulary: words, idioms, and phrases in context
• Reading and comprehension
• Narrative sequencing

$$\textbf{2.Numerical Aptitude}$$

Web Page

Syllabus:

• Data interpretation: data graphs (bar graphs, pie charts, and other graphs representing data), 2- and 3-dimensional plots, maps, and tables
• Numerical computation and estimation: ratios, percentages, powers, exponents and logarithms, permutations and combinations, and series
• Mensuration and geometry
• Elementary statistics and probability

$$\textbf{3.Analytical Aptitude}$$

Web Page

Syllabus:

• Logic: deduction and induction
• Analogy
• Numerical relations and reasoning

$$\textbf{4.Spatial Aptitude}$$

Web Page

Syllabus:

• Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and grouping
• Paper folding, cutting, and patterns in 2 and 3 dimensions

$$\textbf{Contents}$$

$\textbf{Syllabus: Programming}$

Webpage

Programming in C. Recursion.

Topics to be Covered:

$\textbf{Syllabus: DS}$

Webpage

Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.

$$\textbf{Contents}$$

$\textbf{Syllabus:}$

Web Page

• Lexical analysis, Parsing, Syntax-directed translation.
• Runtime environments.
• Intermediate code generation.
• Local optimization, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.

“The optimization part is newly added. But these were already included before GATE 2016 in the form of “Basics of Code Optimization”

$$\textbf{Contents}$$

$\textbf{Syllabus:}$

Web Page

• Machine 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)

        “Pipeline hazards newly added — but it was already there implied by pipelining.”

$$\textbf{Contents}$$

$\textbf{Syllabus:}$

Web Page

• Concept of layering.OSI and TCP/IP Protocol Stacks;
• Basics of packet, circuit and virtual circuit-switching;
• 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.

1. Removed Topics : IPv6, Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
2. Renaming of POP to Email
3. Explicit mentioning of ARP, DHCP, ICMP though questions from these used to be asked before too.
4. Some renaming of other topics

$$\textbf{Contents}$$

$\textbf{Syllabus:}$

Web Page

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