Date of visit: 29.08.19
Criteria: 8.4 and above
Duration: 1 hr 45 minutes
Section A
It consisted of 30 questions :
DBMS(transactions, deadlock, 5 queries, 2 quantative aptitude), Complexity of the code snippet , Output questions -> majority questions based on c and there were also c++, java code snippets, Hash function based questions.
Section B (programs should be in C)
1. Find the height of the tree considering only the positive nodes.
2. Given an 2D array, find the number of occurrence of the string in the given array.
Criteria: 8.4 and above
Duration: 1 hr 45 minutes
Section A
It consisted of 30 questions :
DBMS(transactions, deadlock, 5 queries, 2 quantative aptitude), Complexity of the code snippet , Output questions -> majority questions based on c and there were also c++, java code snippets, Hash function based questions.
Section B (programs should be in C)
1. Find the height of the tree considering only the positive nodes.
2. Given an 2D array, find the number of occurrence of the string in the given array.
Comments
Post a Comment