CISCO PAPERS: 2007

Tuesday, October 9, 2007

WRITTEN TEST N INTERVIEW

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.
*************************************************************

HCL - CISCO PAPER

> HCL-Cisco qustion paper:
>
>
> Section A
>
> 1. Which of the following involves context switch,
>
> (a) system call
> (b) priviliged instruction
> (c) floating poitnt exception
> (d) all the above
> (e) none of the above
>
> Ans: (a)
>
>
> 2. In OST, terminal emulation is done in
>
> (a) sessions layer
> (b) application layer
> (c) presentation layer
> (d) transport layer
>
> Ans: (b)
>
>
> 3. For a 25MHz processor , what is the time taken
> by the instruction which needs 3 clock cycles,
>
> (a)120 nano secs
> (b)120 micro secs
> (c)75 nano secs
> (d)75 micro secs
>
>
> 4. For 1 MB memory, the number of address lines
> required,
>
> (a)11
> (b)16
> (c)22
> (d) 24
>
> Ans. (b)
>
>
> 5. Semaphore is used for
>
> (a) synchronization
> (b) dead-lock avoidence
> (c) box
> (d) none
>
> Ans. (a)
>
>
> 6. Which holds true for the following statement
>
> class c: public A, public B
>
> a) 2 member in class A, B should not have same name
> b) 2 member in class A, C should not have same name
> c) both
> d) none
>
> Ans. (a)
>
>
> 7. Question related to java
>
>
> 8. OLE is used in
>
> a) inter connection in unix
> b) interconnection in WINDOWS
> c) interconnection in WINDOWS NT
>
>
> 9. Convert a given HEX number to OCTAL
>
>
> 10. Macros and function are related in what aspect?
>
> (a)recursion
> (b)varying no of arguments
> (c)hypochecking
> (d)type declaration
>
>
> 11.Preproconia.. does not do which one of the
> following
>
> (a) macro
> (b) conditional compliclation
> (c) in type checking
> (d) including load file
>
> Ans. (c)
>
>
> 12. Piggy backing is a technique for
>
> a) Flow control
> b) Sequence
> c) Acknowledgement
> d) retransmition
>
> Ans. (c)
>
>
> 13. In signed magnitude notation what is the minimum
> value that can be represented with 8 bits
>
> (a) -128
> (b) -255
> (c) -127
> (d) 0
>
>
> 14. There is an employer table with key fields as
> employer number data
> in every n'th row are needed for a simple
> following queries will get required results.
>
> (a) select A employee number from employee A , where
> exists from employee B where A employee no. >= B
> employee having (count(*) mod n)=0
> (b) select employee number from employe A, employe B
> where A employe number>=B employ number
> group by employee number having(count(*) mod n=0
> )
> (c) both (a) & (b)
> (d) none of the above
>
>
> 15. Type duplicates of a row in a table customer
> with non uniform key field customer number you can
> see
>
> a) delete from costomer where customer number
> exists( select distinct customer number from
> customer having count )
> b) delete customer a where customer number in b
> rowid
> c) delete customer a where custermor number in(
> select customer number from customer a, customer b )
> d) none of the above
>
>
>
> Section B
>
>
> 1. Given the following statement
> enum day = { jan = 1 ,feb=4, april, may}
> What is the value of may?
>
> (a) 4
> (b) 5
> (c) 6
> (d) 11
> (e) None of the above
>
>
> 2. Find the output for the following C program
>
> main
> {int x,j,k;
> j=k=6;x=2;
> x=j*k;
> printf("%d", x);
>
>
> 3. Find the output for the following C program
>
> fn f(x)
> { if(x<=0) > return;
> else f(x-1)+x;
> }
>
>
> 4. Find the output for the following C program
>
> i=20,k=0;
> for(j=1;j {k+=j<10?4:3;> }
> printf("%d", k);
>
> Ans. k=4
>
>
> 5. Find the output for the following C program
>
> int i =10
> main()
> {int i =20,n;
> for(n=0;n<=i;) > {int i=10;
> i++;
> }
> printf("%d", i);
>
> Ans. i=20
>
>
> 6. Find the output for the following C program
>
> int x=5;
> y= x&y
>
>
> 7.Find the output for the following C program
>
> Y=10;
> if( Y++>9 && Y++!=10 && Y++>10)
> {printf("%d", Y);
> else
> printf("%d", Y);
> }
>
> Ans. 13
>
>
> 8. Find the output for the following C program
>
> f=(x>y)?x:y
>
> a) f points to max of x and y
> b) f points to min of x and y
> c)error
>
> Ans. (a)
>
>
> 9. What is the sizeof(long int)
>
> (a) 4 bytes
> (b) 2 bytes
> (c) compiler dependent
> (d) 8 bytes
>
>
>
> 10. Which of the function operator cannot be over
> loaded
>
> (a) <= > (b) ?:
> (c) ==
> (d) *
>
>
> 11. Find the output for the following C program
>
> main()
> {intx=2,y=6,z=6;
> x=y==z;
> printf(%d",x)
> }
>
>
>
> Section C (Programming Skills)
>
> Answer the questions based on the following program
>
> STRUCT DOUBLELIST
> { DOUBLE CLINKED
> INT DET; LIST VOID
> STRUCT PREVIOUS; (BE GIVEN AND A PROCEDURE TO
> DELETE)
> STRUCT NEW; (AN ELEMENT WILL BE GIVEN)
> }
> DELETE(STRUCT NODE)
> {NODE-PREV-NEXT NODE-NEXT;
> NODE-NEXT-PREV NODE-PREV;
> IF(NODE==HEAD)
> NODE
> }
>
> Q. In what case the prev was
>
> (a) All cases
> (b) It does not work for the last element
> (c) It does not for the first element
> (d) None of these
>
>
>
> Answer the questions based on the following program
>
> VOID FUNCTION(INT KK)
> {KK+=20;
> }
> VOID FUNCTION (INT K)
> INT MM,N=&M
> KN = K
> KN+-=10;
> }
>
>
> Q. What is the output of the following program
>
> main()
> { int var=25,varp;
> varp=&var;
> varp p = 10;
> fnc(varp)
> printf("%d%d,var,varp);
> }
>
> (a) 20,55
> (b) 35,35
> (c) 25,25
> (d)55,55
>
>
>
> Section D
>
> 1. a=2, b=3, c=6
> Find the value of c/(a+b)-(a+b)/c
>
>
> 2. What does the hexanumber E78 in radix 7.
>
> (a) 12455
> (b) 14153
> (c) 14256
> (d) 13541
> (e) 131112
>
> Ans. (d)
>
>
> 3. 10 : 4 seconds :: ? : 6 minutes
>
> Ans. 900
>
>
> 4. Q is not equal to zero and k = (Q x n - s)/2.What
> is n?
>
> (a) (2 x k + s)/Q
> (b) (2 x s x k)/Q
> (c) (2 x k - s)/Q
> (d) (2 x k + s x Q)/Q
> (e) (k + s)/Q
>
>
> 5. From the following statements determing the order
> of ranking
> M has double the amount as D
> Y has 3 rupess more than half the amount of D
>
> Ans. Data insuffiecient
>
>
> Questions 6 - 10 are to be answered on the following
> data
> A causes B or C, but not both
> F occurs only if B occurs
> D occurs if B or C occurs
> E occurs only if C occurs
> J occurs only if E or F occurs
> D causes G,H or both
> H occurs if E occurs
> G occurs if F occurs
>
> 6. If A occurs which of the following must occurs
>
> I. F and G
> II. E and H
> III. D
>
> (a) I only
> (b) II only
> (c) III only
> (d) I,II, & III
> (e) I & II (or) II & III but not both
>
> Ans. (e)
>
>
> 7. If B occurs which must occur
>
> (a) D
> (b) D and G
> (c) G and H
> (d) F and G
> (e) J
>
> Ans. (a)
>
>
> 8. If J occurs which must have occured
>
> (a) E
> (b) either B or C
> (c) both E & F
> (d) B
> (e) both B & C
>
> Ans. (b)
>
>
> 9. Which may occurs as a result of cause not
> mentioned
>
> I. D
> II. A
> III. F
>
> (a) I only
> (b) II only
> (c) I & II
> (d) II & III
> (e) I,II & III
>
> Ans. (c)
>
> 10. E occurs which one cannot occurs
>
> (a) A
> (b) F
> (c) D
> (d) C
> (e) J
>
> Ans. (b)

CISCO IISC

Subject: Fwd: Cisco paper (fwd)

hi,

right now iam having cisco paper with me. mind u that
this paper we got
from psg and we got 7 questions from this paper...

for microsoft there was no written exam...

regarding requirements:

cisco has taken 9 from cse and 3 from cedt(hardware).

regarding microsoft only four from our class attended
and they have taken
2. for microsoft there is nothing like requirement if
u perform well they
will take...

bye

Diwakar Rao

##############################################################################

Many of lifes failures are people who did not
realize how close they were
to success when they gave
up

--
Thomas Edison

##############################################################################
V.DIWAKAR RAO
3rd Sem M.E
ROOM # E-86
Computer Science and Engineering
IISc HOSTELS
Department of CSA

CISCO Y2K PAPER
---------------

1> The starting location of an array is 1000. If the
array[1..5/...4] is stored
in row major order, what is the location of element
[4][3]. Each work occupies
4 bytes.

2> If the number of leaves in a binary tree are N,
then the total number of
internal nodes........(Assume complete binary tree)

ANS: N-1

3> The locality of reference means.............

4> If two ausigned 8 bit numbers are multiplied what
is the memory space
required...............

5> The vector address of RST 7.5 is ............

ANS: 003C (multiply 7.5 by 8 and convert to hex)

6> int b = 0xAA;
b>>4;
printf("%x",b);

What is the output of the above program....

7> struct s1 { struct { struct {int x;}s2}s3}y;

How to access x? ANS: y.s3.s2.x

8> Why there is no recursion in Fortran?

ANS: There is no dynamic location (Check this)

9> What is the worst case complexity of Quick sort?

ANS: O(n^2)

10> Quick sort uses..............

Ans: Divide and conquer

11> In a sequential search, the time it takes to
search through n elements is

12> What is the size of the array declared as double *
X[5]

ANS: 5* sizeof (double *)

13> A binary search tree is given and asked to write
the preorder traversal
result.

14> If size of the physical memory is 2^32-1, then the
size of virtual
memory......

15> S-> A0B
A-> BB|0
B-> AA|1 How many strings of length 5 are
possible with the above
productions??

16> (3*4096+15*256+3*16+3). How many 1's are there in
the binary representation
of the result.

ANS: 10

17> In memory mapped I/O how I/O is
accessed.............

ANS: Just like a memory location (Means, I/O
devices can be accessed using
the instructions like mov A,M etc...)

18> What is the use of ALE in 8085.......

ANS: To latch the lower byte of the address.

19> If the logical memory of 8 X 1024 is mapped into
32 frames, then the number
of bits for the logical address ......

ANS: 13

20> Context free grammar is useful for...

ANS: If-then structures.

21> In ternary number representation, numbers are
represented as 0,1,-1. Here
-1 is represented as - (1 bar). Then how is 352/9
represented......
1

22> There are processors which take 4,1,8,1 machine
cycles respectively. If
these are executed in round robin fashion with a time
quantum of 4, what is the
time it take for process 4 to complete....

ANS: 9

CISCO 1999

Sun Aug 15 02:18:25 1999
Date: Fri, 13 Aug 1999 23:33:31 -0700
From: sachin rai
To: trivedi@jaiwanti.ee.iitb.ernet.in
Subject: paper

dear gaurav,
sorry for being late.

here are some questions from cisco(m.tech.)
tech.--24, apti.--20
1.on cmos power( formula- P=CV*Vf
2. lowest noise margin in which logic family--
a)TTL b)CMOS c)biCMOS d)all have same
3.if CMOS has tr(rise time)=tf.find Wp/Wn.
given beta(n)=2*beta(p)
4.gm of a transistor is proportional to
a)Ic b)Vt c)1/Vt d)none
5. if A and B are given in 2's complement find A-B
in decimal.
6. set up time,hold time ,clock to Q delay time (very important)
7.3 questions on opamp (transfer function)(2 marks each)
8.2 questions on sequence detector (2 marks each)
9.logic function boolean expressions(true/false)
(3 question-1 mark each)probabily all false
10.in I/O mapped how do you represent memory(1 mark)
11.the design of FSM(finite state machine) will--
a)increase time of design
b)increase delay
c)increase power
d)all of the above
12. K-map minimization
13.phase locked loop(PLL) 1 question
--sachin

