2011 Persistent Placement Papers:1. Which of the following cannot be implemented efficiently in Linear Linked Li st 1. 2. 3. 4. 5.

Quicksort Radix Sort Polynomials Insertion Sort Binary Search

2. In binary search tree , n=nodes, h=height of tree. What's complexity? 1. 2. 3. 4. 5. o(h) o(n*h) o(nLogn) o(n*n) None

3. Printf("%d%d",i++,i++); 1. 2. 3. 4. 5. Compiler Dependent 4 4 4 3 3 4 None of Above

4. void main() { printf("persistent"); main(); } 1. Till stack overflows 2. Infinite 3. 65535 4. 34423 5. None 5. If table A has m rows and table B has n rows then how many rows will the foll owing query return SELECT A.A1,B.B1 FROM A,B WHERE A.A3=B.B3 1. <=(m*n) 2. m*n 3. <=(m+n) 4. >=(m+n) and <=(m*n) 5. m+n 6. A Query optimizer optimizes according to which of Freshersworld.com the follo wing criteria 1. 2. 3. 4. 5. Execution time Disk access CPU usage Communication time None

7. Which of the following is not a characteristic of a transaction 1. 2. 3. 4. 5. Atomicity Consistency Normalization Isolation Durability

8. The def. of Foreign key is there to support 1. Referential integrity 2. Constraint 3. None 9. Problem Process A Process B WRITELOCK(X) WRITELOCK(Y) READ(X) READ(Y) ... ... 1. The problem is serializable 2. The problem is not serializable 3. It can be run in parallel 4. None 10. 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 11. One singly circular ordered list is there if M elements are to be inserted w hat will be the complexity of time a) O(M*N) b) O(M*(M+N)) c) O ((M+N) * log(M+N)) d)none of these 12. find postfix and prefix of A + B * ( C + D ) / E + F 13. Find out shortest path from A to B A A B C D E B 0 m 0 0 0 C D E m 0 2 2 m 5 6

14. From the following when 43 will not be found by binary search (a series was given with last element 43 in each) 15. From 100 999 find the prob. Of getting 3 digit no with no 7 in any of its di git a) 18/25

b) 10/25 c) 729/1000 d) none 16. 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) 17. 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 c ase a) 2 b) 6 c) 11 d) 2)On which maximum operations cannot be performed .Something like that a)Array b)Hash Table c)Linked List d)Heap e)Binary Tree 3)A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}ho w many comparisons have to be made if data is not found in the list in worst cas e a) 2 b) 6 c) 11 d) ANS:- 2 4)Forest with n Trees and having p edges then a)n(1-p) b) n = p +2 c) n-p+1 A. Computer Algorithms 1. Time Complexity 2. Which of the following cannot be implemented efficiently in Linear Linked List 1. Quick sort 2. Radix Sort 3. Polynomials 4. Insertion Sort 5. Binary Search 3. In binary search tree , n=nodes, h=height of tree. What's complexity? 1. o(h) 2. o(n*h) 3. o(nLogn) 4. o(n*n) 5. None 1. 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)) 2. 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. 1)From the following when 43 will not be found by binary search (a series was gi ven with last element 43 in each) 2)On which maximum operations cannot be performed .if we want to use abstract da ta type. a)Array b)Hash Table c)Linked List d)Heap e)Binary Tree 3)A hash table has a size of 11 and data filled in its position like{3,5,7,9,6}h ow many comparisons have to be made if data is not found in the list in worst case a) 2 b) 6 c) 11 d) ANS:- 2 Skip to content Asuku Hot Discussions Careers, Jobs & Office Print view Register Login Persistent systems latest questions Post a reply 1 post Page 1 of 1 Persistent systems latest questions by Ramesh Prabu Wed Jan 05, 2005 11:57 am Hai frnz, Here are some of the latest question papers of the persistent systems. Question1: ********* MODE: CAMPUS DATE: 22nd June 2004 COLLEGE: Government Engineering College, Aurangabad RECRUITMENT FOR: Development/Testing The test consisted of a 1hr technical objective questions and 1hr Programming test.

