persistent placement

Archive for the ‘PERSISTENCE SYSTEMS’ Category

PERSISTENCE Placement Papers 3 Author: mod

10JAN

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.

http://www.placementpapers.in/persistence-placement-papers-3.html

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 so this

0 Comments Filed under: PERSISTENCE SYSTEMS

PERSISTENCE Interview Questions Author: mod

10JAN



3. How u make database for windows directory structure or any OS.

Hint: using trees & field parent of which points to parent.








9. Tcp/ip.


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

http://www.placementpapers.in/persistence-interview-questions.html

http://www.placementpapers.in/category/persistence-systems/

http://www.placementpapers.in/persistence-placement-papers-3.html#respond

4. DBMS Transaction Question ANS=Normalised other option have ACID so this



10JAN

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



http://www.placementpapers.in/persistence-interview-questions.html#respond

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)

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)



10JAN

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 exclausionb) this will solve indefinite lockingc) this will result in interleaving of file between processesd)

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 givenS -> 1 S 1S-> 0 S 0S -> 1 1S -> 0 0Find out the string

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




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

9. Find out shortest path from A to BA B C D EA 0 mB m 0 2 2 mC 0 5D 0 6E 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 digita) 18/25b) 10/25c) 729/1000d)

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 bettera) write all join operation than select than projectb) ———,,——————than project—-selectc) ———-,,—————–in b/w select and projectEmployee = { 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 = salarya) query invalidb)

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 projectb)c)d)

16. B tree is different from othera) has fixed index file sizeb) is better for queries like < <= > >=c) searching will be easyd)

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) 5050b) 1010c)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 casea) 2b) 6c) 11d)

21. packet switching is better than circuit switching coza) it takes less timeb) it takes less bandwidthc)d)

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

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


PERSISTENCE Company Profile Author: mod

10JAN

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 0 Comments Filed under: PERSISTENCE SYSTEMS


http://www.placementpapers.in/persistence-company-profile.html#respond

http://www.placementpapers.in/persistence-company-profile.html



ACCENTURE Placement paper 4 Author: mod

29DEC

SET DBMS.

1- data model is

a) entity b) constriants c) entity relationship d) all the above

ans: c

2- choise the correct one

select emp.name ,emp.age from emp1,emp2 where emp.sno = 456;

a) cluster b) non-cluster c) index d) none of these

ans:

3- what is index?

a) atrendum selectio of colum

ans) a

4- match the following

1- one to one a) manager to employ

2- one to many b) employ to employ

3- many to one c) unique object

4- many to many d) employ to manager

a) 1-a ,2-b ,3-c,4-d b) 1-c,2-d,3-a,4-b c) 1-c,2-a,3-d,4-b d) 1-d,2-b,3-a,4-c

ans: c

5-

1

Max 222

2 Allen 333

4 Rony 444

Select first.name from first where first.age = (select first.age from first where first.sno = 3);

a) max b) allen c) rony d) noneof these

http://www.placementpapers.in/accenture-placement-paper-4.html

ans:

SET ENGLISH

5 question based upon SIMPLE preposition

3 question from article.

5 questions from a single passage.

4-5 questions of synonyms.

SET MATHS

Question from logical based maths

SET REASONING

3 questions based upon equality of number’s

a) if all equal

b) if 1,2 same

c) if 2,3 same

d) none_..

3 questions based upon equality of symbols

if + means * and * means / and – means + and + means –

then mean of 28*40/4+2-6

8 question upon set theory means

if 100 r selecting in maths

and 90 in physics

120 in chemistry

& 22 in phy& maths both ,33 in maths & chemisty both

44 in ches & phy_11 in all

then

1) how many only in maths・.

2) Only in physics・

3) Only in chemistry・.

4) how many in atleast 2・

SET C

4 QUESTION on pointers_

3 on file handling_.

2 on functions_.

3 structurs and unions

2 from bitwise

1 from memory & space

SET C++

Inheritance

Scope of protected

Virtual function

Static member function

File handling

Question) If error is not catch by first catch statement then what will happen_.4 scenario were

0 Comments Filed under: ACCENTURE


29DEC

1) I sow her – airportAt on in across

2) masi specialists __ pleasant ,well balanced winesinto about ,in, with

3) by the time I arrived __ the pub she already leftin on at into

4) verbiagethe act of doing somethingthe use many words without necessitya vegetablenon of the above

5) fruitful meansjustifyfutileefficientproductive


http://www.placementpapers.in/category/accenture/

http://www.placementpapers.in/accenture-placement-paper-4.html#respond

6) aesthetically meanstactlesslyartisticallyhazardouslycolorfully

7) panda & white tiger are in danger speciesa ,an ,the ,none

8) doctor who you met yesterday was my fathera, an, the, none

9) university of its status doesn’t even need to advertiseaanthenone of the article required

10) 45students , 12 in debate only ,22 in singing only how many in both9 ,11 ,25 ,45

11) 10 play cabaddi, 20 play kho kho only ,5 bothhow many in total35,28 ,40,can’t say

12) 100 spoke English, 40 speak French ,20 bothat least one?110,100,140,120

13) 200 total 125 like pizza 115 Berger both?15,40,72,80

14) 10 friends meet for movie 20 for picnic and 5 for games 4 for m& pic 2 for m&g 0 for p&g 2 forall hoe many are students?11,16,25,35

