IndiaBIX.com
Arithmetic Aptitude Data Interpretation
Logical Reasoning Verbal Reasoning Non Verbal Reasoning
General Knowledge
Sudoku Number puzzles Missing letters puzzles Logical puzzles Playing cards puzzles Clock puzzles
C Programming C++ Programming C# Programming Java Programming
Microbiology Biochemistry Biotechnology Biochemical Engineering
Civil Engineering Mechanical Engineering Chemical Engineering Networking Database Questions Computer Science Basic Electronics Digital Electronics Electronic Devices Circuit Simulation Electrical Enigneering Engineering Mechanics Technical Drawing
Placement Papers Group Disucssion HR Interview Technical Interview Body Language
Aptitude Test Verbal Ability Test Verbal Reasoning Test Logical Reasoning Test C Programming Test Java Programming Test Data Interpretation Test General Knowledge Test
Data Structures Operating Systems Networking DATABASE Database Basics SQL Server Basics SQL Server Advanced SQL Server 2008 JAVA Core Java Java Basics Advanced Java UNIX Unix File Management Unix Memory Management Unix Process Managemnt C Interview Questions The C Language Basics .NET Interview Questions .NET Framework ADO.NET ASP.NET Software Testing

Companies

Placement Papers - Adobe

@ : Home > Placement Papers > Adobe > View Paper
ADOBE PATTERN - 27 JUL 2009 - KOLKATA
Rated : +47 , -26
Hi Friends

Adobe came to Jadavpur University on July 27, 09. Following is the test pattern:

1. Aptitude: 45 minutes
   45 questions in total. Refer R.S Agarwal or CSR.
   15 questions from analytical.
   30 questions from quantitative aptitude.
   No test on English language.

2. Subjective questions.
  10 questions: 30 minutes.
  10 questions: 45 minutes.

The paper comprised of the following topics:

1. Algorithm analysis.
   Finding time complexity of a program written in pseudo code.
   Writing 1 pass algorithms for sorting with some given constraint(s).
   
2. Microprocessor.
   Use of 5-6 mnemonics only and 3 registers we are asked to write a program.

3. C-language.
   String operations without using standard string library functions.

4. Automata theory.
   One nfa was given to accept bbb. We are to find a fsm that will accept aabb.
   One fsm was given finding the number of string that it can accept.
   The questions was little bit tricky but if prepare well for GATE examination,
   this examination is quite suitable for you.

9 Cleared the written.




Like this?   +47   -26



© 2008-2013 by IndiaBIX™ Technologies. All Rights Reserved | Copyright | Terms of Use & Privacy Policy

Contact us: info@indiabix.com     Follow us on twitter!