Tech. Qs There were six sections and each consist of 5qs. A] Computer Algorithms 1. Time Complexity 2. Which of the following cannot be implemented efficiently in Linear Linked List 1. Quicksort 2. Radix Sort 3. Polynomials 4. Insertion Sort 5. Binary Search 3. In binary search tree , n=nodes, h=height of tree. What's complexity? 1. o(h) 2. o(n*h) 3. o(nLogn) 4. o(n*n) 5. None 4. 5. B] C Programs 1. Printf("%d%d",i++,i++); 1. Compiler Dependent 2. 4 4 3. 4 3 4. 3 4 5. None of Above 2. void main() { printf("Persistent"); main(); } 1. Till stack overflows 2. Infinite 3. 65535 4. 34423 5. None 3. Swapping 4. what does it do? void f(int n) { if(n>0) { if(A[i]>A[j]) swap(); } else f(n-1); } 1. Swap 2. Sort in Ascending order 3. Sort in Descending order 4. Computes permutation 5. 5. Given a Fibonacci function f1=1;f2=1 fn=f(n-1)+f(n-2) which of the following is true?

1. 2. 3. 4. 5. C] 1. 1. 2. 3. 4. 5. 2. 3. 4. 5.

Every Second element is even Every third element is odd The series increases monotonally For n>2, fn=ceiling(1.6 * f(n-1)) None Operating System Where the root dir should be located Anywhere on System disk Anywhere on Disk' In Main memory At a fixed location on Disk At fixed location on System Disk Problem on Concurrency Problem on Round Robin Algorithm

D] General 1. If x is odd, in which of the following y must be even 1. X+Y=5 2. 2(X+Y)=7 3. 2X + Y =6 4. X+2Y=7 5. 2. 1000! How many digits? What is the most significant and Least significant digit 3. 4. 5. E] Theory 1. If a production is given S -> 1S1 0S0 00 11 Then which of the following is invalid 1. 00101010100 2. 3. 4. 5. 2. Context free grammar cannot recognize 1. if-then-else 2. var 3. loops 4. syntax 5. None 3. 4. 5. F] DBMS 1. If table A has m rows and table B has n rows then how many rows will the following query return

SELECT A.A1,B.B1 FROM A,B WHERE A.A3=B.B3 1. <=(m*n) 2. m*n 3. <=(m+n) 4. >=(m+n) and <=(m*n) 5. m+n 2. A Query optimizer optimizes according to which of the following criteria 1. Execution time 2. Disk access 3. CPU usage 4. Communication time 5. None 3. Which of the following is not a characteristic of a transaction 1. Atomicity 2. Consistency 3. Normalization 4. Isolation 5. Durability 4. The def. of Foreign key is there to support 1. Referential integrity 2. Constraint 3. 4. 5. None 5. Problem Process A Process B WRITELOCK(X) WRITELOCK(Y) READ(X) READ(Y) ... ... 1. The problem is serializable 2. The problem is not serializable 3. It can be run in parallel 4. 5. None PROGRAMMING SECTION This consisted of Two programs to be solved in 1 hour. Q1. A sparse matrix is a matrix in which a node with val=0 is not represented. The whole matrix is represented by a Linked list where node typedef struct Node { int row; int col; int value; sparsematrix next; } Element, *sparsematrix; The problem is, if there are two matrix given suppose m1 and m2, then add them and return the resultant sparsematrix. Q2. If suppose there are N functions say from 0,1,2,... N-1 and it's given that A[i][j]=1 if the function i contains a call to func. j otherwise

A[i][j]=0, then write a function that will form groups of related functions and print them line by line and at the end print the number of total groups. Bye Rohit Agrawal BE-IT2004 Govt. Engg. College, A'bad question2 : ********** MODE : Centralized university Campus. DATE: 27 th Aug 2004 Place : BHOPAL 1. Data Structures I don't remember much from this section 1. Given a Fibonacci function f1=1;f2=1 fn=f(n-1)+f(n-2) which of the following is true? 1. Every Second element is even 2. Every third element is odd 3. The series increases monotonally 4. For n>2, fn=ceiling (1.6 * f (n-1)) 5. None 2. From the following when 43 will not be found by binary search 2 C programming 1. Question based on concept of declaration and definition of variables like what allocates space and when the type is defined. 2. # define square(x) x*x a=10 b=20 printf("%d", square(a+b)); tell the output: I think the snswer is 230 as ( 10 + 20 * 10 +20 ) = 230 [apply operator precedence] 3. question on pointers as int *a[5]; then what will point to 2nd element of array 1. &a[2] 2. a[a+1] 3. a[a+2] 4 5 4. 5. 3. Operating Systems:

1. A critical section is ans a set of instruction which is shared by many proceeses 2. Processes a,b,c,d,e repeats after 2 cycles, b after 4 cycles, c after 8 cycles and d after 24 And was asked the output options were 1. the process repetes pattern after 27 cycles 2. the process will proceed in abcbbbaabb 3. the process will proceddas abbcbbabbcad 4. I have just written the option to suggest u the answer the options are not correct. The data in this question is not exact 3. Similar to above a table with time consumption of process was given and processes along with periods were given and was asked to determine the working. I don't remember. 4. 5. Section 4 DBMS This was very simple 1. a SQL query was given on a table having name and date of birth and in the query MAX operation on date was applied and it was asked to tell the output I remember only 2 options which I felt to be the probabe answer a. the o/p will be name and date of birth of people oldest in staff b. the o/p will be name and date of birth of people youngest in staff 2. Section 5 Theory 1. 1. 2. 3. 4. 5. Context free grammar cannot recognize if-then-else var loops syntax None

2. A question on networks based o header length and data bits were provided and if the more header is added [no. of bits were provided] and then it was given that only 800 bits can pass through then what will be the number of packets . 3. A question on probability was given as 3 probabilities 0.5, 0.6, 0.4. Now determine the minimum probability of occurance of event. Ans 0.5 as 0.5+0.4+0.6 / 3 4. 5. Section 6 GENERAL

1 2 3. Some numbers with many operations were given like [ 3086*(867+234) *786(453 + 876) ] and number of One's [ 1 `s ] were asked. The data is not exact here options were a. 9 b. 11 c 21 d e I think it has to do with some binary values and then will telll the number of 1's can't crack this logic. Friends told me the answer is 9. 4. Find the prefix & postfix notation for a given infix _expression (a + b - c) * (e / f) - ( g - h/i) ANS=ABCD+*E/+F+ 5. 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) 9/10 MY COMMENTS: The paper is not easy to crack as they set very high cut off and most of the students get papers like this one and directly answer 67 questions. In the paper try to attempt as many questions right as possible as there is no upper cut off and negative markings. As I said please do solve the questions in the question papers available on internet as, many question with as it is data are repeated. Verify all the answers of all question papers especially probability ones and directly mark them there in test. Most probably the questions will repeat. In Bhopal only 27 were short listed in first objective test out of 500 and those 27 were asked to appear in 2nd programming test out of that only 4-5 finally made it to job offer. Please solve these questions before going for test and also implement the programs available on other papers. ALL THE BEST. This company needs full technical guys very tuff to work with and also difficult to get into it. Second programming test Again the programs are repeted here as available on other papers on net. 1. 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 1 2 2 1 Use

2 1 1 the concept of Fibonacci series & u crack it easily.

2. Addition of two sparse matrics implemented by LINKED LISTS. question3: ******** Hi friends, I see that a lot of people are asking about the persitent test pattern, I attend ed the test on 9th, here is what i have to say::::: objective test:1 hour(same patterns as the previous tests) First take all the previous objective test papers in chetana grp and study them go through all the questions and you will definitaly clear the objective..(IMP---not only the answers but also how you got the answers as they will ask in inte rview how you got to the answer) Programming test--1 hour two prgrams 1.C program for right shift.. Eg:::abcde(right shift 2 loc..)-->cdeab 2.you have to write a C fn which accepts prts to 2 strings and return the locati on where the second string occurs in the first one... Eg::abcde, cd---->>> then the fn returns 3 Interview(mine was for 2 ours, got out on this one)::: 1.program for reversing a sentence eg: ram is a good boy--->>mar si a doog yob ,,also convert to ---->>boy good a i s ram 2. they asked me abt trees-heaps, heap traversal etc Sorting, types , complexity of sorting... Its like you cant hide from the interview guys if you are not proficient in any fields... 3. about project in CV, c and c++, OS etc...