15 ) a poll pointing towards east by accident started to point towards south. A man was travelingthing westwhat is the actual dirN,S,E ,W

16) Sagar was riding bike towards north, turned left road 1 km turns towards left &road 2km foundhimself 1km west of starting .how far did he road north?1,2,3,5

23) Asha said “his mother’s only daughter is my mother”nephew, sister, wife , niece

24) 600 to be seated.10benches are less. so 2 more persons are required to be seated in eachbench. so how many benches.209364460

30) selling a ac gains 25% on SP. what % gain on CP.152533.3347.5

5 students from different universities.A speaks Hindi and Bengali.B Hindi and English.C English and Bengali.

31) interpreter between C and DA onlyB onlyE onlyA ,B and E

32) can’t speak without interpreterB&EA&BA&CB&E

33) 5 children were born on the same day but on different years in b/w 1999 – 2003 . Abhya isyounger than Dinesh and Frahan. Vaskar is naughtiest of all. Girish is older than Dinesh andFarhan. If Abhay is born in 2002, then in which year Farhan is born :1999-20022000- 20011999, 2000, 20012003

34) Order in which children are born ?B,D,G,F,AG,D,B,F,AG,A,B,D,FF,B,D,A,G

35)all 3 are alike1,2 are alike1,3,are alike2,3 are alikeall are different

GGGGJJJGJJGGGJGGJGJJGGGGJJJGJJ

36)9745.24199969745.24199969745.2409996

38)8472.9200602

8472.92006028472.9200602

39) * = +, / = *, + =- , – = /2/9*11+10- 8A) 20.8B) 27.8C) 27.8D) 25.8

40) *= -/=+

+=/-=*12/20*4+80-4=31.820*4/4+80-4=-8.212*4/20+12-4=-124*12/4+80-4=-8

41) *=//=-+=*-=+

4*16/4+20-16=5632/4*4+20-16=2832*4/4+32-16=2.516*32/4+20-16=640

46)STRUCT U{INT EMP_AGE;FLOAT EMP_SAL;CHAR EMP_NAME[10];} U1UNION U1 V1,*P2;P2=&V1;WHICH OF THE FOLLOWING ARE CORRECTV1.EMP_AGEP2->EMP_SALP2->EMP_AGENONE

90) stores a log of changes made to db, which are then written to _,which are then written to_,which is used if db recovery is necc.A) db buffer share poolb)program global area, shared poolc)system global area, large pool

d) redo log buffer, online redo log

76) means allowing objects of difference types to be considered as examples of a higher level set :ans: Generalization

77 The primary characteristic of key field is that it must be unique

78) manager————– –emp managed byans: one of many recursive relationship

79) ans: attribute, entity, relationship

61) if a member initialized is not provided for a member object of a class .The object – is calleda)static fnb)non static fnc)default constructord)none

62) class contest {private:const int i;public:constest():i(10){}

a) Inheritanceb) abstract base classc) specifies a way to define a const member datad) none

63) implement polymorphism when by object belonging to different class can respond to the samemessage in diff ways.a) late bindingb)dynamic bindingc) dynamically created objectd) virtual fun



29DEC

1) Question about the project you were thoroughly grilled.

2) List the various types of storage classes and explain the scope & lifetime of each one.

3) Right shift/Left shift + 1’s complement concepts and give the output of this:

i = 10;

int j = i >> 10;

cout<<j;

4) Difference b/w

char *str = “Hello”;

char arr[] = “Hello”;

The following statements get complied or not?

arr++; // ERROR..its like a pointer constant

*(arr + 1) = ’s’;

cout<<arr; // o/p: Hsllo

5) struct Date

{

int yr;

int day;

int month;

} date1,date2;

date1.yr = 2004;




date1.day = 4;

date1.month = 12;

How will you initialize date2 (without member by

member assignment)

ans: date2 = date1;

6) Explain Primary Memory, Secondary Memory, Virtual

Memory.

7) What happens when you run a program?

8) Virtual functions/ Abstract classes/ Pointer

functions

9) Write a recursive factorial program.

10) How can you invoke a base class member

function using derived class pointer?


ACCENTURE Placement Paper 1 Author: mod

29DEC

GENERAL idea about accenture selection process-(4 rounds)

Round 1 : APPTITUDE TEST

Round 2 : GROUP DISCUSSION

Round 3 : HR INTERVIEW (One to One interview)

Round 4 : TECHNICAL INTERVIEW

APPTITUDE TEST

Cracking apptitude test of Accenture is quite easy. But remember nearly 3/4 th of students of the total appearing fail to crack this round? Preparation for apptitude test is always needed.

Guidelines- Refer to previous accenture papers. Pattern of questions remains more or less same only.

Some type of questions – Venn diagram,

Fill correct word,

* similar word for the word in italics,




if 1 stands for $, and 0 stands for * then what answer would suit the equation.

* Questions on 2 passages

* Date & day problems

* Data sufficiency type problems

Race problem

References for above–> Quantitative apptitude (R S AGRAWAL) SHAKUNTALA DEVI.

GROUP DISCUSSION

Guys who r not comfortable in speaking ENGLISH clearly, possibly do not clear this round?

* Topic given to my group was Sharukh v/s Amitabh in KBC.

* Try to speak clearly and to the point.

* Try to be the leader.

* Give examples to support what u speak that creates the best impression.

