Test Paper :5
Paper Type : Technical - Other
Posted By : admin



Cisco test Conducted on 17th sunday october at bangalore there were almost 40 technical questions and 10 analytical questions..total 50 questions..

analytical questions

1.

find perimeter of a trapezium wit 3 sides given and distance b/w parallel sides given...
2.

A triangle ABC is given, a line DE is paralel to base side and that cuts the triangle.. the ratio of area of triangle to the area of trapezium .given DE/BC=3/5..
3.

four concentric circles r given .the radius of 1st circle is x.next is 2x,then 3x and 4x. given that area b/w 2nd and 1st is A and 4th and 3rd circles being B.find ratio of A to B
4.

difference b/w the perimeteres of two concentric circles is 66.find the difference b/w radius..
ans 10.5
5.

3/p=6,3/q=15......find p-q

Technical questions.....
6.

#define clrscr() 100
main()
{
clrscr();
printf("%d",clrscr());
}
7.

which of the followin is used for avoidin network congestion
bufferin
cachin
sourcequench
all of de above
8.

main()
{
int a;
printf("%d",scanf(%d,&a));
}
wats o/p of this pgm..wat will b printed
ans :0
9.

main()
{
printf("as");
printf("bhi");
printf("isn");
} wat will b printed.
10.

main()
{
unsigned short a=-1;
unsigned char b=a;
printf("%d %d ",a,b);
}
wat is o/p of the program
a. 65535 -1
b. 65535 65535
c. -1 -1
11.

arrays base address is 1000....array is a[5][4]..then wat is de
correct address of a[4][3]...
ans:1056
12.

one packet is 64bytes..no of pkts send is 16000..then total no of bytes send is
ans 1024000
13.

#define maxval 5
int main (void)
{
int i=1;
if(i-maxval)
{
printf("inside");
}
else
{
printf("out");
}
find o/p???
14.

#define a 3+3
#define b 11-3
main()
{
printf("%d",a*b);
}
wat is o/p?????
15.

A question in which segment address is given ..logical address is 800..base addresses also given ..u hav 2 find physical address..
16.

There was a question on processor speed in nanocycles..then it performs a instruction in x cycles..dont remember
17.

main()
{
int *i;
int s=(int *)malloc(10*sizeof(int));
for (i=0;i<10;i++)
{
printf("%d",i*i)
}
wats o/p

Test Paper :6
Paper Type : Aptitude - General
Posted By : admin



Sample Question 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......

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??

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

Test Paper :7
Paper Type : Whole Testpaper
Posted By : Jaic

CISCO PLACEMENT PAPER

CAUTION: There is a -ve marking of +1 & -1 u dont mark blindly.Mark the

answer if u know exactly.cutoff will be 25 marks out of 60.So becareful.

There r 2 sections in CISCO

section 1: Aptitude 20 marks (10 aptitude,10analogy,oppositewords etc))

section 2:comp sc (data structue , c, theory of computation,networks,operating systems)

I collected upto 20 questions;

In this setion questions exact numbers I have forgotten.So this will be useful to the style of the problem only.

SECTION 1:

1: A man went to market with some money.With that money he can buy 15 pencils or 25 pens.He kept 15% of that money for bus fare and with rest of the money he purchased 5 pencils,and 'x' pens.How many pens he purchased?

2:A man climbing a wall.For every 4 steps go up he will slipdown 2 steps.If he takes 12 min to 3 steps.how much time it takes to climb 48
meters and one step=2meters.

3: Two trains with lengths x and y ,and speeds u and v.Approaching each other how much time it takes to takes for faster train to cross other
train?

In this question I don't remember the x,y,u,v.U can find formula in Aggarwal's quantitative aptitude book

4: there was some question on ages that was easy

SECTION 2:

1. main()

{ fork();

fork();

fork();

printf("hello");

}

How many times it will print hello?

2: char A[5,6] How many bytes it requires?

3:Bridges are used in which layer?

4.Bigendian means

a)lower byte stored in lower address

b)lower byte stored in higher address

one of these is correct.u can verify in Any micro processor book.

5: #define mmx 10+10
printf"%d",mmx*mmx);

6: main()

{ j=0

for(i=0;i<10;i++)

{ j+=i; }

}

what is the value of i & j at the end of the loop

ans: 10,46

7: Regular expression with 2 consecutive 1's and all string of 0's and 1's

8: dead lock conditions 1 question

9: selective repeat widow size of sender & receiver 1 question.

10;Balanced trees 1 question