I think that it will help you guys a lot Best of luck question4: ********* Dear friends, Persistence system came to INDORE for freasher recruitments on 15th jan 2004 I also appeared for the test and now I am waiting for the result which will be d elared on20th jan. So, I am sending the questions (based on memory). THERE ARE TWO ROUND OF WRITTEN. IN THE 1ST ROUND it was objective which consists of 6 sections AND EACH SECTION

HAS 5 QS. Duration 1hour 1ST SECTION:( DATA STRUCTURE) 1. question from binary search tree ans(250) 2. 3. hash table problem ans(5) 4. adjacent matrix to calculate shortest path ans(7) 5. 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 argume nts (ans 6) 3. 4 recursion function to calculate fun(4,9)( ans e) 5 problem from strcmp

3rd SECTION(O.S) 1. 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) 5 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 coun t(*)=(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 4. 5

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) 3 4 5 S->1S1 S->00 S->11 S->0S0 Option are (a) 00100100 {b) 110010001(c) I don t remember

6th SECTION (GENERAL COMPUTER) 1 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 a lso 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) second round is vey important for getting selected. Please any body has PCS QUESTION DO SEND ME . It is arriving to our campus in last week of jan. ALL BEST KUMARESH question5: ********* Persistence paper 2004 1-> operating system 1 . if there r n proceses and each process waits p time in waiting state then cp u 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 al gorithm 3. there is a file server which provides locking for mutual exclusion . if any p rocees locks the file and abruptly terminated this will result in indefinitely l ocking .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. OTHERS 6. there was a question on automata ans the resultant string will have even no of c 7.CFG was given S -> 1 S 1 S-> 0 S 0 S -> 1 1 S -> 0 0 Find out the string 8 One singly circular ordered list is there if M elements are ti be inserted wha t will be the complexity of time a) O(M*N) b) O(M*(M+N)) c) O ((M+N) * log(M+N)) d) 9. find postfix and prefix of A + B * ( C + D ) / E + F

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

Where m is infinity 11 from the following when 43 will not be found by binary search (a series was given with last element 43 in each) 12. from 100 999 find the prob. Of getting 3 digit no with no 7 in any of its digi t a) 18/25 b) 10/25 c) 729/1000 d) 13. from the set {a,b,c,d,e,f} find no of arrangements for 3 alphabet with no da ta repeated

14. 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 d)

Employee = { e_no , salary, fname, lname} Works_On = {e_no, p_no, hrs} Project = {p_no, p_name} 15.select e_no from Employee where salary = salary a) query invalid b) 16. select fname ,lname from Employee where e_no in (select e_no from works_on w here p_no =(select * from project)) a) name of Employee who works on all project b) c) d) 17. B tree is different from other a) has fixed index file size b) is better for queries like < <= > >= c) searching will be easy d)

