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 3
Join VYOM-JOBS and receive latest 2008 Placement Papers for FREE

 

Persistent Placement Paper 3


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 paper(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 arguments (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 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
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 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)
second round is vey important for getting selected.




 

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

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