* If you dont speak then or if your voice tone is not loud and clear and if you are seen nervous then you are gone.

* The best way to clear this round is to take initiative if possible and try to conclude on behalf of your group members.

HR ROUND

Interview Questions asked to me were

* Describe yourself?

* What r ur strengths?

* What do you know about accenture?

* Why accenture?

* What projects does accenture works on?

* Which are the top 3 IT firms in INDIA?

* Tell me about the projects done by u?

* Besides projects have u done any assignments what role u played there?

* What are your future plans?

* R u ready to relocate?

* Which place u would prefer if choosen?

* R u married?

* Possibly at what age will u marry?

* What does our parents do?

* Do you have any education gap?

* R u sure that the information u provided us is true?

* Any questions?

TECHNICAL ROUND

‘Toughest round’ and a ‘thick elimination round’ If u are a COMPUTER or IT guy then be prepared for some tough questions and be ready to write any algorithm or program which they ask u.

* I was possibly the 10th guy for appearing the technical interview and all the previous guys were eliminated but i was prepared for tech round so confidently i cleared it.

* They assured me that since i was a COMPUTER guy the tech would be tough as they Expected more from a COMPUTER guy.

* I was asked to write sorting algorithm. Confidently i wrote it taking a example and explaining it. I constructed the algorithm step by step telling him the logic as to why i was doing each step and why did i not planned another solution.

* Questions generally began from interviewer’s side and he began to go deep as he was to explore all what i had studied. Since my basics were clear i did not faced much problem.

* It took some 15 minutes for this round and since he had put me all the possible questions on sorting no more questions were asked.

* But for those who were not comfortable in answering the first question were put many questions then and he saw upto what level our concepts were clear and how much knowledge u have.

* B prepared for this round as ratio of selection to rejection for this round can be guessed by me possibly as 1:10.

REMEMBER

* Confidence is tested at all the levels.

* If u do not have the confidence then our chances of selection are slim.

* Refer to all accenture papers.

* B prepared for apptitude first then only think of facing the other rounds.

* B prepared for technical since our place in accenture depends on this final round.


ACCENTURE Pattern Author: mod

29DEC

This was an awesome experience for me as this was my third time to face an interview after MBT and Infy. Accenture paper consists of the following 4 rounds:-

http://www.placementpapers.in/accenture-pattern.html



1. Aptitude test (3 sections)

2. GD

3. HR

4. Technical Interview

Aptitude consisted of 3 sections.

English part was the easiest one. It started with 5 questions on articles, 5 on fill in the appropriate word, two passages (one on SQL and the other on DBMS), a bit confusing and time consuming.. (one of them is already in previous papers) Synonyms.

Mathematics was quite easier for me (as I was preparing since MBT).. Make sure that u do all the questions from venn diagrams, symbol questions like-if *=+, – symbolizes /.. and so on.. one question on direction sense.

Verbal- it included the following:- which of the following are similar- 345678,345678,346875etc. passage questions (puzzle type).

PERSISTENT IT SOLUTIONS, Global Consultants, is recognized as one of the fastest growing information technology consulting and services firms. We have been providing world-class IT consulting services and solutions to Fortune 2000 customers. We have been successful in delivering quality solutions with unmatched efficiency and great flexibility as a result of our deep understanding of industry domains and expert knowledge of diverse technologies. Through our unique Global Flexi-Delivery Model, we deliver onsite, offsite, and offshore solutions to global clients.we provides clients the full spectrum of technology services – from business and IT consulting to managing turnkey projects.

PERSISTENT IT SOLUTIONS culture and reputation for reliability have attracted the best talent and the most discerning clients. It has been recognized in the industry for its phenomenal growth and client-centric operational philosophy. PERSISTENT IT SOLUTIONS is a certified minority-owned firm and is ranked amongst the largest minority-owned IT services companies.

PERSISTENT IT SOLUTIONS a unique proposition in the IT services domain, is tailored to clients’ economic, technology, cultural, and strategic needs. Following a thorough analysis of a host of factors including the nature of the assignment, the client’s key business drivers, and the overall cost-benefit advantages, PERSISTENT IT SOLUTIONS would propose a delivery approach that is most appropriate. This could be purely onsite, offsite or offshore or a combination best-of-breed model.

Quality is the nerve center for all thought and action at PERSISTENT IT SOLUTIONS. We at PERSISTENT IT SOLUTIONSbelieve that Quality is a culture and take great pains to make it our way of life. The impeccable client retention record we have enjoyed over the years is the result of our commitment to Quality.

Persistent IT Solutions is in Bangalore, India. Each center is a knowledge base boasting the best of technological talent spun into our cultural fabric of delivering the best value to our clients. PERSISTENT IT SOLUTIONS is proud of having one of the highest retention rates and a top repeat record in the industry. Our dedicated professionals and satisfied partner-clients are a testimony to our commitment.

We specialize in a wide spectrum of technology domains, including n-Tier Applications, Mobile Computing and EAI (Enterprise Application Integration), providing optimal, flexible, scalable and cost-effective solutions. Our worldwide spread of customers encompasses all major vertical segments, including Finance, Healthcare, Manufacturing, Retail/Wholesale and Telecom.

Our expertise over the years, and a formidable team of high-caliber software professionals enables us to develop world-class software solutions, keeping pace with the ever-changing technological trends through continuous growth and learning.