18.func(char *s1,char * s2) { char *t; t=s1; s1=s2; s2=t; } void main() { char *s1= Losers say that it is possible but it is difficult Winners say that it is difficult but it is possible User avatar Ramesh Prabu Grasshopper Posts: 56 Joined: Mon Sep 06, 2004 8:08 pm Location: Nellai Top Post a reply 1 post Page 1 of 1 Return to Careers, Jobs & Office Jump to: Who is online Users browsing this forum: No registered users and 0 guests Board index All times are UTC + 5:30 hours 2000-2011 Asuku. Privacy Policy Time : 0.088s | 15 Queries | GZIP : Off Category SubCategory Location Company About Persistent:Persistent work with its customers to help them proficiently deliver products to their end-users and ultimately, to maximize their core business. Persistent's o utsourced software product development services allow its customers to minimize Time-To-Market, perk up the quality of their products, trim down risk of failure during the engineering development process, improve predictability and reliabil ity of the engineering process while helping them minimize their over-all produc t engineering costs. Persistent has invested in structuring a gigantic team of software engineers, ve terans in product development culture. Persistent's team of industry specialists has an understanding of the industries in which its customers operate and the c IT Post Resume for Latest Jobs Placement Papers Pune Persistent

ompetencies that they necessitate. It has competency centers in telecom and wire less, life sciences, analytics and data infrastructure, embedded systems domains , product engineering and Microsoft and Java platforms. Why Persistent - Why shoul i join Persistent?:Persistent extremely cohesive and close-knit. It open communication promotes an easy exchange of views and information. Seniors and juniors share a good rappor t and transparency, and the entire organization works together as a single, larg e team. At Persistent, you will come face to face with a vault of opportunities, the key to which will be the various projects assigned to you. Your tasks will challeng e your abilities and force you to break out of the mold, constantly pushing you to achieve more. Contact Details Address of Persistent:Persistent Systems Limited Persistent Systems, Inc. Bhageerath, 402, Senapati Bapat Road Pune 411016. Tel: +91 (20) 2570 2000 Fax: +91 (20) 2567 8901 Apply Now Click Here to Apply Now! Posted date Sunday, February 13, 2011 1) From the following when 43 will not be found by binary search (a series was given with last element 43 in each) 2) On which maximum operations cannot be performed .Something like that a) Array b) Hash Table c) Linked List d) Heap e) Binary Tree

3) 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 w orst case a) 2 b) 6 c) 11 d) ANS:- 2 4)Forest with n Trees and having p edges then a)n(1-p) b) n = p +2 c) n-p+1 d) e) 5)Find the shortest path from B to E ANS: 7 one Question on Postfix. 2ndSECTION (C LANGAUGE)

1) what is int(*(*ptr (int))(void) a)Pointer to function with no arguments(void) and return pointer to integer. b)---c) 2)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 3) void main() { int a[5] ={1,2,3,4,5},i,j=2,b; 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; b= b+2; } OUTPUT: 12345 4) void 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) ANS: 5050 5)A tree was given with nodes assigned clours red, blue, yellow, green and more that one node is having colour red.They have asked that how many times the o utput will be red if the total number of evaluation is 11. some code was given--I don't remember that.

3rd Section(O.S) 1) If there are n proceses and each process waits p time in waiting state then c pu utilization is-: a) n(1-p) b) n*p 2)No. of pages are given and using LRU algorithm we have to find the number of page faults. a)2 b)6 c)5 d)7 3)There is a file server which provides locking for mutual exclusion . if any pr ocees 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 termin ate 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) will allow the concurrent process to access the file. 4)A critical Section is a)for mutual exclusion b)a set of shared resources c) d) 5)Match the following. 1)Critical Section 2)Wait/signal 3)Working set 4)Semaphore 4th Section(TOC) 1)There was a question on automata 2)CFG was given S -> 1 S 1 S-> 0 S 0 S -> 1 1 S -> 0 0 Find out the string 3) 5th section General 1)Probability to find digits which not contain 7 between 100 to 999 Ans=18/25 2)Difference between Packet switching & Circuit Switching. Ans= CS take more time to established circuit. 3)in cache memory 100ns an in main memory 1200ns what is the cache hit ratio(Que a)Mutual exclusion b)Deadlock c)Hoare's Monitor d)

stion is not exactly the same,but something

related to cache hit ratio)

4)From the set {a,b,c,d,e,f} find no. of arrangements for 3 alphabets with no da ta repeated. ANS=360. OR for 4 alpha ANS=720. 5) 6th section (DBMS) 1)employee(eno,ename) works_on(eno,pno,ename) project(pno, project) select ename from employee where eno in(select eno from works_on where pno =(s elect *from project) what is the output ? a)Employee who works on all project. b)Employee who works one project . c) name of employee who works on more than one project. d) 2)Select ename from employee where salary = salary 3)what is the use of B-tree a) has fixed index file size b) is better for queries like < <= > >= c) searching will be easy d) 4)Question on inner Join returning N- tuples & Full outer Join returns M- tuples . For both Variables are given & in options relationship is given to find wh ichever have greater tuples.And variable D is given-----a)then N= M b) N = M + D c) d) 5) To save space which option is better a) write all join operation then select then project b) write all join operation then projects then select c)write all join operation then select between project Test 2- Consist of Two Questions. In this we have to make a C program. Q.1) Inward-spiral order matrix. i.e you have to traverse the matrix in clockwise manner and display the elements , for eg. 1 8 9 2 2 9 7 3 5 7 6 5 4 1 3 8

