Skip to main content

Free Online Books Tutorials interview questions

Book Reviews
Interview Questions
Magazine Feeds
Online Books

Home » Interview Questions » Placement Papers of Companies

SYNOPSIS Placement Papers

Submitted by bookman on Wed, 10/28/2009 - 10:11

SYNOPSIS Placement Papers

The grammer for A, B, S is given below.
S->Ax|By
A->Ax|y
B->x|y
possible ans is xy|xy
In n*n matrix , there non zero numbers in diagonal and either side
of the diagonal. If represented in one dimensional array, assign the
values which are non zeros.
find relation with i,j iteration and linear arry
like a[2*(i-1)+j] this
the matrix will be
x x 0 0 0 0 --------
x x x 0 0 0 0 -----
0 x x x 0 0 0 ------
0 0 x x x 0 0 -------
0 0 0 x x x 0 0 ----
| | | | | | | | |
| | | | | | | | |
remumber n*n matrix
In-order of the letters is given as below:
If written in pre-order like given below:
write the post-order:
fun(n)
{
if(n<=2)
return (1);
else
return ((fun(n-1)*fun(n-2));
}
find the order of complexity of the programme.
possible answer ---- N(2^n)
If a and b are given. write the results of the programme
given below.
a=a XOR b;
b=a XOR b;
a= a XOR b;
answer is swaping of a and b
so b,a is answer
for a given CMOS the voltage is halved
freqency doubled
capacitance halved
what is the present CMOS power
ans (b)---- dynamic power is 1/2 *C*f*V^2
if a row daminated two dimentional arry in the following which one is advantage
and why?
a) for(i=0;i<1000;i++)
for(j=0;j<1000;j++)
temp=temp+a[i][j];
b) for(j=0;j<1000;j++)
for(i=0;i<1000;i++)
temp=temp+a[i][j]
what is area of a Hexagon with side as 1unit
ans is 3*(sqrt(3))/2
If traverse in a chess board right and down from one corner to another corner
how many possible ways will be there
ans is C(16,8) or (16!/(8!*8!))
Tick the below which can biparate (graph theory)
1)tree 2)forest of trees 3) evencycle graph 4) oddcycle graph
ans is 1,2,3
.The fig shown in below is a SRAM (1K* 4 bits) ,how many of this SRAMS are
reqired to design 16K of one byte
ans is 32 SRAMS and one 4 to 16 decoder
suppose two persons entering into one room in the morning 5 to 6 A.M.
what is the probability they will enter in 10 minits gap.
In a binary tree what is the hight and lowest no of levels for N nodes.
ans is highest is N and lowest is log(N+1) base 2
represent 3 and -3 in base -2 form taking two states (0,1) only

‹ Polaris placement papers up Subex Placement Papers ›

Login or register to post comments

Tags in Tags

Cardiovascular System Computer Science Database Books DERMATOLOGY DIGESTIVE DISEASES GENARAL MEDICINE General GENETICS GYNECOLOGY AND OBSTETRICS Hardware Books HIV AIDS INFECTIOUS DISEASES Java Books Languages Math Books Medical Books Microsoft Books Networking NEUROSCIENCE NUTRITION ONCOLOGY Operating Systems OPHTHALMOLOGY Other Books PEDIATRICS PHARMACOLOGY RADIOLOGY Software Engineering UROLOGY Web Services and web Development

Book navigation

Art and Photography

Biographies and Memoirs

Book Reviews

Business and Investing

Comics and Graphic Novels

Computer Science

Computers and Internet

Cooking and culinary

Crafts and Hobbies

Engineering

Entertainment

Health and Life

History

Home and Garden

Interview Questions

Literature and Fiction

Magazine Feeds

Mathematics Books

Medicine

Mystery and Thrillers

Nonfiction

Online Books

Parenting and Families

Politics

Reference

Science Books

Self-Help

Sports

Text Books

Travel

User login

Username: *

Password: *

Create new account
Request new password

Follow on Twitter

Follow us on Twitter

Navigation

Popular content
Recent posts
Feed aggregator

Latest Online books

microsoft press microsoft windows communication foundation step by step
Inside Windows Communication Foundation
Essential Windows Communication Foundation (WCF): For .NET Framework 3.5
Microsoft .NET Server Solutions for the Enterprise
Microsoft .NET for Programmers
Expert C# 2008 Business Objects
Exam 70-536 Microsoft .NET Framework 2.0 Application Development Foundation
Visual Diagnosis in Emergency and Critical Care Medicine
Manual of Emergency and Critical Care Ultrasound
sex positions complete guide
.NET Development Security Solutions
Professional Enterprise .NET
Microsoft Â® ADO.NET Step by Step (Step By Step (Microsoft))
How to Design Programs An Introduction to Computing and Programming
Algorithms and Complexity
Processor Architecture Laboratory
Writing device drivers in Linux: A brief tutorial
Linux Device Drivers Demystified
Writing a Linux device driver
Write a Linux Hardware Device Driver
Developing Linux Device Drivers using Libusb Programming Interface
Engineering Mathematics Frequently Asked Questions
Advanced engineering mathematics (7th edition)
MATHEMATICS FOR ELECTRICAL ENGINEERING AND COMPUTING
Mathematics for Computer Science
Advanced Calculus for Engineers
Mathematical Methods for Engineers II
ISMAILIA A NARRATIVE OF THE EXPEDITION TO CENTRAL AFRICA FOR THE SUPPRESSION OF THE SLAVE TRADE
In The Heart Of Africa By Sir Samuel W. Baker

(c)chilanti.com