JobsAssist.com - Jobs Resources & Placement Papers
Get Vyom Interview Success Kit Now!
» Now 9,000 Questions & Answers !!
» 10,000+ Pages | Written by 58 Subject Experts | 81 Question Categories
» Every Successful Candidate has this!
Special

Click here to register on India's Fastest growing Job site.

Main Menu

JobsAssist Home Home
 Freshers Jobs Freshers Jobs
Latest Freshers Jobs Latest Jobs
Add Freshers Jobs to My Yahoo My Yahoo!
Free Vyom Career Magazine Free Career Mag
 IT Companies Placement Papers IT Placement Papers
 Govt. Sector Companies Placement Papers Govt. Sector Papers
 5000 IT Companies Directory IT Directory
 Free Magazines Free Magazines
 Consultants Directory Consultants
 Training Institutes Directory Training Inst.
 Interview Questions Interview Questions
 Motivational Quotes Motivational Quotes
 Call Center Information Call Center Info
 Final Year Projects Final Year Projects
 Jobs Discussion Forums Jobs Forum
 Vyom Resume Submitter Resume Submitter
 Free Resume Builder Downloads Free Resume Builders
 Contact Us Contact Us


Resume Submitter

Vyom Network
    Vyom Resources
    Source Codes
    Online Exams
    Discussions World
    Free eBooks
    20,000 Downloads

HOT Resources
Free Career eMagazine


Search JobsAssist
Google




Welcome to JobsAssist - Single Stop for Complete Career Resources

Home » Placement Papers » Persistent Placement Papers »Persistent Placement Paper 6
Join VYOM-JOBS and receive latest 2008 Placement Papers for FREE

 

Persistent Placement Paper 6


Error iconIf you are looking for guaranteed success in your next interview, get an ebook, that contains all the possible Interview Questions.

CLICK HERE TO GET VYOM INTERVIEW SUCCESS KIT TODAY!

Contains over 9,000 solved Interview Questions asked in most MNC interviews.

Receive Genuine Job Information & latest Walk-in details in your mailbox everyday! Join our Yahoo! Group by entering your email in the form below:



(For Example: Software Testing Jobs, BPO Jobs, J2EE Jobs, etc.)




Persistent Sample Test Paper.

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.

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)







Join VYOM-JOBS and receive latest 2008 Placement Papers for FREE


Privacy Policy | Terms and Conditions
Vyom Network : Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | Delhi Info | Jobs, Discussions | Placement Papers | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | Arabic, French, German | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Web Hosting | Software Testing | Send Free SMS

Domain Registration | Windows Hosting | Linux Hosting | Java Hosting | Virtual Dedicated Server | Dedicated Server | Reseller Web Hosting | Unlimited Windows reseller hosting | Unlimited Linux reseller hosting | Cheap Windows reseller hosting | Cheap Linux reseller hosting | Cheap Windows hosting | Best Windows hosting | Windows hosting Multiple Domains | Unlimited Windows hosting | Compare hosting plans | Cheap Linux hosting | Best Linux hosting | Linux hosting Multiple Domains | Unlimited Linux hosting | Cheap asp.net hosting | Best asp.net hosting | unlimited asp.net hosting | Cheap asp.net reseller hosting | Unlimited asp.net reseller hosting | Java Features | Cheap Java hosting | Best Java hosting | unlimited Java Hosting | Unlimited Linux reseller hosting | Java Hosting Multiple Domains |


Placement Papers | Screensavers
Copyright ©2003-2018 JobsAssist, All Rights Reserved.
Page URL: http://www.jobsassist.in/placementpapers/persistent-placement-paper-2.asp

Download Yahoo Messenger | Job Interview Questions | Software Testing Tutorials | Winrunner Tutorial | Test Director Tutorial | C++ Projects