$\text{C programming data structures and algorithms}$
-
Question on function scope on automatic and register addressing mode
-
what would be the output of a function was given inside which there was again a recursive call to that function with pre decrement operator and after that printing the value of x
-
Two questions directly from master method case 2 and case 3
-
1 question on associativity and precedence order
-
which sorting algorithm is stable the answer was counting sort and merge sort
-
Postfix to infix conversion
-
Maximum N swaps required which algorithm the answer was selection sort
-
INPUT WAS GIVEN AN ARRAY AND AFTER SOMETIME THE ARRAY POSITION WAS GIVEN AND ASKED WHICH SORTING ALGORITHM HAS BEEN USED SO THE ANSWER WAS QUICK SORT
-
ONE QUESTION ON STACK PUSH AND POP INSTRUCTIONS WERE GIVEN AND WE WERE ASKED THE WAY THE ELEMENTS ARE GETTING OUT OF THE STACK
-
RECURSIVELY CALLING THE FUNCTION AND ASKED WHAT WILL THIS FUNCTION IF CALCULATING SO THE ANSWER WAS HEIGHT OF THE TREE
-
FUN QUESTION ON TRUE AND FALSE ON RED-BLACK TREES AND AVL TREES
-
ONE QUESTION ON SOURCE AND SINK ALGORITHM FOR FORD FULKERSON
-
A[i][j][k][l] in pointer form
$\text{Computer Graphics}$
-
COHEN SUTHERLAND LINE CLIPPING: WHICH OF THE LINES NEED NOT BE CLIPPED
$\text{TOC and compiler}$
-
QUESTION ON REGULAR EXPRESSIONS
-
QUESTION GIVEN THE GRAMMAR WHAT WILL BE THE REGULAR EXPRESSION
-
QUESTION ON FINITE AUTOMATA
-
GRAMMAR WAS GIVEN, ASKED IT IS REGULAR OR NOT?
-
QUESTION ON MINIMUM DFA
-
IS THE GRAMMAR AMBIGUOUS OR NOT
-
WHICH OF THE GRAMMAR IS LL 1
-
LL1 GRAMMAR IS PARSE BY WHICH PARSERS? TOP DOWN, RECURSIVE DESCENT OR PREDICTIVE?
$\text{Operating Systems}$
-
DITTO GATE LIKE THREE PROCESSES P1 P2 AND P3 ARE THERE EACH REQUIRE AT MOST 3 RESOURCES AND CURRENTLY WE HAVE 7 RESOURCES WILL THERE BE DEADLOCK ANSWER IS NO
-
PROCESSES ARE P1 P2 AND P3 E RESOURCES ARE R1 R2 R3 R4 SOME OF THE RESOURCES ARE WITH THE PROCESSES AND THERE IS A DEMAND OF SOME RESOURCES IS THERE A CYCLE YES
-
DIRECT QUESTION ON BANKERS ALGORITHM
-
QUESTION ON ROUND ROBIN SCHEDULING AVERAGE TURNAROUND TIME OF THE PROCESSES IN THE QUEUE WAS ASKED
-
QUESTION ON SJF AND ROUND ROBIN PROCESSES FINISHING ORDER ON COMPLETION TIME ASKED
-
IN A TWO LEVEL PAGE TABLE THE MAIN MEMORY ACCESS TIME EFFECTIVE IS A AND WHEN THERE IS A THREE LEVEL PAGE TABLE THE EFFECTIVE MAIN MEMORY ACCESS TIME IS B, SUPPOSE THE PAGE FAULT RATE IS R WHAT IS THE RELATION BETWEEN A AND B WHEN MAIN MEMORY ACCESS TIME IS M
-
10% OVERHEAD ON PAGE FAULT, WHAT WILL BE THE PAGE FAULT RATE
-
DIRECT QUESTION ON LOOK DISK SCHEDULING
-
ONE VERY EASY QUESTION ON I NODE WAS GIVEN FOR 3 DIRECT POINTERS TO INDIRECT POINTERS AND 3000 INDIRECT POINTERS AND DISK BLOCK SIZE WAS 1KB WHAT IS THE MAXIMUM FILE SIZE
$\text{Digital Logic and design}$
-
WHAT WILL BE THE OUTPUT AFTER 3 CYCLES ON D FLIP FLOP COUNTER WAS GIVEN
-
N =X MINUS Y TWOS COMPLEMENT WAS ASKED AND X WAS A 11 BIT BINARY NUMBER AND Y WAS 7 BIT BINARY NUMBER
-
(111) IN OCTAL SYSTEM WAS GIVEN THEN WHAT WILL BE THE HEXADECIMAL AND DECIMAL REPRESENTATION FOR THE SAME
-
QUESTION ON 1: 4 DECODER WAS GIVEN WHAT WILL BE Q3 ON SELECT LINES ANSWER WAS S1S0
-
QUESTION ON IEEE 754 SIGN EXPONENT AND MANTISSA (8 bit)
-
One question on shift register, Inital and final state were given, we were asked, which shift operation is performed to get the final output, left shift, right shift, left shift with carry, and so on.
$\text{COMPUTER VISION AND NEURAL NETWORKS}$
-
WHICH FILTER IS USED FOR SATELLITE IMAGES GAUSSIAN FILTER IS ANSWER
- YOU ARE GIVEN A NEURAL NETWORK FOR CLASSIFYING CATS AND DOGS NOW YOU WANT TO CLASSIFY OTHER ANIMALS WHAT WILL YOU DO SO THE ANSWER IS BASICALLY WE WILL UPDATE THE HIDDEN LAYERS IN THE CENTRE
SOFTWARE TESTING AND JAVA
10–12 QUESTIONS( I SKIPPED)
$\text{DATABASE MANAGEMENT SYSTEM}$
-
ONE QUESTION ON NESTED SQL
-
ONE VERY DIFFICULT QUESTION ON NOSQL
-
one question on top 5 expensive books nested SQL (Previous year)
-
one question on sector address <Cylinder no, surface no, sector number was given> Previous year
$\text{Computer organisation and Architecture}$
-
TWO TO THREE QUESTIONS ON PIPELINES NUMBER OF CYCLES
$\text{PROBABILITY AND APTITUDE}$
-
VERY INTERESTING QUESTIONS ON PROBABILITY THERE WAS A BAG CONTAINING 10 NUMBERED BALLS. WE HAVE 4 BLUE BALLS 4 RED BALLS AND 2 GREEN BALLS HOW TO WHICH WE HAVE TO SELECT TO BLUE AND TO GREEN BALLS HOW MANY WAYS
-
1,2,3,4,5 numbers are given , two numbers are selected, probability that the sum is prime 10/25
-
three consecutive numners are given n, n+1 and n+2, such that n>1their product is divisible by some of the number of the form ${n}^2-1$ you can do that by taking n as 2
$\text{Graph Theory}$
Previous year GATE question number of hamiltonian cycles in a complete graph directed and undirected was not specified so and directed graph answer was given in the options
$\text{Computer Networking}$
-
NUMBER OF HOSTS QUESTION
-
TWO SOURCES WERE GIVEN AND SOMEHOW, DATA IS LOST, WHAT CAN BE THE DEVICES IN BETWEEN? ROUTER AND ROUTER, HUB AND ROUTER, SWITCH AND SWITCH, HUB AND HUB?
-
QUESTION ON BANDWIDTH DELAY PRODUCT
-
QUESTION ON CALCULATION ON LENGTH OF PACKET WHEN EFFICIENCY WAS 50%
-
QUESTION ON IP ADDRESSING SUBNET MASK
THANK YOU EVERYONE FOR LIKING AND SHARING
