.
  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 06 MAY 2006 - PATIALA

 

PERSISTENT PATTERN - 06 MAY 2006 - PATIALA


Advertisements
Advertisements

 PERSISTENT PATTERN - 06 MAY 2006 - PATIALA

May 06 2006, PTU Joint Campus Placement at Chitkara Institute of Engg and Tech.

Those guys will give u the same paper. They haven't changed it since July 2, 2001... coz that was the date written on top of every sheet! There's no negative marking in this paper.
 
The programming section differed as given in that paper and my paper had 3 questions. All were based on a graph whose Adjacency matrix was given. The graph consisted of various cities of india and it told about the various air routes existing among the cities. The programming has to be done in C, its mentioned there. 
 
1) 5 fill in the blanks. A code with empty blanks and comments was given and we had to fill in the code based on those comments. Its easy, even if u have the basics right.
 
2) Had to write a function which printed the city with max and min connectivity and took only the adjacency matrix as its argument. Very simple, just sum the values in the row, then print the cities having max and min values u just calculated.
 
3) The graph was modified in this question and the edges were assigned weights. We had to write a function which printed the cities having the heaviest edges connected to them and also their weights. You should know how to make the weight matrix for this question...
 
tip: guys at Persistent like Trees, Graphs and Matrices.

(Paper Submitted By : Dev Ghai)
   

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