With very large state-of-the-art software development centers in India and a worldwide network. we have implemented major software projects, in an optimized combination of off-shore and on-site resources. Our global delivery model leverages the world-class development facilities in India to provide high quality, rapid time-to-market solutions on time and within budget.

We deliver ground-breaking applications and innovative solutions to some of the toughest technical problems facing business today.

f you are interested in the field of software and want a career in that, then persistent systems is the place for you to be. But before trying in for the test you have to choose your subjects. There are placements for computer literates (for development) and for others too. The others are analyzed for quality and testing. The candidate must have attained 60% or above in 10th and 12th, along with pursuing a degree for engineering.

http://entrance-exam.net/engineering-entrance-examinations/

To get into this you have to clear a three level test to get into it. The first round has multiple questions. The first 15 questions are based on percentage, age factors, ratio and proportion etc. The next 15 questions are based on C, to find the output and errors and with abcd options. Next 10 questions are related to data structure. Further 5 questions on operating system like UNIX, segmentation etc.

In the second round the candidate is tested for his/her practical knowledge about C language. In the last round the candidate is interviewed. In order to clear the interview, one must have cleared the two rounds and must have good communication skills. Getting placement in Persistent systems provides the candidate an opportunity to earn while learning. For further guidance here are the links-

Links

http://placementpapers.net/helpingroot/Persistent/Persistent-Placement-Paper-Aptitude-Technical-Section

http://placementpapers.net/helpingroot/Pattern/Persistent-Paper-Pattern-on-4-April-2008

http://www.allinterview.com/placement-papers/Persistent/10272.html



Persistent Placement Papers | Persistent Interview Procedure | Persistent Aptitude Questions | Persistent Technical Questions | Persistent Interview Questions

Paper Pattern:Two papers are there both of 1 hour1.Objective2.Programming ( in C ).

Objective PaperSix 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 EA 0 m B m 0 2 2 mC 0 5 D 0 6E 0Where m=infinity, Find shortest path from B to E.

4. Forest & Tree question to find total no of nodes1 n-(p+2) ANS2. n-p+2.3. n-p. etcsame 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


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.


OS


2. match the columnOptionsi. semaphore i

ii. Monitor iiiii. Deadlock iii iv. Mutual Exclusion iv. Iv

3. One question on file locking. Scenario is givenAns 1. Provide indefinite locking


5. 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


2. Packet switching & Circuit Switching some diff are there Ans= CS take more time to established circuit.


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 Programming

1. Array pointer is pass


3. 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();

Programming Section ( 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 aababbbcbab 5 timesa 4 times c 1 times just like thatHint: 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)

Interview Questions



3. How u make database for windows directory structure or any OS.Hint: using trees & field parent of which points to parent.








10. Tcp/ip.



Paper Pattern: Two papers are there both of 1 hour 1.Objective 2.Programming ( in C ).

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.

http://www.discussionsworld.com/forum_posts.asp?TID=12211

http://www.jobsassist.com/placementpapers/persistent-placement-paper-9.asp

http://www.vyomworld.com/placementpapers/persistent-placement-paper-16.asp



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 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.

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 4.

Prevent intermediate file Access. (Both 1 & 2) 5.

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 Programming

1.

Array pointer is pass 2.

String Buffer Question 3.

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();


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)

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. 5.

Make logic of sorting which is not given in books. Make ur own. 6.

win NT architecture given in galwin book in end. 7.

File system FAT, NTFS etc. 8.

Prepare your project & CV Thoroughly. 9.

They ask to make a Joke. 10.

Tcp/ip. 11.

Whatever they presented in PPT watch it carefully(Most Important)

Persistent Placement Papers and Sample Papers

Paper Pattern:

Two papers are there both of 1 hour1.Objective2.Programming ( in C ).

Objective PaperSix 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 EA 0 m B m 0 2 2 mC 0 5 D 0 6E 0Where m=infinity, Find shortest path from B to E.

4. Forest & Tree question to find total no of nodes1 n-(p+2) ANS2. n-p+2.3. n-p. etcsame 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


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.

Operating System


2. match the columnOptionsi. semaphore iii. Monitor iiiii. Deadlock iii iv. Mutual Exclusion iv. Iv

3. One question on file locking. Scenario is givenAns 1. Provide indefinite locking


5. 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


2. Packet switching & Circuit Switching some diff are there Ans= CS take more time to established circuit.


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 Programming

1. Array pointer is pass


3. 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();


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 aababbbcbab 5 timesa 4 times c 1 times just like thatHint: 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)

Interview Questions



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.






10. Tcp/ip.

11.

HELLO GUYS..........................i m sourabh sahu from UIT-RGPV, Bhopal...pursuing my BE in CS stream...persistent came to our college on 28-29 April...945 student appeared for it both for Development & Testing..............................

First Round,, (written objective)>Simple Aptitude(10 ques)>data Structure(10)>O.S.>DBMS

Second round (subjective)>Three Programs were there..data structureOut of 940... 9 were shortlisted for Development part & 20 for Testing Part. After that Real Coutdown begins,,,

Third Round(Technical 1)Persistent needs core tech guys....They asked everything about data structure....most of the guys are rejected from this. this round ...luckily I made it.....now in development 6 were left for round 4..& in testing 14..Now In fifth round they asked everything about ur project...tech skills...as I hv wrote servlets in CV ..they asked lot of things in itThey told us to design program for sudoku.....Now from this round only 2 were selected for HR. in Development & 6ere in Testing .....& Final selection 2 for Development & 3-4 for testing............finally after a long hurdle I made a comp of repo.......this

comp has very very high rejection ratio..after all they wont give 3.4 lakh /annum easily.....All the best to all...

Hope to meet u all...@ persistent...RegardsSourabh Sahu

t PERSISTENT IT SOLUTIONS, we are always on the move! On the brink of creating something new, scripting innovative trends, authoring cutting-edge research, and building an intellectual wealth bank. We are on the threshold of creating the next generation of IT solutions and services. And creating value for the customer.

It's not about just another job. At PERSISTENT IT SOLUTIONS it's a whole new life altogether. And it shows. This 'made in India' organization is today a global leader in the IT services industry. It seemed like an impossible task when we began our journey, on the way, we embarked on many 'Mission Impossible' initiatives and have turned them into 'Mission Possible' ones. And the journey continues…

Today, we have operating across the globe. The company has a strong global reach with a sales, marketing and support presence across the globe.

Are you looking to be a part of a winning team?

PERSISTENT IT SOLUTIONS. firmly believes that the success and long-term prosperity of the organization depends on the dedication of its employees and on the consistent high quality of their contributions.

In return, PERSISTENT IT SOLUTIONS offers recognition through awards and other benefits, a foray of continuous learning, adding value to oneself, and plenty of opportunities to be versatile in the IT industry

Click here to send in your Resume [email protected]

1. void main()

{

int d=5;

printf("%f",d);

}Ans: Undefined

2. void main()

{

int i;

for(i=1;i<4,i++)

switch(i)

case 1: printf("%d",i);break;

{

case 2:printf("%d",i);break;

case 3:printf("%d",i);break;

}

switch(i) case 4:printf("%d",i);

}Ans: 1,2,3,4

3. void main()

{

char *s="\12345s\n";

mailto:[email protected]

printf("%d",sizeof(s));

}Ans: 6

4. void main()

{

unsigned i=1; /* unsigned char k= -1 => k=255; */

signed j=-1; /* char k= -1 => k=65535 */

/* unsigned or signed int k= -1 =>k=65535 */

if(i<j)

printf("less");

else

if(i>j)

printf("greater");

else

if(i==j)

printf("equal");

}Ans: less

5. void main()

{

float j;

j=1000*1000;

printf("%f",j);

}

1. 1000000

2. Overflow

3. Error

4. None

Ans: 4

6. How do you declare an array of N pointers to functions returning pointers to functions returning pointers to

characters? Ans: The first part of this question can be answered in at least three ways:

7. Build the declaration up incrementally, using typedefs:

typedef char *pc; /* pointer to char */

typedef pc fpc(); /* function returning pointer to char */

typedef fpc *pfpc; /* pointer to above */

typedef pfpc fpfpc(); /* function returning... */

typedef fpfpc *pfpfpc; /* pointer to... */

pfpfpc a[N]; /* array of... */

8. Use the cdecl program, which turns English into C and vice versa:

cdecl> declare a as array of pointer to function returning pointer to function returning pointer to char char

*(*(*a[])())()

cdecl can also explain complicated declarations, help with casts, and indicate which set of parentheses the arguments

go in (for complicated function definitions, like the one above). Any good book on C should explain how to read these

complicated C declarations "inside out" to understand them ("declaration mimics use"). The pointer-to-function

declarations in the examples above have not included parameter type information. When the parameters have

complicated types, declarations can *really* get messy. (Modern versions of cdecl can help here, too.)

9. A structure pointer is defined of the type time . With 3 fields min,sec hours having pointers to intergers.

Write the way to initialize the 2nd element to 10.

10. In the above question an array of pointers is declared. Write the statement to initialize the 3rd element of the 2

element to 10

11. int f()

void main()

{

f(1);

f(1,2);

f(1,2,3);

}

f(int i,int j,int k)

{

printf("%d %d %d",i,j,k);

}What are the number of syntax errors in the above?

Ans: None.

12. void main()

{

int i=7;

printf("%d",i++*i++);

}Ans: 56

13. #define one 0

#ifdef one

printf("one is defined ");

#ifndef one

printf("one is not defined ");

Ans: "one is defined"

14. void main()

{

intcount=10,*temp,sum=0;

temp=&count;

*temp=20;

temp=∑

*temp=count;

printf("%d %d %d ",count,*temp,sum);

}

Ans: 20 20 20

15. There was question in c working only on unix machine with pattern matching.

16. what is alloca() Ans : It allocates and frees memory after use/after getting out of scope

17. main()

{

static i=3;

printf("%d",i--);

return i>0 ? main():0;

}

Ans: 321

18. char *foo()

{

char result[100]);

strcpy(result,"anything is good");

return(result);

}

void main()

{

char *j;

j=foo()

printf("%s",j);

}

Ans: anything is good.

19. void main()

{

char *s[]={ "dharma","hewlett-packard","siemens","ibm"};

char **p;

p=s;

printf("%s",++*p);

printf("%s",*p++);

printf("%s",++*p);

}Ans: "harma" (p->add(dharma) && (*p)->harma)"harma" (after printing, p->add(hewlett-packard) &&(*p)->harma)"ewlett-packard"

Test Paper :2

Paper Type : Technical - Java

Test Date : 22

September 2005

Posted By : Jai

1. Tell me about yourself.

2. tell me about your project.

3. why have you chosen jsp and weblogic.

4. how confident r u in core java,advanced java.

5. what is interface ?

6. what are public ,private,protected in JAVA

7. what is multithreading ?

8. what r the types of casting in JAVA.

9. data types of java.

10. classification of data types of JAVA.

11. swap two variables without using 3 rd variable.

12. what r the objects implicit or explicit available in JSP.

13. Explain servlet life cycle.

14. What is the difference between interface and astract class.

1. US war on iraq-justified or not.2. Role of UN in peacekeeping.3. Position of Women in India compared to other nations.4. Environment MAnagement.5. Is China better than India in software.6. Should SONIA gandhi be made the PM7. BPOs in INDIA8. Govt contribution to IT9. will punch lines rule the Advt10. premaritial sex11. is china a threat to indian industry12. india or west , which is the land of opportunities13. water resources should be nationalised14."BALANCE BETWEEN PROFESSIONALISM AND FAMILY"15. Effect of cinema on Youth16. Education in India compared to Foreign nations17. Is it necessary to ban COCOCOLA in India.18. What is the effect of movies on youth.(is it good or bad)19. Are studies more benifitial in India or in Abroad.20."UN's peace activities" and "America's war on Iraq".21."Environment-Whose Responisibility".22.Is China a threat to the indian software industry.23.Role of UN in Peace keeping24.War on Iraq25.About Hockey being the primary game in India.26.Can america occupy iraq27.Cricket shud be banned or not.28.IS CHINA A THREAT TO INDIA29.Present state of Indian Cricket team.

30.Love marriage/Arranged marriage.31.Advantages of Co-education.Hot Topics: -----------1.How to deal with international terrorism.2.Should we pursue our policy of dialogue with Pakistan?3.Is peace and non-violence outdated concepts?

. Find the locus of the point whose sum of distance from 2 fixed points is constant.

2. [-infinity to +infinity]integration(exp(-x*x))

3. The product of any 3 consecutive nos is always divisible by _ ? options[12/6/10/24]

4 int i=0,j=50

while (i<j)

{

if(<some condtn>)

{

<body of the loop>

i++

}

elseif(<some condtn>)

{ <body of the loop>

j--

}

else(<some condtn>)

{<body of the loop>

j--

}

}

How many times the body of the loopis going to be executed?

options[unknown/25/50/depends on the given condtn]

5 How can you include a library code written in C++ in a source code written in C?

(Options are there)

Ans. Some cross-linked platform(compiler) is required for this.

6 int a[20],i

for(i=0;i<20;i++)

{

a[i]=i;

}

for(i=0;i<20;i++)

{

a[i]=a[20-i]

}

What is the final content of the program.

7 Which data structure should be used for searching an element in an array in constant time in case of

average case? Ans. Hash table(not sure)

8 One question on ISO OSI model.easy one(not remembered)

9 Another question abt. a protocol Ans. Token/Ring

10 If we want to connect two systems to form a network which leyer(OSI) is of most interest to us?

Ans. Physical layer.

1. Point out error, if any, in the following program

main()

{

int i=1;

switch(i)

{

case 1:

printf("\nRadioactive cats have 18 half-lives");

break;

case 1*2+4:

printf("\nBottle for rent -inquire within");

break;

}

}

Ans. No error. Constant expression like 1*2+4 are acceptable in cases of a switch.

2. Point out the error, if any, in the following program

main()

{

int a=10,b;

a>= 5 ? b=100 : b=200;

printf("\n%d",b);

}

Ans. lvalue required in function main(). The second assignment should be written in parenthesis as follows:

a>= 5 ? b=100 : (b=200);

3. In the following code, in which order the functions would be called?

a= f1(23,14)*f2(12/4)+f3();

a) f1, f2, f3 b) f3, f2, f1

c) The order may vary from compiler to compiler d) None of the above

4. What would be the output of the following program?

main()

{

int i=4;

switch(i)

{

default:

printf("\n A mouse is an elephant built by the Japanese");

case 1:

printf(" Breeding rabbits is a hair raising experience");

break;

case 2:

printf("\n Friction is a drag");

break;

case 3:

printf("\n If practice make perfect, then nobody's perfect");

}

}

a) A mouse is an elephant built by the Japanese b) Breeding rabbits is a hare raising experience

c) All of the above d) None of the above

5. What is the output of the following program?

#define SQR(x) (x*x)

main()

{

int a,b=3;

a= SQR(b+2);

printf("%d",a);

}

a) 25 b) 11 c) error d) garbage value

6. In which line of the following, an error would be reported?

1. #define CIRCUM(R) (3.14*R*R);

2. main()

3. {

4. float r=1.0,c;

5. c= CIRCUM(r);

6. printf("\n%f",c);

7. if(CIRCUM(r))==6.28)

8. printf("\nGobbledygook");

9. }

a) line 1 b) line 5 c) line 6 d) line 7

7. What is the type of the variable b in the following declaration?

#define FLOATPTR float*

FLOATPTR a,b;

a) float b) float pointer c) int d) int pointer

8. In the following code;

#include<stdio.h>

main()

{

FILE *fp;

fp= fopen("trial","r");

}

fp points to:

a) The first character in the file.

