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


Home » Placement Papers » SAPLAB Placement Papers » SAPLAB Placement Paper 2

 

SAPLAB Placement Paper 2


Advertisements
Advertisements

This paper was quite different from the previously stated ones. 2 sections only. 30 mins each. No negative marking. (although the page said -0.25... i was informed by the stupid guys when i was on the 2nd section!!!!!!) All questions on a single scroll down page. No RDBMS!!!! Once the first 30 mins are over u ca't go back to the previous section. Section 1 : Logical Reasoning (only 2-3 questions on %age,etc very simple) 30 questions/30 Mins. 1.(easy) ABCDEFG are lessons... they need to be taught according to some 5-6 given conditions .... a) Which is the correct order? b)Which lesson is a must if only 4 need to be taught. 2.(easy)Two politicians...winner % votes recd of total votes...? 3.Batsman...average runs in first innings... (lengthy question). 3 or 4 questions on Sufficiency.. (a lil tricky) 5 questions on replace the mathematical operators and evaluate... (Do we use BODMAS here???) Basically all the questions very easy... i f u preapred for CAT even for just 1 month u'd get thru. But the questions were very much not solvable in 30 mins.. Section 2 : Technical (Algorithms/GraphTheory/C) 30 questions/30 mins 2-3 code snippets were given.. had to choose the correct algo complexity (big O) 1 code completion snippet on DFS (depth first search) (very easy) 1 question where graph was drawn.. had to choose the shortest path!! (childs play!!!) Q) const can be used with a)array b)identifirer c)array argument d)all Q) Find the incorrect statement : ans : dynamic allocation is done at compile time. (false) Q)same ques repeated twice " what does adjacency matrix show?" Q) 2-3 questions on prefix/postfix/infix conversion. (easy) I finished the second section with 4 mins to spare. It was very easy. But the first was too lengthy and frustrating...besides they din tell me soon enough that there was no -ve marking. All the Best




 


.

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