ALLInterview.com :: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Google
   
 
 Placement Papers
 
 ACC Placement Papers ( 1 )
 Accenture Placement Papers ( 17 )
 ADITI Placement Papers ( 2 )
 Adobe Placement Papers ( 2 )
 ADP Placement Papers ( 1 )
 Airtel Placement Papers ( 2 )
 ALFANAR Placement Papers ( 1 )
 Allahabad Bank Placement Papers ( 1 )
 Alter Placement Papers ( 1 )
 AMD Placement Papers ( 1 )
 AMDOC Placement Papers ( 1 )
 ANZ Placement Papers ( 1 )
 APGenco Placement Papers ( 1 )
 AppLabs Placement Papers ( 1 )
 APPSC Placement Papers ( 1 )
 Aricent Placement Papers ( 2 )
 Arihant Placement Papers ( 1 )
 Axis Technologies Placement Papers ( 1 )
 AZTEC Placement Papers ( 1 )
 Bank Of America Placement Papers ( 1 )
 Banking Placement Papers ( 1 )
 Bently Placement Papers ( 1 )
 BFL Placement Papers ( 1 )
 Bhel Placement Papers ( 4 )
 Biocon Placement Papers ( 1 )
 BirlaSoft Placement Papers ( 1 )
 Bosch Placement Papers ( 2 )
 BPCL Bharat Petroleum Placement Papers ( 2 )
 BPL Placement Papers ( 1 )
 BROADCOM Placement Papers ( 1 )
 CA Placement Papers ( 1 )
 Cadence Placement Papers ( 3 )
 Canara Bank Placement Papers ( 1 )
 Cap Gemini Placement Papers ( 1 )
 Caritor Placement Papers ( 3 )
 Celstream Placement Papers ( 1 )
 CGI Placement Papers ( 1 )
 Changepond Placement Papers ( 1 )
 Chatargee Placement Papers ( 2 )
 Cipla Placement Papers ( 1 )
 Cisco Placement Papers ( 1 )
 CitiGroup Placement Papers ( 2 )
 CMC Placement Papers ( 5 )
 CMS Placement Papers ( 1 )
 Cognizent Placement Papers ( 2 )
 Consagous Placement Papers ( 15 )
 Convergys Placement Papers ( 3 )
 COSL Placement Papers ( 2 )
 Covansys Placement Papers ( 2 )
 CPCL Placement Papers ( 2 )
 Crompton Greaves Placement Papers ( 2 )
 CSC Placement Papers ( 3 )
 CTS Placement Papers ( 21 )
 Cummins Placement Papers ( 1 )
 Dabur Placement Papers ( 1 )
 DBSS Placement Papers ( 1 )
 DELL Placement Papers ( 4 )
 Deloitte Placement Papers ( 2 )
 Deshaw Placement Papers ( 3 )
 Dharma Placement Papers ( 1 )
 DRDO Placement Papers ( 3 )
 DST Global Solutions Placement Papers ( 1 )
 DVC Placement Papers ( 1 )
 EA Electronic Arts Placement Papers ( 1 )
 EasyTech Placement Papers ( 1 )
 Ebix Placement Papers ( 1 )
 ECMRD Placement Papers ( 1 )
 EDS Placement Papers ( 1 )
 Elvista Digital Systems Placement Papers ( 1 )
 Emerson Placement Papers ( 1 )
 Essar Placement Papers ( 1 )
 Excel Placement Papers ( 1 )
 Exilant Placement Papers ( 1 )
 EXL Placement Papers ( 1 )
 Flextronics Placement Papers ( 2 )
 Ford Placement Papers ( 1 )
 Franklin Templeton Placement Papers ( 1 )
 FutureSoft Placement Papers ( 1 )
 Genpact Placement Papers ( 1 )
 Geometric Software Placement Papers ( 3 )
 Global Logic Placement Papers ( 1 )
 Godrej Placement Papers ( 2 )
 Google Placement Papers ( 1 )
 GrapeCity Placement Papers ( 1 )
 HAL Placement Papers ( 2 )
 HCL Placement Papers ( 13 )
 HDFC Placement Papers ( 1 )
 Hellosoft Placement Papers ( 1 )
 Hexaware Placement Papers ( 2 )
 Honeywell Placement Papers ( 3 )
 HP Placement Papers ( 6 )
 HPCL Placement Papers ( 8 )
 HSBC Placement Papers ( 2 )
 Huawei Placement Papers ( 1 )
 Hughes Placement Papers ( 9 )
 i2 Placement Papers ( 2 )
 IBM Placement Papers ( 16 )
 ICICI Placement Papers ( 3 )
 Idbi Bank Placement Papers ( 2 )
 iFlex Placement Papers ( 4 )
 iGate Placement Papers ( 2 )
 IIT Placement Papers ( 1 )
 INDUS Placement Papers ( 1 )
 Infoline Placement Papers ( 1 )
 Infosys Placement Papers ( 43 )
 Intel Placement Papers ( 1 )
 InterGraph Placement Papers ( 5 )
 ITC Infotech Placement Papers ( 1 )
 itEANz Placement Papers ( 1 )
 Jaypee Placement Papers ( 1 )
 Jindal Placement Papers ( 3 )
 Kanbay Placement Papers ( 3 )
 Kirloskar Placement Papers ( 1 )
 Kotak Placement Papers ( 1 )
 Kshema Placement Papers ( 1 )
 KTS Placement Papers ( 1 )
 L&T Placement Papers ( 7 )
 LG Soft Placement Papers ( 2 )
 Lucent Placement Papers ( 2 )
 MahaGenco Placement Papers ( 2 )
 Manhattan Placement Papers ( 1 )
 Mascot Placement Papers ( 2 )
 Mastek Placement Papers ( 1 )
 MBT Placement Papers ( 7 )
 McAfee Placement Papers ( 1 )
 Mico Placement Papers ( 1 )
 Microsoft Placement Papers ( 2 )
 Mind Tree Placement Papers ( 1 )
 Miracle Solutions Placement Papers ( 2 )
 Motorola Placement Papers ( 2 )
 Mphasis Placement Papers ( 2 )
 MRF Placement Papers ( 1 )
 MTN Placement Papers ( 1 )
 Nalco Placement Papers ( 1 )
 National Instruments Placement Papers ( 1 )
 NHPC Placement Papers ( 1 )
 NIC Placement Papers ( 2 )
 NIIT Placement Papers ( 2 )
 Nokia Placement Papers ( 1 )
 Novell Placement Papers ( 3 )
 NTPC Placement Papers ( 4 )
 nvidia Placement Papers ( 1 )
 Ocwen Placement Papers ( 1 )
 ONGC Placement Papers ( 1 )
 OnMobile Placement Papers ( 2 )
 Oracle Placement Papers ( 2 )
 Oriental Bank Of Commerce Placement Papers ( 1 )
 Outsource Partners International Placement Papers ( 1 )
 Panacea Placement Papers ( 1 )
 Parle Placement Papers ( 1 )
 Patni Placement Papers ( 7 )
 PCS Placement Papers ( 1 )
 Perot Systems Placement Papers ( 3 )
 Persistent Placement Papers ( 6 )
 Philips Placement Papers ( 2 )
 Polaris Placement Papers ( 2 )
 Punjab National Bank Placement Papers ( 1 )
 QA Placement Papers ( 1 )
 Quest Placement Papers ( 1 )
 Ramco Placement Papers ( 5 )
 RBS Placement Papers ( 1 )
 Reliance Placement Papers ( 4 )
 RRB Placement Papers ( 2 )
 Sail Placement Papers ( 1 )
 SAP Labs Placement Papers ( 2 )
 Sapient Placement Papers ( 1 )
 Satyam Placement Papers ( 14 )
 SBI Placement Papers ( 1 )
 Schneider Placement Papers ( 1 )
 Scope International Placement Papers ( 2 )
 Semantic Space Placement Papers ( 2 )
 Siemens Placement Papers ( 3 )
 Sierra Atlantica Placement Papers ( 1 )
 SISL Placement Papers ( 2 )
 Slash Support Placement Papers ( 1 )
 SnapDeal Placement Papers ( 1 )
 Soft Solutions Placement Papers ( 1 )
 Sonata Placement Papers ( 2 )
 Sony Placement Papers ( 2 )
 SRM Infotech Placement Papers ( 1 )
 SSC Placement Papers ( 1 )
 SSE Placement Papers ( 1 )
 State Bank Of India SBI Placement Papers ( 3 )
 STG Placement Papers ( 1 )
 Sun Microsystems Placement Papers ( 2 )
 Sutherland Placement Papers ( 3 )
 Symphony Placement Papers ( 1 )
 synfosys Placement Papers ( 1 )
 Synopsis Placement Papers ( 1 )
 Syntel Placement Papers ( 6 )
 Taj Group Placement Papers ( 2 )
 TATA Placement Papers ( 3 )
 Tata Elxsi Placement Papers ( 1 )
 TCS Placement Papers ( 39 )
 Tech Mahindra Placement Papers ( 8 )
 Tecumseh Placement Papers ( 1 )
 Temenos Placement Papers ( 1 )
 Texas Placement Papers ( 2 )
 Thinksoft Placement Papers ( 1 )
 Thought Works Placement Papers ( 1 )
 Tibco Placement Papers ( 1 )
 TISL Placement Papers ( 8 )
 TNEB Tamil Nadu Electricity Board Placement Papers ( 1 )
 UPSC Placement Papers ( 1 )
 Value Labs Placement Papers ( 4 )
 Verifone Placement Papers ( 5 )
 Verizon Placement Papers ( 1 )
 Virtusa Placement Papers ( 1 )
 WaCYStasfZuTcrths Placement Papers ( 1 )
 Wipro Placement Papers ( 22 )
 Xansa Placement Papers ( 1 )
 Yahoo Placement Papers ( 1 )
 Yash Technologies Placement Papers ( 1 )
 ZTE Placement Papers ( 1 )
 Zycus Infotech Placement Papers ( 2 )
 
 
   
Search
 
Search ?
Advanced Search
   
   
 


 

 
Placement Papers
  PERSISTENT  PLACEMENT PAPER
 Placement Paper Submitted By :: Guest
  Reply Posted By  
 
  Re: PERSISTENT PLACEMENT PAPER
Reply
# 1
Persistent Placement Papers | Persistent Interview 
Procedure | Persistent Aptitude Questions | Persistent 
Technical Questions | Persistent Interview Questions


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

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


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

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
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 | Persistent Interview 
Procedure | Persistent Aptitude Questions | Persistent 
Technical Questions | Persistent Interview Questions

 
Guest
 
 
 
 
 


   
Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
   
Copyright 2013  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  KalAajKal.com