HELLOSOFT

HELLOSOFT-.   
           
                            SECTION-A            
(14*1=14)
1.The impulse responce of a system is
h(n)={0,1,0.5,0,125,---}.then the response of the
system for the unit step i/p is _________ .
2.The impulse responce of the discrete time
systemdescribed by y(n)=1/2
x(n)
  +2 x(n) + x(n-2) + 2 x(n-3) + 1/2
x(n-4)is___________ .
3.helbert transform of a unit impulse function
is________ .
4.The convolution of the sinc function itself is
_________ .
5.If a signal is real & odd in the time domain,
theFourier Transform is

   _____ .6.Given y(n)=x(2-n)+1,checkwhether the
function is
linear, causual, time invariance, memory.
7.the frequency range of FM radio broadcast is in
b/w___ & ______ .
8.If a signal having 6.5khz is sampled at a rate of
8khz frequency then the aliasing frequency is
   1) 1.5khz  2)6.5khz     3)2.5khz  4)
9.If a 1khz signal has an attenuation of 5db, then
theattenuation of
32khz is
    a)-40db    b) -70db   c) ---- d) non of these
10.which one of the system has stable.
    a) u(n)/n   b) [1/n]**2  c)e**(-3n) d) sin(3n/n)
11.match the following sentences.
    a) bilinear transformation      --- IIR filter
    b) increase in FIR filter     ----- a tan(w/2)
    c)poles in the transfor function  --- poles in
thes- plane eclipse.
    d) frequency, sampling method --- transition
widthreduced
    e) chebyshev responce   -------    ---------- .
12.name the 2 signals which have the same shape
infrequency & time
domain.
    ans: gaussian & impulse responce13.For sin(nwt) to
be periodic, 'n'
must be
    a)rational b) any number c) irrational14. given
H(s) =s/(s+a).It
represents
     a) LPF   b) HPF   C) BPF   D)  ---- .
                      SECTION-B            (12*1=12)
1.-32768  can be represented in 16 bit binary as
__________ .
2.0x80c is right shifted by 2 . then the number
formedis_______ 
3.if interrupt is enabled while the processor is
working.then the course of    actions that took
placeare
    ans:it completes the current instruction &
controlof the processor
jumps
         to the  starting address of the
interruptservice routine.
4.why we r selecting DSP processor over
microprocessor.    a)multiple
processing
    b)pipeline processing    c)high clk rate  
d)-----
5.short int *y ,*(*y) represents ________ .      
ans:0x755.
6.find the value of s+= x+(y>>2) . given
s=0x100,x=0x50,y=0x20.   then
s=?
7. advantage of pipelining ?8.the transfer function of
a system is
invertable if
   a)both poles & 0's outside the unit circle
   b) if both poles & 0's inside the unit circle.
   c)poles inside , 0's ouside of the unit circle.
   d)poles outside, o's inside of the unit circle.
9)OSI reference model consists of _____ layers.
10.FAX/EMAIL/---  can be sent through PSDN modem.
     state whether it is true or false.11.the 2's
complete range is
________
    ans:-128 to +12712.arithmatic left shift of ox200F
results  ______
. 
       * bits on Random process.                
INTERVIEW QUESTIONS:
1.what is adaptive filter? where we can use
thesefilters.
2.what is the F.T of rectangle?3.what is the
convolution of 2
rectangles?
4.if we replace a flipflop with a latch.what
willhappen?     ans:racing
problem
5.design a irregular counter.6.F.T or Z transform of
sin(o.2*pi*n)
7.questions on randaom process
8.compare PLC(programmable logic counter) with micro
processor in economic point of view.
9. realize filter for {1,1,2}. and realize it?
10.0.8+j0.2 is one of the roots of FIR filter. what
rthe other roots?
11.  a)y(n)=x(n) + x(n-1) + 10**36 x(n-2)+ ---     b)
y(n)=2y(n-1)+x(n-3)+-----.
   In the above which one is stable?    ans:a
12.for designing IIR filter, which method is best?
13.what is aliasing? & sampling?
14.where the fourier series(F.S)  & F.T  were used?
15.write equations for F.S & F.T.16.where the laplace
transform is
used?
17.in F.T why e**(-jwnt) is used?    this question was
asked in bel crl
also.
18.properties of butterworth , chebyshev &
ellipticfilters?
19.in which filter the transition width is lower?
20.why linear phase condition will be assumed in DSP?
21.if all poles & 0's in the left half of the s-plane,
it is called
____ .
22.FFT ,DFT formulae.23. what is the difference b/w
bilinear
transformation
& impulse invariant transformation? which is
mostlyused? & why?
         *they mainly concentrated on filters.   
                    BEST OF LUCK

Deshaw From IITG

This is deshaw from iitg.

section1)quantitative 20 min 20 bits.after 20 min you
should return paper.

section2)programming java,... 20 bits

section3)A puzzle


"""i am sending questions only""".You should prepapre
answers.
..............................................................
section1)  :quantative
............................................................
5)a brick is 4kg.If you make the brick 1/4 then how
much will be its weight.
7)ans is "c"mohan 8km behind ravi"mohan speed
6km/hr,ravi speed 4km.hr when will mohan cross ravi.
8)a man on motorcycle is going inthe direction of
bulltet(gun).A man fires two bullets with time gap
"""25min""".But the man on motor cycle listens second
shot after 27 min.then find sound velocity:motorcycle
velocity.

9)k-7 is divisible by 11   and k+3n is divisible by 11
.find minium n answer is (a).that means n=5.

10)5red ball,7 white ball in one bin,3red ,12 white in
another bin.If one ball picked what is prob of it is
red.answer is 37/120

14)1-(0.1)*0.2=0.98 is the answer.

15)0.1% in one meter answer is (a)

16)ans c

19)4,12,15,5,2,---  fill that gap.

...............................................................................
..............
section 2
...............................................................................
..
1)"soap" means/*i think ans is a*/

2)char *(*(*a[n])())(); means ans:a is an array [n] of
pointers to function returning pointer to functiuon
whose return type is char pointer

3)what will be in ""/etc"" answer is c(password files)

4)api used to hide window

5)ntfs means /*new technoly file system*/

6)a bit on unix properties answer is all of the above.

7)i=7;i++*i++ answer is 49(check)

8)p[]="d e shaw"

he made p++.so it is surely """compile time error.""""
9)char *(*(* var)())[10] means var is a pointer to a
function returning pointer to an array[10] of pointers
10)
if we pass n=10 to the following function,how many
times it will print ""done""
f(int n)
for(i=1;i<=n;i++)
f(n-i);
print("done");

i think answer is none of the above.

12)

i=0,j=1
printf("%d", max(i++,j++) )
printf("%d%d",i,j);

you got this type question in so many papers.

14)asked about properties of "structure","class"
ans is a
17)what is property of ""final class"" in java
ans is can't inherit further.


...............................................................................
.................
section 3:in this section you have only one question
...............................................................................
...

Write any three numbers in a row.It is always possible
to find a subset of adjucent numbers that add up to a
multiple of 3(that is either one,two or three numbers
that are next to each other).

for example (1):          5,7,1    5+7=12(multiple of
3)

example 2:                4,4,15   15 is multiple of 3

example 3:                5,11,2   5+11+2=18 is
multiple of 3

can you explain why and prove it ?what happens if you
write a long list of numbers(say ""n"" numbers).Is it
always possible to find a subset of adjacent numbers
that add up to a multiple of ""n"".Can you explain why
and prove ????     

DESHAW

This is the paper given at ISI july 2001.
In Jadavpur university only BE students were allowed because
of some problems with the placement officer.
It allowed only top 10 students in all branches.
It did notinterviewed any and left with none selected at both
jadavpur university and ISI kolkata.
Some of the interview questions that were asked in ISI kolkata
were as follows.
1.questioins on Operating systems.
2.Different IPC mechanisms
3.basic unix commands like open,create,read,write,etc along with the formats
4.c++ questons
The test consisted of 3 sections as follows.
1.Analytical 20 q
2.Technical 20 q(c-13q,c++ 5q,java 2q)
3.write an Algorithm .

The questions that we colleced were from ISI.
sorry for not gathering the technical questions.
The questions were not in order and may vary with slight difference.

CHECK THE ANSWERS.
part a:
20 bits(20 min)


aptitude:
 1)reasonig question is there,
   see in alphabetical order of the names
 2)In a pack of cards what is the probability of 1 jack, 1 queen, 1 
king
ans : 64/52*51*50
 3)how many three digits numbers are divisiable by 10,15,20.
 ans :16
 4)8 persons are there,sequence of 3 persons are  never changed,in a 
circle.
number of possiabilites .
ans :6!*3! or 5!3!
 5)if x is number, the sum of digits,the (x!-x) is completely divided 
by
 number x, find that number.
 ans: any no less than 10.(Check).
 6)in cetain part of 40% solutin is replaced by 25% solution, and 
resultant 
solution is 35%, then how much solution is replaced.
ans : 1/3.
 7) i collected 8 spiders and bettles, he is a habbit removing of legs,
    he put the legs in torcher box, their count is 54, find howmany 
spiders
and bettles are there.
ans :
 8)one question was there on equation
   one kg of rice and two kg of wheat cost 320.
   six kg of wheat and 2 kg of pulses  cost is 620
    rice cost is twice the pulses.find the rice cost.
    ans :rice 170,wheat 75,pulse 85. 
 9)finding age problem
10)x2-x-6>0, x2-5x+4<0
   this type of problem, find common solution
11)
In a game problem there are two persons A and B.
A's probabiliy of winning the gme is 0.4 and B's is 0.6
There are two possible serises of winning the game.
one is choosing the best out of 3
and the other is best out of 5.What is the probability of a winning the game.
some thing like this.
ANS: c
sol may be like this
P(X=3)=3C3*(0.4)^3+3C2*(0.4)^2*(1-0.4).
12)
Two rains travelling in opposite directions with 45 KMPH and 35KMPH
of equal length
cross each other in 36 seconds.Find the length of each train.
Ans: 400 m
13)
3/5th average age of my and my son is equal to sum of our age 5 years ago.
my sons present age is 10.
what is my present age.(some thing like this)
ans: 50.(check it)
14)This year she recieved award.In the feciliation function she
said "This has been possible for my stuff,
whom i have selected and praised".
This sentence refers to
ans: her self apprisal.
15)
A went to market and bought some Kgs of rice.
If he had given 10% discount then he would have obtined 1Kg of extra rice at an
extra cost of 5%.
find the no. of kgs of rice.
ans:
16)
You were given 28 pages in a single days paper.$ pages were found missing.One is 21.
what are the other pages.
ans:7,8,22
17)
A farmw has got land.Area of land in sq.mts is 3 time the square of goats
he has He sold 1 goat and found that he needs to sell 57 sq.mts of land to maintain the
same relationship.How many goats he have now?
ans:10
part c(15 min)

part c:
algoritham:
  write an algoritham for, in chess board arranging the queens without 
  threaten themselves.
Ans:ref book of satraj sahani and Horowtiz
of Design and analysis of Algorithms.(DAA).

part b:
c bits(13)
c++ 5
java 2    (30 min)

Cisco Previous Year Placement Paper| Aptitude Test Paper For Cisco

THIS IS PREVIOUS YEAR PAPER OF CISCO

**************************************************************************


OLD PAPER
---------
20 questions - analytical
40 questions - system concepts and c.

i am giving some question in both sections.

analytical section.
1.12 quantative questions
2.4 meanings
3.4 matching(like goat::rat)

1.what is the length of the largest diagonal in a cube of 1unit.
 ans:2*sqrt(3).
2.if 0<s*t<1 then the values of s and t many be
 ans:s>-1 and t>-1
3.one of the digits of a two digit number is 6,whose sum is half of there
product and whose product of the half of the reverse order number.what is
the number.
 ans:63
4.how many times 0.01 is larger than (0.0001)*(0.0001)
 ans:10**6.
5.a train of length 200mts is moving with a velocity of 100km/hr towards
east.a car is comming with a velocity of 72km/hr in the opposite
direction.how much time the car takes to cross the train.
6.canibalism-
7.humino::static
  ans:human::--
8.concrete::abstract
  ans:matter::mind
9.elevator-above
10.ramesh,robert,ravi,rahul r doing newpaper business.....
   ans:ramesh,either ravi/rahul



system concepts:

1.int a[5,6]
  how much memory will be allocated
2.char p[6];
  char *d[10];
  ans:d=(char*)p
3.using LFU algorithm,how many page faults will occur of the pages r
  1,2,1,3,4.
  ans:1,4
4.in which layer the bridges r used.
  a)data link layer
  b)session layer
  c)physical layer
  d)network layer
5.#define d 10+10
  main()
  { printf("%d",d*d);
  }
6.in a complete binary tree if the number of levels r 4 then the number of
  nodes will be,
7.if we delete a node from a balanced binary tree,how can we retain the
  properties of balanced binary tree.
  ans: by rotation at the nodes.
8.in a k-way search tree with N keys, the number of node/no. of leaves=
9.s->A0B
  A->BB|1
  B->AA|0
  how many string can be constructed with length 5.
10.in which of the following regular expression the srting contains
   atleast 2 concetive 1's.
   ans:(0+10)*||(0+1)*
11.int i,j=1;
   for(i=0;i<10;i++);
    { 
      j=j+1;
    }
   printf("%d %d",i,j);
   
   ans:10 11
