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)
Showing posts with label cisco. Show all posts
Showing posts with label cisco. Show all posts
Friday, May 6, 2011
DESHAW
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.
*************************************************************
Cisco
this is cisco paper which was held in ISI on 5th august.
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
Subscribe to:
Posts (Atom)