Persistence Company Profile

Persistence Company Profile

Profile
Persistence company provides data management software thatprocesses the exchange, integration, and synchronization of data andWeb content for businesses with high-traffic Web sites, intranets, andextranets. Persistence'ssoftware can be used to speed up high-volume transaction processing fore-commerce, communications, financial services, transportation,logistics, and manufacturing companies. Persistence also offers educational, consulting, and technical support services. The company was acquired in November 2004 by Progress Software for about $16 million in cash
For more information visit their home site at www.persistence.com

Paper 5

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. 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
1. Probability to find digits which not contain 7 between 100 to 999 Ans=18/25
2. Packet switching & Circuit Switching some diff are there Ans= CS take more time to
established circuit.
3. A file have 3 bits for char such type of question Ans= 27000 or 24000(Confused)
4. 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
5. 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
1. Question on jack & jill given in the book they ask whether swap or not Ans=No
2. Array pointer is pass (It is easy) Ans=Error
3. 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.
4. foo() call how many times Ans=5050.

For(i=1;i<=100;i++)
For (j=1;j<=100;j++)
Foo();
TOC
1. Grammar satisfaction {0,1}.Ans= option a .
2. Ques on DFA & NDFA Ans= contain even no of c
3. 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
nt 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 sothis

Paper 4

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

Paper 1

1.Objective type Question :-Duration 1 hour

2.Programming Ability( u have to write two C programs for given problems-2 program):duration 1 hour

1.Objective Type Question:-

It has 5 types ,Each type contain 5 questions.No negative marking

Type1:-Computer Algorithm

(don't waste time doing paper work for algorithm my suggestion is first for DBMS GENERAL ..well if u r confident for algorithm go for it.)

1.In what option the binary search will not possible to search 43

a.11,22,55,56,43,34

b.

c.

d.

2.how many comparison required for merging two ordered list.

3.

Type2:- Programming(in c) (it contains 10 question u have to solve any 5)

(u must have fundas in programming .....)

1.Typical what will be the outpt.

2.One simple question on macro

square(x) x*x

a=10 b=20

if called as printf("%d", square(a+b)); what will be output

ans=32

Type 3:-Operating System

1.one small problem on process time completion .OS scheduler is round robin with 1 sec interval.4 process is given with their arrival time .asked to calculate the completion time for process p.

2.which is odd one

given 5 algorithm and find odd one.

3.

Type 4:-DBMS

Type 5:-General.

2.Programming test

( I don' t whether the problem will remains same or not for successive test.but pattern will be same.)

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)

(I cant solve this problem )

well,all the best ...go through basic concept of computer science and c programming

Paper 2

1. If there r n proceses and each process waits p time in waiting state then cpu utilization is-:
a) n(1-p)
b) n*p


2. A string of pages were given and no of page faults have to be found in LRU algorithm


3. here is a file server which provides locking for mutual exclusion . if any procees locks the file and abruptly terminated this will result in indefinitely locking .The solution they found is to implement a timer for locking of file i.e. if time outs then server assumes that file is indefinitely locked and terminate the process –
a) this solution is perfect for mutual exclausion
b) this will solve indefinite locking
c) this will result in interleaving of file between processes
d)


4. A critical section is –
ans a set of instruction which is shared by many proceeses


5. There was a question on automata ans – the resultant string will have even no of c


6. CFG was given
S -> 1 S 1
S-> 0 S 0
S -> 1 1
S -> 0 0
Find out the string


7. One singly circular ordered list is there if M elements are ti be inserted what will be the complexity of time
a) O(M*N)
b) O(M*(M+N))
c) O ((M+N) * log(M+N))
d)


8. find postfix and prefix of
A + B * ( C + D ) / E + F


9. Find out shortest path from A to B
A B C D E
A 0 m
B m 0 2 2 m
C 0 5
D 0 6
E 0


10. From the following when 43 will not be found by binary search (a series was given with last element 43 in each)


11. From 100 – 999 find the prob. Of getting 3 digit no with no 7 in any of its digit
a) 18/25
b) 10/25
c) 729/1000
d)


12. from the set {a,b,c,d,e,f} find no of arrangements for 3 alphabet with no data repeated


13. To save space which option is better
a) write all join operation than select than project
b) ---------,,------------------than project----select
c) ----------,,-----------------in b/w select and project
Employee = { e_no , salary, fname, lname}
Works_On = {e_no, p_no, hrs}
Project = {p_no, p_name}


14. select e_no from Employee where salary = salary
a) query invalid
b)


15. Select fname ,lname from Employee where e_no in (select e_no from works_on where p_no =(select * from project))
a) name of Employee who works on all project
b)
c)
d)


16. B tree is different from other
a) has fixed index file size
b) is better for queries like < <= > >=
c) searching will be easy
d)


17. func(char *s1,char * s2)
{
char *t;
t=s1;
s1=s2;
s2=t;
}
void main()
{
char *s1=”jack”, *s2=”jill”;
func(s1,s2);
printf(“%s %s ”,s1,s2);
}
OUTPUT jack jill


18. void main()
{
int a[5] ={1,2,3,4,5},i,j=2;
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf(“%d”,a[i]);
}
func(int j,int *a)
{
j=j+1;
a=a+j;
}


19. oid main()
{
for (a=1;a<=100;a++)
for(b=a;b<=100;b++)
foo();
}
foo()
{ }
how many times foo will be called.
a) 5050
b) 1010
c)
d)


20. A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons have to be made if data is not found in the list in worst case
a) 2
b) 6
c) 11
d)


21. packet switching is better than circuit switching coz
a) it takes less time
b) it takes less bandwidth
c)
d)


22. addition of two sparse matrix in 3 tuple notation ---time 30 min
24a tree has 1000000 nodes than how many search r required to search a node
a) 25
b)
c)
d)


23. A prgrm to arrange a string in order of occurrence of the character

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)