.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews





Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.

New Click here to Download 2024 Latest placement papers of this company New

Home » Placement Papers » Persistent Placement Papers »Persistent Placement Paper 5

 

PERSISTENT PATTERN - 21 FEB 2004


Advertisements
Advertisements

The paper consists of 2 test.
Test 1 -- consists of only technicalobjective questions, It has six sections & each have 5 Qns.
THe sections are --
1. C Programming( in which some C Qns are there)
2. Theory ( Qns from Compiler toc etc.)
3. General( Qns from probability etc.)
4. OS(Qns from OS, like 5 processes are given with their burst & some scheduling policy is also given, now find out when process P is completed)
5. Database ( Qns from Normalisation, Transactions etc)
6. Data Structures

Qns are pretty simple. one Knowing only the basics can be able to clear the exam. Just go through C language part in some detail.

Test 2--- Consist of only 1 Qn for program. In this we have to make a C program.
Qn is that there is a binary tree , a node having three pointers -- Left child, right child, parent. Now the problem is to delete the tree in top-down fashion ie First delete parent & then child.

In previous paper, the Qn ask in this section is that---
To take a string from the User & then arrange the characters in that string in ascending order like if user enters "babcac" the program should print it as "aabbcc"

The test is very simple just go thru the basics of OS, DBMS & data structures. & concentrate over C programming. It is very essential.

New Click here to Download 2024 Latest placement papers of this company New




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2024 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy