Persistence
Paper Pattern:
Two papers are there both of 1 hour
1.Objective
2.Programming ( in C ).
I am submitting few Questions which I remember. For obj test go thru Book Handa
for
GATE
preparation.
They were more concentrating on programming section so be
prepare.
Objective Paper
Six
Sections are there each section contains 5 Questions. Paper is of GATE
pattern.
1. Data
Structure.
2. DBMS.
3. TOC.
4. OS.
5. General
Section.
6. C
programming.
DATA STRUCTURE
1. Question
of Binary search tree to find node when 43 will not be found
Ans= Every data set
was having 43 as its last element.
2. To find complexity of Linked list .
Singly circular ordered list is
there if m elements are to be inserted what will
be the
complexity of time.
i.
O(m*n).
ii.
O(m*(m+n)).
iii.
O((m+n)*log(m+n))
3. Adjacency
matrix question to find shortest path Ans=7.
A B C D E
A 0 m
B m 0 2 2 m
C 0 5
D 0 6
E 0
Where
m=infinity, Find shortest path from B to E.
4. Forest
& Tree question to find total no of nodes
Can’t remember question but
options are such that
1. n-(p+2)
ANS
2. n-p+2.
3. n-p. etc
same
question is in Sahni I think go thru it.
5. Infix to Postfix expression Of A+B*(C+D)/E+F {ANS=ABCD+*E/+F+ }
question is not confirm but pattern is of same
type.
DBMS
<,>,<=,>=.
1. Query
from Navathe
Select
fname,lname from employee
where eno in (select
eno from works-on
where pno=(select * from project)); what is the output .
2. A
query is given eg. Select name from employee where salary=salary. They
ask whether
query runs or not so just check it. Ans=Query Invalid
3.
What is the main use of B & B+ trees in
database Ans= For queries
4. question on Left outer Join & Full outer Join. For both
Variables are given &
in options
relationship is given to find whichever have greater tuples.
5. To
save space which option is better . Options are
i.
Write all join operation than select than project.
ii.
Write all join operation than project than select.
iii.
Write all join operation in between select &
project.
I think answer is iii.
Prepare
normalization & SQL part for interview.
OS
1. Using
LRU how many page faults are generated. 20 pages are there Ans=6
page
fault
2. match
the column
Options
i.
semaphore i
ii.
Monitor ii
iii.
Deadlock iii
iv.
Mutual Exclusion
iv. Iv
3. One question on file locking.
Scenario is given
Ans 1. Provide indefinite locking
2. Prevent intermediate
file Access. (Both 1 & 2)
4. If there are n processes &
each process waits p time in waiting state then CPU
utilization
is (options are)
1. n(1-p)
2.
(1-p to the power n) ANS (not sure)
3.
1-np.
4.
n*p
5. A critical section is Ans = a
set of instruction which is shared by
many
process.
General
- Probability
to find digits which not contain 7 between 100 to 999 Ans=18/25
- Packet
switching & Circuit Switching some diff are there Ans= CS take more
time to
established circuit.
- A file
have 3 bits for char such type of question Ans= 27000 or
24000(Confused)
- Hash
table question Ans=2.
A hash table has size of 11 &
data filled in its positions like {3,5,7,9,6}
how many
comparison s have made if data is not found in the list in worst case?.
Options= i. 2 ii. 6 iii. 11 iv. 1
- From
the set {a,b,c,d,e,f} find no. of arrangements
for 3 alphabets with no data
repeated. ANS=360.
OR for 4 alpha ANS=720.
C (objective)
Three questions on pointers just
go thru Test ur
C skills
- Question
on jack & jill given in the book they ask
whether swap or not Ans=No
- Array
pointer is pass (It is easy) Ans=Error
- String
Buffer Question
String Concatenate(Char
*s1,Char *s2)
{
Char buf[1000];
Buf[0]=null;
Strcat(buf,s1);
Strcat(buf,s2);
Return buf;
}
i.
should not return pointer to
local variable.
ii.
Nothing Wrong in this
function.
iii.
It don’t work if length
exceeds 1000 char.
iv.
Error in this code.
- foo() call
how many times Ans=5050.
For(i=1;i<=100;i++)
For (j=1;j<=100;j++)
Foo();
TOC
- Grammar
satisfaction {0,1}.Ans= option a .
- Ques on DFA & NDFA Ans= contain even no of c
- Ans=0*1*.
Programming
section
They mainly ask 2 programs.
1. Occurrence of letters in String. Get
string from KB of any length & print
letters
coming maximum time first than second largest….. i.e in descending
order.
Their requirement: They want that u make this program thru linked
list if u do
that than
it is well n good. Must allocate memory dynamically. Use proper
assumptions
& Comments everywhere this will add more advantage .use in all
programs.
Output look like if u enter string aababbbcba
b 5 times
a 4 times
c 1 times just like
that
Hint: Make array of 256 chars. Now Scan the string pick each char
and
according
to it’s acsii value increment that index value at
last u have an array
which have counter
for each alphabet. Sort this array & display.
2.
Sparse
Matrix Addition.
A structure of sparse matrix is
given. You have to create a function
sparseadd to add 2 sparse matrices
Structure is some how like
Struct Sparsematrix
{
int row ;
int col ;
int val;
SparseMatrix
*next;
}
You have to made
function to add two sparse matrices.
Function signature like
SparseMatrix SparseAdd(SparseMatrix s1,SparseMatrix s2)
3.
A man uses 1
or 2 steps of upstairs .If there are n upstairs how many
possible
combinations are there. Write a program to calculate the logic.
Eg:- If there are 4 upstairs then 5
possible combinations are there
1 1
1 1
2 2
1 1
2
1 2 1
2 1 1
Use the concept of Fibonacci
series & u crack it easily.
Please pay proper attention on COMMENTS & ASSUMPTIONS. Use
these as much as possible. Give proper OUTPUT of your program &
also explain how your logic works.
Once again they More concentrate on PROGRAMMING
SECTION.
In INTERVIEW they definitely ask that how you
solve these questions, What logic
you use. So be prepare
for all these.
Interview
Questions
1. Prepare DS,DBMS,OS,TOC
thoroughly may ask abt anyone everything
.
2. Reversing a linked list.
3. How u make database for windows
directory structure or any OS.
Hint: using trees &
field parent of which points to parent.
4. Make Program (Logic) to find word
in Dictionary.
Hint: using Hash Table.
4.
Make logic
of sorting which is not given in books. Make ur own.
5.
win NT architecture
given in galwin book in end.
6.
File system
FAT, NTFS etc.
7.
Prepare your
project & CV Thoroughly.
8.
They ask to
make a Joke.
9.
Tcp/ip.
10. Whatever they presented in PPT watch it
carefully(Most Important)
Some Other Questions
which I got from my Friends
1.
10,000 nodes ANS=25
2.
Hit Ratio Question
Ans=98%
3.
Frequency Question
Ans=35000 or
32000
4.
DBMS
Transaction Question ANS=Normalised other option have ACID
so this.
5.
Quick Or Merge
sort Ans=Merge
sort.
6.
Question on Networking
socket two IP address are given find which
conflicts.
7.
Which of following is true
I. A=>B MEANS B=>C
II. A=>B MEANS B=>A (ANS)