b) A structure which contains a "char" pointer which points to the first character in the file.

c) The name of the file. d) None of the above.

9. We should not read after a write to a file without an intervening call to fflush(), fseek() or rewind() <

TRUE/FALSE>

Ans. True

10. If the program (myprog) is run from the command line as myprog 1 2 3 , What would be the output?

main(int argc, char *argv[])

{

int i;

for(i=0;i<argc;i++)

printf("%s",argv[i]);

}

a) 1 2 3 b) C:\MYPROG.EXE 1 2 3

c) MYP d) None of the above

11. If the following program (myprog) is run from the command line as myprog 1 2 3, What would be the output?


{

int i,j=0;

for(i=0;i<argc;i++)

j=j+ atoi(argv[i]);

printf("%d",j);

}

a) 1 2 3 b) 6 c) error d) "123"

12. If the following program (myprog) is run from the command line as myprog monday tuesday wednesday

thursday,

What would be the output?


{

while(--argc >0)

printf("%s",*++argv);

}

a) myprog monday tuesday wednesday thursday b) monday tuesday wednesday thursday

c) myprog tuesday thursday d) None of the above

13. In the following code, is p2 an integer or an integer pointer?

typedef int* ptr

ptr p1,p2;

Ans. Integer pointer

14. Point out the error in the following program

main()

{

const int x;

x=128;

printf("%d",x);

}

Ans. x should have been initialized where it is declared.


main()

{

int y=128;

const int x=y;

printf("%d",x);

}

a) 128 b) Garbage value c) Error d) 0

16. What is the difference between the following declarations?

const char *s;

char const *s;

Ans. No difference


main()

{

char near * near *ptr1;

char near * far *ptr2;

char near * huge *ptr3;

printf("%d %d %d",sizeof(ptr1),sizeof(ptr2),sizeof(ptr3));

}

a) 1 1 1 b) 1 2 4 c) 2 4 4 d) 4 4 4

18. If the following program (myprog) is run from the command line as myprog friday tuesday sunday,


main(int argc, char*argv[])

{

printf("%c",**++argv);

}

a) m b) f c) myprog d) friday




{

printf("%c",*++argv[1]);

}

a) r b) f c) m d) y




{

while(sizeofargv)

printf("%s",argv[--sizeofargv]);

}

a) myprog friday tuesday sunday b) myprog friday tuesday

Paper Type : Candidate Experiences Test Date : 7 February 2007 Test Location : St. Vincent College, Napur

PERSISTENT SYSTEMS PAPER ON 07th FEBRUARY AT NAGPUR

Hai friends,

Please Remember one thing, that if the subjects like oop and dbms are not covered yet, then they wont take ur exam on that...... i thought the paper would contain it and the subjects are yet to be covered (as I am in 6th sem) so i didnt prepare the C and data structures. Dont make that childish mistake. They consider your subjects covered and then they take the test accordingly.

For Computer people they have placement for Development and for others (NA for electrical) ETC it is Quality Analysis and testing.

Criteria to appear is 60 % and above from ssc hsc engg present and no KT you have to be a clean person. (a Saint)

I am from Computers , so discussing the Development paper: QA had different test1st Round:- Appeared 350+ Selected: 59 onlyAll MCQz = Multiple choice Questions

15 questions on aptitudeLR, percentages, age problems,Ratio proportion

15 Questions on Cgive the output, what is the error, some had abcde and some had abcd options only

10Questions on Data StructuresComplexity, Better sorting techniques,etc

5 Question on OS.Unix, paging, segmentation.

2nd Round:- Selected =22Write a C Program1) An Array to be passed to a function and check some condition and print. <--- SO pointers are considered

2)Datastructure BTREE pre-order and its traversal and checking if itis palindrome.

3rd roundInterview : In the nagpur Persistent campus............. results yet to be out ...... I think five would be selectedPersistent is a 11th fastest growing company , so if you want to learn while you earn go for it Package provided was 2.6+

By,Ketan Thakkar

