Interview Questions Answers.ORG
Interviewer And Interviewee Guide
Interviews
Quizzes
Home
Quizzes
Interviews Basic Job Interviews:AbilitiesAbroad JobsActivistAmbitionAnalyticalAptitudeAptitude KnowledgeAssertivenessAuthority / DecisivenessBasic CommonBasic Salary RequirementsBehavioralBehavioral BasedBody LanguageBusiness intelligenceCandidate Selection CriteriaCareer StatementsCareers FutureCaseCitizenshipCommunication SkillsComputer BasicsComputer securityConfidence BuildingConflictCorporate CommunicationCreativeCreativityCurrent Affairs 2009Current Affairs 2010Current Affairs 2011Dangerous JobsDecision MakingDetail SkillsDeterminationDifficultDream JobEmployers To AskEntry LevelEthicsExitFace to FaceFailuresFlexibilityFollow UpFrequently AskedFreshers GraduateFunnyFunny QuotesFuture Career PlanningGeneral KnowledgeGeneral SkillsGood EmployeeGood LeaderGraduationGroupGroup DiscussionsHackingHandle StressHard WorkerHotel TourismHow to AnswerIllegalIncidentInitiativeInitiative WorkplaceInteresting CareerInterestsJobJob AttireJob AwarenessJob DemotionJob Follow Up LetterJob KnowledgeJob PerformanceJob ProtocolJob Search TacticsJob TipsJudgmentLearning SkillsLinkedIn RecommendationListening SkillsLogicalMannersMental AttitudeMid LifeMost Inspiring JobsMotivationNegotiate Pay RaiseNegotiation SkillsNo ExperienceNo Work ExperiencePanelPart Time ContractPatiencePay PackagePersonalPersonality TraitsPhonePlacement AssistancePost GraduatePotential EmployeePresent JobProblem SolvingProblem Solving SkillsProhibitedProjectsPuzzlesQuality On TimeQuantitativeQuantitative AptitudeRecession Proof JobReferencesResignationResume FormatResume HelpResume ObjectivesResume Skill SetSalarySalary NegotiationSecond InterviewSecond RoundSecretarySelf AssessmentSelf WorthinessSituationalSkypeStatics ProbabilityStrange JobsTargeted SelectionTeamworkTeamwork MotivationTechnology SkillsTeenTelephone OperatorTelephonicToughTraining AdviceTrickyTypicalUnusualVideoVisaWarm UpWeaknesses and StrengthsWork EthicsWork HistoryWorkplace FlexibilityWritten Skills
Copyright © 2018. All Rights Reserved
Placement Assistance Interview Question:
Adobe Placement Papers Questions:
Submitted by: AdministratorIt had 4 sections(2 1/2 hrs)
1. Analytical Aptitude: 15 mins 15 Qs
2. Quantitative Aptitude: 30 mins 30 Qs
3. Engineering Test :13 Qs, 1 hr
4. C/Java Test 15-20 Qs, 45 mins
The first 2 are ultra-cool, no probs at all.
The fun starts with the third one:
Those thirteen questions are completely based on your problem solving capacity:
There are questions based on data-structures like
-height of a tree,
-finding second largest number in an array
-questions using finite automata
- write a pgm to find whether a m/c is little endian or big endian
- lots on bit-wise manipulation
i could answer 8 out of 13 qs very well.
The 4th test on C/Java(i took C): is almost the same as the third one with questions like
- print a number in hexadecimal format without using sprintf
- optimise the computations in the recursive "nth fibonacci number" algo without using iteration(fairly simple)
"Instead of using return(fib(n-2)+fib(n-1)), use init lofib=0,hifib=1, start with n=2,lofib=hifib;hifib=fib;fib=lofib+hifib"
-given any number say 12, find the next multiple of 8 eg 16 using bit-wise manipulations.
-exchange the integers in a matrix across the secondary diagonal(or non-major diagonal)
i tried hard but couldn't get a common formula for all cases.
and many more. No data structures book can directly help.
one should have very good capacity to solve problems in a very efficient manners.
One drawback about the test is that it is very lengthy.
They could have kept some qs for the interview. Nobody can attempt 28 programs in 1 hr 45 mins
Submitted by: Administrator
1. Analytical Aptitude: 15 mins 15 Qs
2. Quantitative Aptitude: 30 mins 30 Qs
3. Engineering Test :13 Qs, 1 hr
4. C/Java Test 15-20 Qs, 45 mins
The first 2 are ultra-cool, no probs at all.
The fun starts with the third one:
Those thirteen questions are completely based on your problem solving capacity:
There are questions based on data-structures like
-height of a tree,
-finding second largest number in an array
-questions using finite automata
- write a pgm to find whether a m/c is little endian or big endian
- lots on bit-wise manipulation
i could answer 8 out of 13 qs very well.
The 4th test on C/Java(i took C): is almost the same as the third one with questions like
- print a number in hexadecimal format without using sprintf
- optimise the computations in the recursive "nth fibonacci number" algo without using iteration(fairly simple)
"Instead of using return(fib(n-2)+fib(n-1)), use init lofib=0,hifib=1, start with n=2,lofib=hifib;hifib=fib;fib=lofib+hifib"
-given any number say 12, find the next multiple of 8 eg 16 using bit-wise manipulations.
-exchange the integers in a matrix across the secondary diagonal(or non-major diagonal)
i tried hard but couldn't get a common formula for all cases.
and many more. No data structures book can directly help.
one should have very good capacity to solve problems in a very efficient manners.
One drawback about the test is that it is very lengthy.
They could have kept some qs for the interview. Nobody can attempt 28 programs in 1 hr 45 mins
Submitted by: Administrator
Copyright 2007-2024 by Interview Questions Answers .ORG All Rights Reserved.
https://InterviewQuestionsAnswers.ORG.
https://InterviewQuestionsAnswers.ORG.