ADOBE PATTERN

sridhar · 03-02-07, 05:55 PM

ADOBE PATTERN

ADOBE PATTERN - MAY 2006

There were four section:
1. Aptitude: They had fairly simple arithmatic question, questions on geometry and questions like whether information can be deduced from the comments given. It was fairly easy and jst u need to have basic clear.
2. Analytical: Questions like pattern matching, odd one out were there.
Be careful while attempting these two sections that u wont be having much time. Before u know the time is over.
3. Computers: This paper is mostly from the topics u cover in B.Tech.
there was one question on finite automata,Bit manipultaion(flipping the bits),
drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of external nodes.
4. C/Java: Here u had to write C programs(Mind u no mutiple questions).There was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of complextity log n, implement atoi function.(U cannot use any standard function in these.)

03-02-07, 05:55 PM	#1 (permalink)
sridhar Super Moderator Join Date: Feb 2006 Age: 25 Posts: 4,551 Thanks: 25 Thanked 347 Times in 219 Posts Thanks: 25 Thanked 347 Times in 219 Posts Rep Power: 0	ADOBE PATTERN ADOBE PATTERN ADOBE PATTERN - MAY 2006 There were four section: 1. Aptitude: They had fairly simple arithmatic question, questions on geometry and questions like whether information can be deduced from the comments given. It was fairly easy and jst u need to have basic clear. 2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections that u wont be having much time. Before u know the time is over. 3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata,Bit manipultaion(flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of external nodes. 4. C/Java: Here u had to write C programs(Mind u no mutiple questions).There was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of complextity log n, implement atoi function.(U cannot use any standard function in these.)

Thread Tools
Show Printable Version Email this Page
Display Modes	Rate This Thread
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode	Rate This Thread:

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
ADOBE 2006 Placement paper 2	sridhar	ADOBE Placement Papers	0	03-02-07 05:54 PM
ADOBE 2006 Placement paper 1	sridhar	ADOBE Placement Papers	0	03-02-07 05:54 PM
Accenture pattern	sridhar	ACCENTURE Placement Papers	0	03-02-07 05:11 PM
Adobe warn users of security bugs in Acrobat	yathish	Chit Chat Zone	1	16-01-07 09:30 PM
Development and testing Opportunities at ADOBE Systems	sridhar	EXPERIENCED JOBS	1	22-07-06 01:52 AM

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)