12.static char *i;
   i=malloc(sizeof(char));
   find the error;
   ans:malloc returns void
13.virtual memory address capacity depends on--
14.main()
  { int i=1;
    fork();
    fork();
    fork();
    printf("%d",i);
  }
  how many times i will be printed
  ans:8
15.question on threads
16.int i=0xaa
   char *p;
   p=(char *)i;
   p=p>>4;
   printf("%x",p);
   ans:0x000000a;
17.union
   { char *p;
     int i;
     char b;
   }
   main()
   { 
       --
    p=(char*)malloc(8*sizeof(char));
  }
  what is the size of union?
18.enum{sunday=-1,monday,...saturday}
   printf("%d %d",sizeof(wednesday),wednesday);
19.struct x{
      struct{
         struct{
            char ch;
             } x;
         }};
  ans:definition wrong
20.struct *s;
   s=(struct *)malloc(10*sizeof(struct)+90*sizeof(int));
   free(s);
   ans:total memory deallocated
21.one alogrithm is given:
  ans:10395 
22.func()
   { int x=1;
     if(x=1)
        x=1000;
     else
        x=10;
    
     return x;
    }
   what is the return value?
   ans:1000


 

Cisco Selection Procedure

CISCO SELECTION PROCEDURE 
    -------------------------
        WRITTEN TEST + ONE INTERVIEW

WRITTEN TEST
============
* Total Duration : 1 hour
* NO NEGATIVE MARKING

Total 3 sections
----------------
 * First section is COMPULSORY for both Electronics and Computer Science
   students.

 * Second Section is of Software.

 * Third is of Hardware.

 * I M P O R T A N T  :: ONLY  ONE  SECTION AMONG 2nd OR 3rd need to be
   answered like for you, you will give the answers of Section 2. 

 * 30 questions in each section
 
 * There was no bound of time for a particular section. You can
   devote any amount of time to any section but max. limit is 1 hr for
   the whole paper.

  DETAILS OF SECTIONS
  ------------------- 
  First Section : 1. Common to both cs and elec people.
                  2. total 30 questions and NO negative marking
                  3. Simple questions on digital logic design, 2's
                     complement, number representations, flipflops,
                     microprocessors(8085), Architecture[virtual memory
                     and small numerical like what will be the size of the 
                     memory if we have given the no. of address bits and
                     other necessary details].
                     One question of formal method.

  Second Section: 1. Software Section
                  2. total 30 questions and NO negative marking 
                  3. OS(3-4 qns), Compilers(2-3 qns. on basics),
                     maximum qns. were of C and Data Structures[trees,
                     preorder,post,inorder traversals,complexity of
                     search/sort, suitable data structures etc.]

  Third Section : devoted to hardware. i do not have any details as no
                  computer sc. student appeared for this section.

INTERVIEW
=========
Regarding CISCO interviews...... they asked about project and some C and
data structures and to some students some basics of networking and OS
questions..... there were 3 panels....... 2 panels for Software and 1 for
hardware....

Student has to give only one interview in any panel....There was no
separate HR interview.... interview was of generally 25-30 minutes
duration.... 2/3 persons in an interview panel....

Finally from IISc, in Software, they selected 9 people from Computer
Science and in hardware, 3 from CEDT(Electronics Design).

Interview Questions
-------------------
0. M.E. Project

1. If you are not having a sizeof operator in C, how will you get to know
   the size of an int ?

2. Write a macro to set the nth bit ?

3. Can you use a variable in a file using extern which is defined as
   both static and global in base file?

4. When we declare union in C, how is the size of union allocated in the
   memory?

5. What is the boundary problem in allocation of size of structures?

6. Data Structures:-
   
   a. Write a program to reverse a linked-list.
      Uma, before interview, practise it on a paper as many here couldn't
      write the code at the time of interview.

   b. Some trees question...what is balanced binary tree?..etc..

To Some students, one software panel asked about the courses they had done
here in IISc.

To some people, they have asked some OS and networking questions like 

OS Questions:
1. What is the difference between user and kernel space?
2. What is real time OS and how it's different from other OS?
3. signal and interrupt handling.

Networking Questions:-
1. Sliding window protocol.
2. TCP And IP differences.

This all I come to know from the 2 fellows, other written paper details
possibly questions, i will enquire tomorrow morning and send you.

IMPORTANT : I am sending you an OLD paper of CISCO as an attachment. My
            friends who have got thru cisco says that this year many
            questions were there from this paper. For example, in 1st
            section of the written test, the only question of formal
            method was same as asked in this old paper. 
*************************************************************