output should be 1, 2, 5, 4, 1, 3, 8, 5, 3, 2, 9, 8, 9, 7, 6, 7 Q.2)

consider a two dimensional array A[N][N] of the order n x n.Then you find the su b-squares and display the largest sum of the sub-square.Sub- squares are the con tigious elements in the array.Largest sum can be find out by summing the element s in the sub-square. Aptitude:

consists of 2 sections.1-quantitative,2-'c'questions.apti is separate for electr onics & computer ,IT. so don't worry apti is of 30 marks out of which 25 marks o n 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.some questions from apti which i remember are .find output of following 1.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("\t%d",fib(i)); } getch(); } fib(int n) { if (n= =0)

{ return 0; } else if(n= =1) { return 1; } else return (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 gettin g length of stick more than 3:1

TR1In this section they ask the questions on 'c',microprocessor(if u mention in int roduction as a field of interest),'c++' some questions are like 1.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 us ing 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.

TR2In this section they give 3 programs u have to do that program they ask any typ e of program for me they ask the programs like1. multiplication of two nos.in 8085 microprocessor 2. 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 in put 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 not 4.if an array is given find the addition of two successive elements and print t his addition in another array. Eg.A=[2,3,6,9,1,5,7] is input then output is B=[5,15,10,12] 1. A Query optimizer optimizes according to which of Freshersworld.com the follo wing criteria 1. 2. 3. 4. 5. Execution time Disk access CPU usage Communication time None

2. Which of the following is not a characteristic of a transaction 1. 2. 3. 4. 5. Atomicity Consistency Normalization Isolation Durability

3. The def. of Foreign key is there to support 1. Referential integrity 2. Constraint 3. None 4. Problem Process A Process B WRITELOCK(X) WRITELOCK(Y) READ(X) READ(Y) ... ... 1. The problem is serializable 2. The problem is not serializable 3. It can be run in parallel 4. None 5. One singly circular ordered list is there if M elements are to be inserted wh at will be the complexity of time a) O(M*N) b) O(M*(M+N))

c) O ((M+N) * log(M+N)) d)none of these 6. find postfix and prefix of A + B * ( C + D ) / E + F 7. Find out shortest path from A to B A A B C D E B 0 m 0 0 0 C D E m 0 2 2 m 5 6

8. From the following when 43 will not be found by binary search (a series was g iven with last element 43 in each) 9. it a) b) c) d) From 100 999 find the prob. Of getting 3 digit no with no 7 in any of its dig 18/25 10/25 729/1000 none

10. 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) 11. 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 c ase a) 2 b) 6 c) 11 d) 12. There was a question on automata ans the resultant string will have even no of c 13. CFG was given S -> 1 S 1 S-> 0 S 0 S -> 1 1 S -> 0 0 Find out the string 14. Which of the following cannot be implemented efficiently in Linear Linked L ist

1. 2. 3. 4. 5.

Quicksort Radix Sort Polynomials Insertion Sort Binary Search

15. In binary search tree , n=nodes, h=height of tree. What s complexity? 1. 2. 3. 4. 5. o(h) o(n*h) o(nLogn) o(n*n) None

16. Printf("%d%d",i++,i++); 1. 2. 3. 4. 5. Compiler Dependent 4 4 4 3 3 4 None of Above

17. void main() { printf("persistent"); main(); } 1. Till stack overflows 2. Infinite 3. 65535 4. 34423 5. None 18. If table A has m rows and table B has n rows then how many rows will the fol lowing query return SELECT A.A1,B.B1 FROM A,B WHERE A.A3=B.B3 1. <=(m*n) 2. m*n 3. <=(m+n) 4. >=(m+n) and <=(m*n) 5. m+n