CISCO IIT ROORKEE

hai friends ,
this is from Ananth
to day CISCO came to our cam , i have not shortlisted .
here i am sending the pattern

satya we heard ADITI is commin to ur campus today . tomarrow 2nd
AUG )here on Roorkee , can try it for us . we will check my
usa.net adds night

if possible send to these adds . or even information

CISCO Y2K PAPER
---------------

hai friends ,
here is CISCO 2k held in Roorke . here we are giving all the questions
, those we rembered .

NOTE : here are two papers H/W and S/W both are compulsary for all .
they allowed all E&c , computers and electrical (both ME and BE).
and there is no Aptitude test .
H/W 30 bits
S/W 30 bits total time is 60 minuts.
we will try for rest of the questions . if possible we will send it
shortly.

1> The starting location of an array is 1000. If the array[1..5/...4] is
stored
in row major order, what is the location of element [4,3]. Each work
occupies
4 bytes. Ans: 1068 or 1056

2> In a 3 ary tree, which has 3childs for every node,If the number of
internal nodes

are N, then the total number of leaf nodes........

ANS: 2^(N-1) +3

3> The locality of reference means.............

4> If two ausigned 8 bit numbers are multiplied what is the memory space
required............... Ans: 64k x 16 bits

5> The vector address of RST 7.5 is ............

