Forum
Resources
Mentors
Projects
Entrance Exams
Question Papers
Colleges
Courses
Universities
Schools
Make Money
Members
Bookmarks
Polls
Fresher Jobs
Funny Pictures
MCA Projects
New Member FAQ
My Profile
Sign In
Register
AdSense Revenue
Active Members
Today
pradeep
(318)
Nemish
(248)
Nitin Bajaj ...
(237)
Last 7 Days
Nemish
(3025)
prashanth beer...
(2693)
ram
(2431)
more...
Awards & Gifts
Online Exams
Aptitude Questions
General Aptitude Tests
Medical Entrance
Engineering Entrance
Bank Tests
TOEFL & IELTS Questions
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
Advertisements
Watch Asianet TV online
Kairali TV in Internet
Surya TV online
Amritha TV Channel
ADOBE PAPER - 25 FEB 2007 - NOIDA
Posted Date: 18 Mar 2008 Resource Type:
Articles/Knowledge Sharing
Category:
Placement Papers
Posted By:
ramya
Member Level:
Gold
Rating:
Points
: 4
ADOBE PAPER - 25 FEB 2007 - NOIDA
C Paper:
1. What is the difference between Char a[ ]="string" and char *a="String"
2. What is wrong with the code? The code was for conversion from Celsius to Fahrenheit : degF =5/9*(c+32)
In code this line was wrong as we want 5/9 and that to be multiplied with bracket result. But here 9 will be first multiplied with bracket result.
3. What are Data breakpoints? Give two scenarios where we make the use of this
4. What do you mean by Bit fields? Give example
5. Write the function for changing a number from hexadecimal to integer htoi(s
6. Compare two binary trees they are same or not.
7. You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other
8. WAP to find Depth of tree program. We were given the structure of the node using that we need to write the code.
9. In binary search we have two comparisons one for greater than and other for less than the mid value. Optimize so that we need to check only once
10. Question was some what like we need to write the function so that we get the two dimensional array and memory is assigned to it using malloc function. Don't remember the question exactly. But this was the only question in proper language
Engineering Paper:
I remember only 5 questions in this. A s this was taken first
1. Binary search Tree was given. Find 4th smallest element.
2. Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z
3. Represent (-5)10 in 2's complement representation in 8 bits
4. Expression was given. Draw tree and then find the postfix
5. Some commands in the assembly language were given. Then need to convert this code in assembly
A=300;
For (i=0 ; i<=10 ; i++)
A=A+200;
NOTE: NO Automata questions were asked. Good News!!!!
The engineering paper was totally based on the Data Structure, simple assembly programs implementation and some simple algorithms related to data structures. So read Arrays, Linked list, postfix prefixes inorder post order etc.
Responses
No responses found. Be the first to respond and make money from
revenue sharing program
.
Feedbacks
Popular Tags
What are tags ?
Search Tags
Sign In
(No tags found.)
Post Feedback
This is a strictly moderated forum. Only approved messages will appear in the site. Please use 'Spell Check' in Google toolbar before you submit.
You must
Sign In
to post a response.
Next Resource:
ADOBE PAPER
Previous Resource:
ADOBE PAPER - 03 SEP 2006 - MUMBAI
Return to Discussion Resource Index
Post New Resource
Category:
Placement Papers
Post resources and
earn money
!
Related Resources
HFCL Placement Paper
C Interview Questions and Answers-4
DBA interview questions part4
IBM PLACEMENT PAPERS ------ IBM placement Paper 1
APTITUDE TEST IN TCS
Contact Us
Privacy Policy
Terms Of Use
SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.