A
Group Of

fresher-interview-software-jobs-freshers-job-engineers-jobs-career-job-walkin-interviews
fresher-interview-freshers-job-engineers-jobs-career-job-walkin-software-interviews
 




Company-Questionpapers

Company-Profile

GroupDiscussion

Opportunity-Fair

Interview-Pattern

Interview-Tips

Mock-Interview

Technical-Interview

HR-Interview

Company-List

Consultancy-List

Councelling & Guidance

Hardware & Network Basics

Inplant-Training

Paper-Presentation

Personality-Developement

Projects

Subject-Presentation

University-Colleges

job-jobs-freshers-walkin-hardware-computer-networking-fat-data-recovery
 
 
 
 
Join our Yahoo Groups

freshers-jobs-software-jobs-career-education-walkin-bpo-jobs
 
|| freshersdreams ||Latest Job openings in the Top MNC for Freshers & Expercienced || Learn how to crack interviews ||FreshersDreams|| Company Question Papers, Technical Ques, Programming Section, FREE Resume Tips, Student Resources || FreshersDreams || Company Information, Consultancy Listings, Company Profiles, Alumini and lot more ... || FreshersDreams ||Join the Freshersdreams Yahoo Group to get latest job openings :: fresherdreams-subscribe@yahoogroups.com
jobs-software-job-career-technical-job-companies
 
Web www.freshersdreams.com
jobs-software-job-career-technical-job-companies
placement-papers-company-question-papers-job-jobs-freshers-walkin-hardware-computer-networking-fat-data-recovery-job-jobs


IKOS


There were three sections:

 

1. Software
2. Hardware
3. Analytical

 

Only one MCQ question; all others to be solved analytically. Here
are some of the questions which I remember.

 

1. Each of the letters below represents a non-zero and unique digit.
Find the digit.
one
one
one
+one
-----
ten
Find the digits.

Ans( one = 182 , ten=728).


2. Calculate the maximum permissible propagation delay of each FF in a
modulo 1023 counter.

 

3. Find the error if any -

{
struct *sPtr, *nPtr
for(;*nPtr;nPtr=nPtr->next)
free(nPtr);
}


4. Find the output -
main()
{ void f(int, int);
int i, j;
i=10;
j=10;
f(++i,j++);
}

void f(int i, int j)
{if(i>50)return;
else
i+=j;
f(i,j);
printf("%d",i);
}

Ans 413121 (I think so)


5. Implement the following usin 4X1 MUX.
A'BC + AB'C +ABC'

 

6. How will you convert an S-R FF into J-K FF ?



freshersdreams.com






fresherdreams
      Home  AboutUS   People Speak   ContactUS     Adversitements    PrivacyPolicy    
  Copyright-2005 FreshersDreams, INDIA. All rights reserved.