ANS: 003C (multiply 7.5 by 8 and convert to hex)

6> char a =0xAA;
`int b;
b= (int) a;
b=b>>4;
printf("%x",b);

What is the output of the above program....

a)0x0000000a
b)0x000000aa
c)0x00000aa0
d)0xfffffffa

7> struct s1 { struct { struct {int x;}s2}s3}y;

How to access x?
Ans : Illelgeal strucrure operation.

8> Why there is no recursion in Fortran? *******

ANS: There is no dynamic allocation.

9> What is the worst case complexity of Quick sort?

ANS: O(n^2)

10)What will be sequence of o/s activities when an interrupt occurs.

Ans:resumes the current process after servicing the interupt.

11> In a sequential search, the average no. of comparisons it takes to
search through n
elements is Ans: (n+1)/2.

12> What is the size of the array declared as double * X[5]

ANS: 5*sizeof (double *)

13> A binary search tree is given and asked to write the preorder
traversal
result. 12345678

Ans : 53124768

14> If size of the physical memory is 2^32-1, then the size of virtual
memory...... (doubt ..2^32.)

15> S-> A0B
A-> BB|0
B-> AA|1 How many strings of length 5 are possible with the above
productions?

16> (3*4096+15*256+3*16+3). How many 1's are there in the binary
representation
of the result.

ANS: 10

17> In memory mapped I/O how I/O is accessed.............

ANS: Just like a memory location (Means, I/O devices can be accessed
using
the instructions like mov A,M etc...)

18> What is the use of ALE in 8085.......

ANS: To latch the lower byte of the address.

19> If the logical memory of 8 X 1024 is mapped into 32 frames, then the
number
of bits for the logical address ......

ANS: 13

20> Context free grammar is useful for...

ANS: If-then structures.

21> In ternary number representation, numbers are represented as 0,1,-1.
Here
-1 is represented as - (1 bar). Then how is 352/9 represented......
1

22> There are processors which take 4,1,8,1 machine cycles respectively.
If
these are executed in round robin fashion with a time quantum of 1, what
is the
time it take for process 4 to complete....

ANS: 9

23> The minimum frequency of operation is specified for every processor
because......
a)for interfacing slow peripherals
b)dynamic memory refreshing.
c)to make compatible with other processor.

24) linked list implementation , the following search is not applicable:

Ans: binary search.

25> The reason for preferring CMOS over NMOS is....

Ans: Low power consumption.

26> Two's complement of binary numbers A,B are given and asked to find out
A-B.

Ans: 00100

27> Each character is represented by 7 bits, 1 bit is used to represent
error
bit and another bit for parity. If total number of bits transmitted is
1200bits, then number of symbols that can be transmitted.......

Ans: 133

28> One question about the setassociativity of cache..

Ans:d 4,6

29> Write the postfix form of the following expression...

A+[[(B+C)+(D+E)*F]/G] Ans : abc+de+f*+g/+

30> What is the function of the linker......

31> void f(int y)
{
struct s *ptr;
ptr = malloc (sizeof (struct)+99*sizeof(int));
}

struct s{
int i;
float p;
};

when free(ptr) is executed, then what will happen??

32) To concatenate twe linked lists strings, the order is 0(1) is for
Ans:circular doublly linked list ( please check it).

HARDWARE PAPER.

bOTH S/W AND S/W are compulsory.

1. to find out stack fault of a 3 input nand gate how many necessary
input vectors are needed
2. solving k_map Ans: b+c

3.parity generation i.e even parity
ANs : c

4. nand gate becomes --- gate for negative logic Ans: OR

5advantage of cmos over nmos : ans: Low power dessipation

6.adv of syncronous ckts on async. ckts

7 5 problems on addressing of memories

8.function of ale in 8085

10.A voice signal sample is stored as one byte. Frequency range is
20Hz to 16hz. What is the memorysize required to store 4 minutes voice
signal?
Ans 15MB

11)What will the the controller do before interrupting CPU?
ANs : stores the data into its memory and then interrupts the CPU.

and other are digital fundamentls

12) In a normalised floating point representation, mantessa is represented
by 24 bits and exponent with
8 bits using signed representation. What is range?

14) stack uses Ans: LIFO

15) Where will be the actual address of the subroutine is placed for
vectored interrupts?

Ans: Fixed location.

16) Equivalent Gray code reprasentation of AC2H.

CONCENTRATE ON DIGITAL LOGIC( GATES, RAM ADDRESSING, NO OF BITS REQUIRED,)

from Ananth

CISCO SELECTION PROCEDURE

ISI 5TH AUG

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 LESS THAN 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 in IITK

CISCO: ANALYTICAL
In a puzzle solving problem puzzle A was solved by 67, B by 46 and C by 40 candidates. 28 solved both A and B, 8 solved both B and C, 26 both A and C. 2 solved all three.
1) How many solved A but not B and C?
4 9 12 11
2) How many B but not A and C
8 18 28 39
3) 100 examinees appear for 2 tests. 76 passed in eng and 74 in science. 60 passed both.
How many failed in both subjects?
4 6 8 10
4) 450 play tennis, 240 billiard and 180 golf. 120 play both tennis and golf. 150both tennis and billiard. If none of them play both billiards and golf, and/or all the three games, find the number of members in the club.
200 360 480 600
5) A fair attended by 400 people, 140 attended cultural, 370 visited food stalls. How many visited both cultural and food stalls?
110 180 230 460
In an art gallery, 12 paintings A, B, C, D, E, F…L are to be displayed in 12 different slots. The slots are on either side of a long corridor with 6 slots on each side. Slot 1 is opposite slot 7, 2 is opposite to 8 and so on. The arrangement of paintings is such that K is in the same row as D, D is opposite to H which is exactly between E and F. C is opposite to I which is exactly in between B and F. A is in slot 1. A is diagonally opposite to B, which is opposite to J.
6) which is in slot 6?
A G J L
7) which is in between I and H?
A F I L
8) how many arrangements are possible?
1 2 3 4
9)which is in slot 12?
A B L K.
Directions for qs. 10-14.
1 if the question can be answered by statement 1 alone.
2 if question by statement by 2 alone.
3 if question can be answered by both statements, but not with the help of either of them independently.
4, if can not be answered at all.
10) R lends some money to P at compound interest(compounded yearly). How much interest does he receive in the third year?
1 Rate of interest = 10%
2 Interest in 4th year - Interest in 3rd year = Rs 1805.
1 2 3 4
11) A begger is counting his collection for the day. He has only 50 paise and Re 1 coins. Does he have more of 50 paise coins?
1 His total collection for the day is Rs 30.
2. The value of all Re 1 coins is less than the value of all 50 paise coins.
1 2 3 4
12) there are 21 children. 9 are boys and 12 are girls. If one of the children is randomly selected, what is the probability that the child is a boy who is not a student?
1 of the boys, 4 are students.
2 of the girls 5 are students.
1 2 3 4
13) Are triangles LMN and XYZ are congruent?
1 LMN and XYZ have equal bases and equal heights.
2 Both triangles are isosceles.
1 2 3 4
14) Does line A pass through origin of the co ordinate plane?
1. A passes through (2,0)
2. a is perpendicular to the Y axis.
1 2 3 4
15) A box contains some red, black and green balls. No. of red balls are 4/5 of black balls. No. of green balls is ¾ the no of black balls. There are 470 balls. How many are black?
184 200 316 354
Directions for qs. 16-20
In a certain code, the symbol for 0 is * and that for 1 is $. Numbers greater than 1 are to be written only by using the two symbols given above. The value of symbol for 1 doubles everytime it shifts one place to the left (eg. 4 is written as $**; 3 as $$ )
16) 460
$*$$*$*$$
$$$**$$**
$*$******
$******$
17) 17 x 2 / 16 x 4 / 5 x 2 + 6 / 10
$** $$ $$* $***
18) value of LCM (12, 14, 18)
$*******
$*$*****
$$$*****
$$$$$$**
19) Average of ($**, $*$, $**$)
*
$
$$*
$*$
20) Value of (33 + 43 + 32) / 52
$**
$$$
$$$$***
$$$$$*$*$
Directions for qs. 21-25
A big cube is divided into smaller cubes. The middle cubes on all the four edges of the top layer are divided into eight smaller cubes each. The entire is then painted black.
21) How many smaller cubes are painted black on more than 3 faces?
0 4 8 12
22) How many smaller cubes are painted black on only 3 faces?
0 4 8 12
23) How many smaller cubes are painted black on only 2 faces?
4 8 12 16
24) how many smaller cubes are painted on only 1 face?
18 20 22 24
25) how many smaller cubes are not painted black at all?
1 3 6 9.
TECHNICAL
40 qs are there in technical, questions on diodes were there, such as PIV of center tapped. Band gap of Silicon, what type of bonding in semiconductors and related to these. These are too easy. Just have a look at the BTech/GATE level basics. NO questions were of high funda.
There was a section on eletromagnetics and electrdynamics. I can not remember the questions. 10 questions were there. But I think that they were basics in that field.
This is for electrical part. I don’t have any idea about computer science part.

Sunday, May 6, 2007

CISCO ANALYTICAL PAPER

CISCO: ANALYTICAL

In a puzzle solving problem puzzle A was solved by 67, B by 46 and C by 40 candidates.
28 solved both A and B, 8 solved both B and C, 26 both A and C. 2 solved all three.

1) How many solved A but not B and C?
4 9 12 11

2) How many B but not A and C

8 18 28 39

3) 100 examinees appear for 2 tests. 76 passed in eng and 74 in science. 60 passed both.

How many failed in both subjects?

4 6 8 10

4) 450 play tennis, 240 billiard and 180 golf. 120 play both tennis and golf. 150both
tennis and billiard. If none of them play both billiards and golf, and/or all the three
games, find the number of members in the club.

200 360 480 600

5) A fair attended by 400 people, 140 attended cultural, 370 visited food stalls. How
many visited both cultural and food stalls?

110 180 230 460

In an art gallery, 12 paintings A, B, C, D, E, F…L are to be displayed in 12 different
slots. The slots are on either side of a long corridor with 6 slots on each side. Slot 1 is
opposite slot 7, 2 is opposite to 8 and so on. The arrangement of paintings is such that K
is in the same row as D, D is opposite to H which is exactly between E and F. C is
opposite to I which is exactly in between B and F. A is in slot 1. A is diagonally opposite
to B, which is opposite to J.

6) which is in slot 6?

A G J L

7) which is in between I and H?

A F I L

8) how many arrangements are possible?

1 2 3 4

9)which is in slot 12?

A B L K.

Directions for qs. 10-14.

1 if the question can be answered by statement 1 alone.

2 if question by statement by 2 alone.

3 if question can be answered by both statements, but not with the help of either of them
independently.

4, if can not be answered at all.

10) R lends some money to P at compound interest(compounded yearly). How much
interest does he receive in the third year?

1 Rate of interest = 10%

2 Interest in 4th year - Interest in 3rd year = Rs 1805.

1 2 3 4

11) A begger is counting his collection for the day. He has only 50 paise and Re 1 coins.
Does he have more of 50 paise coins?

1 His total collection for the day is Rs 30.

2. The value of all Re 1 coins is less than the value of all 50 paise coins.

1 2 3 4

12) there are 21 children. 9 are boys and 12 are girls. If one of the children is randomly
selected, what is the probability that the child is a boy who is not a student?

1 of the boys, 4 are students.
2 of the girls 5 are students.

1 2 3 4

13) Are triangles LMN and XYZ are congruent?

1 LMN and XYZ have equal bases and equal heights.
2 Both triangles are isosceles.
1 2 3 4

14) Does line A pass through origin of the co ordinate plane?

1. A passes through (2,0)
2. a is perpendicular to the Y axis.
1 2 3 4

15) A box contains some red, black and green balls. No. of red balls are 4/5 of black
balls. No. of green balls is ¾ the no of black balls. There are 470 balls. How many
are black?
184 200 316 354

Directions for qs. 16-20

In a certain code, the symbol for 0 is * and that for 1 is $. Numbers greater than 1 are to
be written only by using the two symbols given above. The value of symbol for 1 doubles
everytime it shifts one place to the left (eg. 4 is written as $**; 3 as $$ )

16) 460
$*$$*$*$$

$$$**$$**

$*$******

$******$

17) 17 x 2 / 16 x 4 / 5 x 2 + 6 / 10
$** $$ $$* $***

18) value of LCM (12, 14, 18)

$*******

$*$*****

$$$*****

$$$$$$**
19) Average of ($**, $*$, $**$)

*
$
$$*
$*$

20) Value of (33 + 43 + 32) / 52
$**
$$$
$$$$***
$$$$$*$*$

Directions for qs. 21-25

A big cube is divided into smaller cubes. The middle cubes on all the four edges of the
top layer are divided into eight smaller cubes each. The entire is then painted black.

21) How many smaller cubes are painted black on more than 3 faces?
0 4 8 12

22) How many smaller cubes are painted black on only 3 faces?

0 4 8 12

23) How many smaller cubes are painted black on only 2 faces?

4 8 12 16

24) how many smaller cubes are painted on only 1 face?

18 20 22 24

25) how many smaller cubes are not painted black at all?

1 3 6 9.

TECHNICAL

40 qs are there in technical, questions on diodes were there, such as PIV of center tapped.
Band gap of Silicon, what type of bonding in semiconductors and related to these. These
are too easy. Just have a look at the BTech/GATE level basics. NO questions were of
high funda.

There was a section on eletromagnetics and electrdynamics. I can not remember the
questions. 10 questions were there. But I think that they were basics in that field.

This is for electrical part. I don’t have any idea about computer science part.

CISCO INTERVIEW CHENNAI

Ist round

1. Is windows/linux is preemptive or not(kernel).

2. Is the sheduler is a process or not.

3.What is the meaning of enabling kerenel level threading

4. What do you mean by allowing kernel preemption

5.What is the meaning of 8/16/32 bit operationg system

6. How interrupts will be handled in operating system

7.Why swapspace is required in operating system

8.how come a swapspace accessing is faster than normal secondary memory access though swapspace is a part of secondary memory.

9.What is the concept of micro kernel architecture

10.Is windows/linux is micro kernel architecture

11.Difference btw multi programming and multi processing

12.What is symmetric and asymmetric multi processing

12.Tell about IRQ's

12.How the devices are managed if more devices are available than IRQ lines

12.How the devices associated with a single IRQ line are managed.

13.How the operating system finds out which device has generated the interrupt in a single IRQ

14.Which ISR is serviced if we get an interrupt from an IRQ connected to more than one device.

13.write an inplace strrev routine

14.Why pointer manipulations are faster

15.

int sum(int a,int b)
{
int s;
s = a + b;
return s;
}
convert this function to a macro......

16.Finding unduplicated element in a list of n elements where n-1 elements are duplicated.

17.Finding the no. of 1's in a binary representation of a number.

18.Two linked lists are given, if the two lists are merging at one point and becoming a single list from that point find out point of merging in linear time.

19.What is the difference btw char *s="iitg"
char s[]="iitg"
like compiler error or runtime error if we try to change the value of that s array

20.Basics in networks
like OSI layers and TCP layers
21.difference between Hub and switch and which layer each one belongs to

22.Is it possible to broadcast using a switch.

23.which is more suitable for broadcasting either a hub or a switch

24.What is class D addressing

25.How a DLL device(switch) knows about multicast addresses.

26.What is the difference between a router and gateway

27.What is the function of Multiport router

28.About Adhoc routing protocols

2 nd round

1.Explain u r project work

2.Explain the routines that executes whenever the system boots up like ROM BIOS routines

3.What is the meaning of Partitioning and formating a disc

4.Is a system can have more than one primary partition

5.If linux and windows coexist which one lies on primary partition of the disk.

6.Which process executes first when os bootsup

7.What is master boot record

8.what is a super block

9.Which layer of networks u r most comfortable with (I told except physical layer I am comfortable with all other layers, then he started asking questions only on physical layer, though, I have answered well)

10.Tell about the significance of physical layer in networks

11.why fiber optics data rate is very high

12.What are advantages of fiber optics over normal copper or co-axial cables

13.Why cross talk and attenuation is insignificant in fiber cables

14. what is total internal reflection in fiber cables

15.what is single mode and multi modes in iptical fibers

16.Did u ever installed two windows versions on the same logical drive

17. Some questions on project

3 rd round(HR just for the formality)

1.Tell about u r self

2.Tell about any extra curricular activities and any significant work u have done in the past 2 years

3.Will u leave CISCO if some other company pays u high package

4.How can we believe in u r loyality towards the company

5.Any questions

How far CICSO is an R&D company
CISCO culture and employee values

Saturday, May 5, 2007

CISCO 2000

Cisco 2000

1> The starting location of an array is 1000. If the array[1..5/...4] is
stored
in row major order, what is the location of element [4][3]. Each work
occupies
4 bytes.

2> If the number of leaves in a binary tree are N, then the total number of
internal nodes........(Assume complete binary tree)

ANS: N-1

3> The locality of reference means.............

4> If two ausigned 8 bit numbers are multiplied what is the memory space
required...............

5> The vector address of RST 7.5 is ............

ANS: 003C (multiply 7.5 by 8 and convert to hex)

6> int b = 0xAA;
b>>4;
printf("%x",b);

What is the output of the above program....

7> struct s1 { struct { struct {int x;}s2}s3}y;

How to access x? ANS: y.s3.s2.x

8> Why there is no recursion in Fortran?

ANS: There is no dynamic allocation

9> What is the worst case complexity of Quick sort?

ANS: O(n^2)

10> Quick sort uses..............

Ans: Divide and conquer

11> In a sequential search, the time it takes to search through n elements is

12> What is the size of the array declared as double * X[5]

ANS: 5* sizeof (double *)

13> A binary search tree is given and asked to write the preorder traversal
result.

14> If size of the physical memory is 2^32-1, then the size of virtual
memory......

15> S-> A0B
A-> BB|0
B-> AA|1 How many strings of length 5 are possible with the above
productions??

16> (3*4096+15*256+3*16+3). How many 1's are there in the binary
representation
of the result.

ANS: 10

17> In memory mapped I/O how I/O is accessed.............

ANS: Just like a memory location (Means, I/O devices can be accessed
using
the instructions like mov A,M etc...)

18> What is the use of ALE in 8085.......

ANS: To latch the lower byte of the address.

19> If the logical memory of 8 X 1024 is mapped into 32 frames, then the
number
of bits for the logical address ......

ANS: 13

20> Context free grammar is useful for...

ANS: If-then structures.

21> In ternary number representation, numbers are represented as 0,1,-1. Here
-1 is represented as - (1 bar). Then how is 352/9 represented......
1

22> There are processors which take 4,1,8,1 machine cycles respectively. If
these are executed in round robin fashion with a time quantum of 4, what is
the
time it take for process 4 to complete....

ANS: 9

23> The minimum frequency of operation is specified for every processor
because......

24> In memory mapped I/O, what will happen if a device is identified with a
16
bit address and enabled by memory related control signals.....

25> The reason for preferring CMOS over NMOS is....

Ans: Low power consumption.

26> Two binary numbers A,B are given and asked to find out A-B.

27> Each character is represented by 7 bits, 1 bit is used to represent error
bit and another bit for parity. If total number of bits transmitted is
1200bits, then number of symbols that can be transmitted.......

28> One question about the setassociativity of cache..

29> Write the postfix form of the following expression...

A+[[(B+C)+(D+E)*F]/G]

30> What is the function of the linker......

31> void f(int y)
{
struct s *ptr;
ptr = malloc (sizeof (struct)+ 99*sizeof(int));
}

struct s{
int i;
float p;
};

when free(ptr) is executed, then what will happen??

all the best...

____________________________________________________________________

CISCO ISI

cisco paper

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).

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

all the best...

CISCO PREVIOUS PAPER

PREVIOUS PAPER

1> The starting location of an array is 1000. If the array[1..5/...4] is
stored
in row major order, what is the location of element [4][3]. Each work
occupies
4 bytes.

2> If the number of leaves in a binary tree are N, then the total number of
internal nodes........(Assume complete binary tree)

ANS: N-1

3> The locality of reference means.............

4> If two ausigned 8 bit numbers are multiplied what is the memory space
required...............

5> The vector address of RST 7.5 is ............

ANS: 003C (multiply 7.5 by 8 and convert to hex)

6> int b = 0xAA;
b>>4;
printf("%x",b);

What is the output of the above program....

7> struct s1 { struct { struct {int x;}s2}s3}y;

How to access x? ANS: y.s3.s2.x

8> Why there is no recursion in Fortran?

ANS: There is no dynamic allocation

9> What is the worst case complexity of Quick sort?

ANS: O(n^2)

10> Quick sort uses..............

Ans: Divide and conquer

11> In a sequential search, the time it takes to search through n elements is

12> What is the size of the array declared as double * X[5]

ANS: 5* sizeof (double *)

13> A binary search tree is given and asked to write the preorder traversal
result.

14> If size of the physical memory is 2^32-1, then the size of virtual
memory......

15> S-> A0B
A-> BB|0
B-> AA|1 How many strings of length 5 are possible with the above
productions??

16> (3*4096+15*256+3*16+3). How many 1's are there in the binary
representation
of the result.

ANS: 10

17> In memory mapped I/O how I/O is accessed.............

ANS: Just like a memory location (Means, I/O devices can be accessed
using
the instructions like mov A,M etc...)

18> What is the use of ALE in 8085.......

ANS: To latch the lower byte of the address.

19> If the logical memory of 8 X 1024 is mapped into 32 frames, then the
number
of bits for the logical address ......

ANS: 13

20> Context free grammar is useful for...

ANS: If-then structures.

21> In ternary number representation, numbers are represented as 0,1,-1. Here
-1 is represented as - (1 bar). Then how is 352/9 represented......
1

22> There are processors which take 4,1,8,1 machine cycles respectively. If
these are executed in round robin fashion with a time quantum of 4, what is
the
time it take for process 4 to complete....

ANS: 9

23> The minimum frequency of operation is specified for every processor
because......

24> In memory mapped I/O, what will happen if a device is identified with a
16
bit address and enabled by memory related control signals.....

25> The reason for preferring CMOS over NMOS is....

Ans: Low power consumption.

26> Two binary numbers A,B are given and asked to find out A-B.

27> Each character is represented by 7 bits, 1 bit is used to represent error
bit and another bit for parity. If total number of bits transmitted is
1200bits, then number of symbols that can be transmitted.......

28> One question about the setassociativity of cache..

29> Write the postfix form of the following expression...

A+[[(B+C)+(D+E)*F]/G]

30> What is the function of the linker......

31> void f(int y)
{
struct s *ptr;
ptr = malloc (sizeof (struct)+ 99*sizeof(int));
}

struct s{
int i;
float p;
};

when free(ptr) is executed, then what will happen??

CISCO PAPERS

Updates by date

CISCO PREVIOUS PAPERS