I think the paper has different sets in my set I have no question of Software engineering.
order of weightage (from highest to lowest):
A few questions that I remember from the 13th March session:
1. These 2 GATE questions were repeated: (COA and DSA)
2. DSA: There were 3 questions related to Prim's algorithm. One of them involved finding the MST using Prim's and also the Dijkstra's shortest path from a source node to all other nodes, and then find which is the edge that is present in the shortest path tree, but not present in the MST. A question on Bubble sort, had to find what happens after 3 passes. A question based on properties of AVL and red-black trees. A function was given which uses a stack and takes a queue as an input, we had to find what it does (it reverses the elements of the queue). 2 questions on finding time complexity of the given code.
3. OS: Two questions on Banker's algorithm, to check whether the system is in a safe state. Another one to find average Turn around Time for LRTF (Longest Remaining Time First).
4. DBMS: Two questions based on transaction management, where schedules were given. In one of them, we had to find which transactions are conflicting. Few SQL queries, in one we had to check which one is legal.
5. Maths: One question with a matrix of order 3x3, which had the unknown P in some places. Had to find the values of P for which the matrix has a rank less than 3. Two questions on finding which is the most appropriate predicate logic expression for the given sentence.
6. Neural networks: Two questions, one had a Multi-layer perceptron network, where the weights and input values were given, with a linear activation function, and we had to find the output. The 2nd one asked whether the sigmoid activation function is continuous and differentiable.
7. Software engineering: One question where a program with an else-if ladder was given, and 4 test cases were given. We had to find out which test cases must be used so that all statements of the program are tested.
8. CN: IP fragmentation, with 2 links with different MTUs, find the total number of fragments formed at the end. There was also some question on the Leaky bucket traffic-shaping method, and one question on subnetting.
9. Digital Logic: How to make a D flip flop using a JK flip flop. Find minimum number of NAND gates needed to implement the equation PQ + RS.
10. COA: Find average access time, where 2 levels of memory were given.
11. Programming: 2 C++ questions, one used a virtual function and we had to find the output, another one had a program where it was asked which OOP concepts are demonstrated by this program. One C question which had 4 pointers (something like *w, **x, ***y) and had to find the output. A Java program with a try-catch-finally block, find the output.
12. 8085: Find time needed by a 2 MHz 8085 microprocessor to execute the IN instruction.
"Gate is not a 100 m race...
"Gate is not a 100 m race...