i………….. i am Manisha Korpe from s.g.g.s i e&t,nanded. i got selected in persistent. now i am telling about selection procedure of persi. specially for electronics & telecom students. don’t worry about apti it’s very simple. there are 30questions and time is of 60 min,no sectional cutoff criteria is above 55%. It consists of following rounds1.APTITUDE2.TR13.TR2.4.HR Aptitude consists of 2 sections.1-quantitative,2-’c’questions.apti is separate for electronics & computer ,IT. so don’t worry apti is of 30 marks out of which 25 marks on qunti & 5 marks on ’c’ questions. In quanti they ask questions on probability,permutation & combination,ages,averages,simple & compound interest,percentage.In ’c’ questions are like find out output of given program,error finding.apti is very simple u can easily crack.somequestions from apti which i remember are .find output of following1.main(){i=2;printf("%d %d",++i,++i);}ans- 4 3 2.main(){int n;printf("enter any no");scanf("%d",&n);for(i=0;i < P>{printf(" %d",fib(i));}getch();}fib(int n){if (n= =0){return 0;}else if(n= =1){return 1;}

elsereturn (fib(n-1)+fib(n-2));}find the output of above program for n=8.for this type of question refer book "test ur c skill". 3.find the probability of getting any day is sunday in any leap year .ans-2/7 4.if a stick of any length is breakdown in two parts.find the probability getting length of stick more than 3:1 TR1-In this section they ask the questions on ’c’,microprocessor(if u mention in introduction as a field of interest),’c++’some questions are like1.what r storage classes in ’c’.explain about ’extern ’2.tell something about calloc and malloc.and difference betn.these two.3.do program for finding factorial of given number using recursion or without using recurtion.4.do program for fibonises series using recursion or without using recursion.5. without using ‘strev’ function print the reverse string.6.without using third string swap the contents of string.And basic questions like on pointer,microprocessor. TR2-In this section they give 3 programs u have to do that program they ask any type of program for me they ask the programs like-1. multiplication of two nos.in 8085 microprocessor2. if input array is given as[ 1,3,5,6,1,3,4,1,5,7,8]U have to print the array such that in which do not repeat the nos.which r in input array i.e. Output array is [1,3,5,6,4,7,8]3.find the given no. is in form of “2^n” or not4.if an array is given find the addition of two successive elements and print this addition in another array.Eg.A=[2,3,6,9,1,5,7] is input then output is B=[5,15,10,12] HR-In this round they ask general questions likeTell me about urself.Ur weaknesses,strengths, hobbiesWhy persistent.etc All the best everybody ………See you in persistent.

1st interview round...... (technical round) >for NCS candidates they were asking from their branch and puzzles and some simple programs (like string related programs),,,for CS Candidates they were asking complete C & DATA STRUCTURE & DBMS etc. my questions were..... >some digital electronics Questions( like implimentation of XOR using NAND & NOR gates) >some Questions from 8085(read & wright machine Cycles, basic info about 8085...and some more question) >some questions from Optical & mobile Communication (like TIR, Benefits of OFC, GMSK, PSK & GSM / CDMA) >Two puzzles (For NCS they were asking many puzzles so practice for puzzles)

Quantitative Aptitude (15 Q) ( r.s .aggrawal..some tricky questions...)C Aptitude(10 Q)( exploring C...cracking I.T. interview TMH)English Aptitude (f.i.b)(2 Q)Probability question(3 Q)

2. Written Aptitude (Quality & Testing)this section is completely different; no references are useful; you have to be very innovative;... they judge mainly on you approach and rough work...2 questions 1 hr : 1st Questions :

An LIC company has 4 clauses (I forgot the clauses)...you have to construct a C function module or devise an algorithm to accomodate allthe clauses effectively....This was only one part of the coin... the 2nd part of the question was to analysis the feasibilty of the algorithm.. i.e. you have to give atleast 3 invalid input and devise what type of output should my program give...and reason why used this invalid input as a test input...

Similarly, you have provide atleast 7-8 valid test input, coresponding output and valid reasons.2nd Questions:A puzzle was given...21 conditions...36 (6*6) empty cells...all cells to be filled by no. from 1 to 9 ,all numbers can repeat 4 times...one condition for example is that a single no. can’t repeat in its just neighbourhood cells(row wise,column wise or diagonal wise) Tips: Don’t panic...do enough rough work analysis...again repeating ...they study only your approach..

Day 2 :1st technical interview ( a 2-member panel; a friendly gentleman and a friendly Lady) (about 20 mins) tell me abt yrself Questions on 2nd Aptitude test...inquired on our approaches difference between *++i and i++* no. squares in a chessboard (204...think carefully...it is not 8*8=64) swap two varibles without using third variable some more puzzles what do you know about software testing? what is unit metric

tip: they don’t look at your outer looks ....they only judge your technical ability...never say "I don’t Know".....always go for the questionand spend time analyzing the questions....It is NOT necessary to correctly deduce always the right answer..but everytime try to logical reason your approach to the panel...

http://www.freshersworld.com/placementweek/showpaper.asp?cid=83&pid=12961&pgcount=1&prio=14



2nd technical interview (a single person..a bit serious but encouraging gentleman) (about 45 mins) tell me abt yrself list some of your core subjects write a program to swap two variables without using third variable ( lucky to get the samequestion) wap to test three co ordinate are in same line write a program to arrange 1 to10 integers in ascending order explain some sorting algoritms using a number array 3,4,5,8,1,0,7 ( I explained Bubble sort, selection sort, and quick sort) which one of them is the fastest...why...what are their best, worst, and average complexities...give some disadvantages of Quick sort...why the best case of quick sort is of the order n*logn (with base 2).... now the discussion shifted to electronic questions....

what is modulation...derive depth of modulation for am...what are different types of modulation....what type of detection is used in am receiver...why we use local oscillator...what is the range of depth of modulation...show graphically am..what are different registers in 80858085 is 8 bit register or 16-bit register....( 8 -bit)..are you sure...then why...(data bus 8-bit)..interface a rom and a ram to 8085 microprocessor clearly indicating CS (chip select line),rd and wr lines and data bus Hr interview:the interviewer was standing ...I was seated...(i felt a bit awkward and embarrassed and was trying very hard to hide my nervousness)tell me about yrselfwhy persistenthow was our testing procedurewhat are your professional goalsdo you have any questions?tell us clearly your present corresponding address ( later ,after selections, they told that they will post the offer letter to the same address)

That was it guys...a grueling but exciting session...I was not thinking about get selcted or rejected...just focussed on clearing each and every round...this attitude helped me a lot...deliver your best, prepare for the worst.....enough gyan doses.... chill out guys....

See you at Persie, Nagpur...

persistent placement

Documents