16-05-2012, 11:02 AM
Persistent Placement Question Papers
(www.entrance-exam.net)-Persistent Placement Question Papers.doc (Size: 31.5 KB / Downloads: 69)
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.
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.
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)
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 aababbbcba