The Gateway to Computer Science Excellence

Actually I couldn't count and also they didn't give the count after the end of the test. So I don't know. Sorry!!

There were quite a few. But I saw many questions from neural network and microprocessors. 1-2 Gate questions were also repeated.

To be honest, I don't remember solving any maths questions. Maybe there were few. Exam was about 65-70% from gate syllabus. There were many questions from java, c++, neural network, SE, microprocessors. I agree with abhishek, paper was lengthy. It was almost not possible to solve 100 questions in 2 hours.

One repeated question was from dbms, which was after deleting a pair of key and foreign key, how many additional keys will be deleted, if the foreign key refer to primary key of the same table.

One repeated question was from dbms, which was after deleting a pair of key and foreign key, how many additional keys will be deleted, if the foreign key refer to primary key of the same table.

Gate syllabus questions were normal level (much similar to gate questions). There were questions from bankers algo, Round robin, ip addressing, avl trees, many were from dbms (sql), bubble sorting etc. Though i did not prepared at all since Gate exam :P. (Been busy with college projects). A good gate preparation will be enough.

I think the paper has different sets in my set I have no question of Software engineering.

order of weightage (from highest to lowest):

**DBMS**: (SQL queries,normalization,B tree)**OS**: ( banker's algorithm, CPU scheduling, synchronization)**Programming**: C++ (OOPS concepts many questions and Inheritance ),JAVA(Exception handling)**Algorithm**(Sorting, Huffman code)**Data****structure**(linked list, stack, queues, dynamic array)**Maths**(graphs, propositional logic)**Computer Network**(fragmentation,subnetting,layering)

Remaining subjects like DELD(Minimum logic gates, ), CO(Cache memory), and (8085 processor have around 2 to 3 questions), AI(neural net).

CO has decent weightage as questions are too big to even read and I am not very confident in CO.

So there could be a bais for CO. So take CO similar to Algorithm in weightage

A few questions that I remember from the 13th March session:

1. These 2 GATE questions were repeated: (COA and DSA)

https://gateoverflow.in/1000/gate2004-3?show=1000#q1000

https://gateoverflow.in/1061/gate2004-67#

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.

- All categories
- Testimonials 64
- Numerical Ability 0
- Verbal Ability 1
- Engineering Mathematics 13
- Algorithms 3
- Databases 5
- Digital Logic 4
- CO & Architecture 4
- Computer Networks 4
- Compiler Design 3
- Programming & Data Structures 6
- Motivation 25
- Preparation Advice 72
- Theory of Computation 7
- Interview Experience 89
- Preparation Experience 42
- Useful Links 27
- Study Materials 46
- Others 218
- Announcements 103
- Jobs 4

50,644 questions

56,523 answers

195,602 comments

101,282 users

CPU SCHEDULING , C OUTPUT, SQL QUERIES, AVL TREE, BUBBLE SORT, FIND THE COMPLEXITY OF CODE GIVEN these type of questions were there.

In instructions how to choose a answer , how to clear it, where is calculator etc details had been given . But it was no where mentioned that if it is having negative marking and also no details were given about which question carries how many marks(I assumed that its marking scheme will be like +3 and -1 and solved the paper).

Few Questions were wrong also ,like one classless ip addressing question was wrong, for sure.

edited Mar 12 by I_am_winner