1ST SECTION:( DATA STRUCTURE)

1ST SECTION:( DATA STRUCTURE)

1. question from binary s earch tree

2. ans(250)

3. hash table problem ans(5)

3. adjacent matrix to calculate shortest path

4. ans(7)

2ndSECTION (C LANGAUGE)

1 what is int(*(*ptr (int))(void)

2. recursion to find the value of GET(I don’t remaember the digit but it is 2 arguments

(ans 6)



4 recursion function to calculate fun(4,9)

( ans e)

5 problem from strcmp



3rd SECTION(O.S)



2 string reference is given calculate the page fault based on LRU (ans:3 or 6)

3cache hit ratio numerical (ans 98%)

4 ans 360 (but I am not sure)

4TH SECTION(DBMS)



1. query is given based on table employ(eno,name, salary ….), workl(eno,…),project(pno,…. )

select eno from employ where eno in(select eno from workl groupby eno where

count(*)=(select count(*) from project))



2.select eno from emply where salary=salary

3.which is not required in trascation

options are (a).atomicity (b)isolation (c)normalization (d)concerrancy

5TH SECTION(TOC)

1. one transtion state is given identify the grammer it accept

1

2. 0

0 1 1,0

option are( a) (10)* (b) string starting from 1 (c) ) string starting from 0

(d) 1*0*

2.totolagy ans(b)

5 S->1S1

S->00

S->11

S->0S0

Option are (a) 00100100 {b) 110010001(c) I don’t remember



6th SECTION (GENERAL COMPUTER)



2. difference between packet swiching and circuit swiching

3. what is the probiblity of the occurance of 7 beetween 0 and 999 ans(18/25)

4. ans (360)

5. ans (37000)



SECOND ROUND (OF 1HOUR) (VERY VERY TOUGH)



TWO C PROGRAMS ARE GIVEN

Q1. U have to write the function for matrix addition using link list.

It is called "sparse matrix" .The structure for the element is as follows.



Typedef struct element{

Int row;

Int column;

Int value;

Element * next;

}element,sparsematrin*;



If value contains zero then there should not be node assign for that.U have to also

check boundary condition in your program.

Function is:



SparseMatrix SmAdd(SaprseMatrix m1,SparseMatrix m2)



( Revised concept of linked list and have a look at coding…..)

Q2.Problem:- One boy has to climb steps. He can climb 1 or 2 steps at a time.

Write a function that will returns number of way a boy can climb the steps.

Int WaytoSteps(int n)

(eg:- suppose number of steps is n=4 ,the function will return 5

(one-one-one-one ,one-one-two, one-two-one-,two-one-one, two-two)