Placement Papers - Cisco

CISCO Sample Question Paper (J2EE Framework)
Posted by :
Ashwini
(11)
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
The minimum frequency of operation is specified for every processor because......
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.....
The reason for preferring CMOS over NMOS is....
Ans: Low power consumption.
Two binary numbers A,B are given and asked to find out A-B.
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.......
One question about the setassociativity of cache..
Write the postfix form of the following expression...
A+[[(B+C)+(D+E)*F]/G]
What is the function of the linker......
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:
int a[5,6]
how much memory will be allocated char p[6];
char *d[10];
ans:d=(char*)p using LFU algorithm,how many page faults will occur of the pages r
1,2,1,3,4.
ans:1,4 in which layer the bridges r used.
a)data link layer
b)session layer
c)physical layer
d)network layer
#define d 10+10
main()
{ printf("%d",d*d);
} in a complete binary tree if the number of levels r 4 then the number of
nodes will be, 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. in a k-way search tree with N keys, the number of node/no. of leaves= s->A0B
A->BB|1
B->AA|0
how many string can be constructed with length 5. in which of the following regular expression the srting contains
atleast 2 concetive 1\'s.
ans:(0+10)*||(0+1)* int i,j=1;
for(i=0;i<10;i++);
{
j=j+1;
}
printf("%d %d",i,j);
ans:10 11
static char *i;
i=malloc(sizeof(char));
find the error;
ans:malloc returns void
virtual memory address capacity depends on--
main()
{ int i=1;
fork();
fork();
fork();
printf("%d",i);
}
how many times i will be printed
ans:8
question on threads
int i=0xaa
char *p;
p=(char *)i;
p=p>>4;
printf("%x",p);
ans:0x000000a;
union
{ char *p;
int i;
char b;
}
main()
{
--
p=(char*)malloc(8*sizeof(char));
}
what is the size of union?
enum{sunday=-1,monday,...saturday}
printf("%d %d",sizeof(wednesday),wednesday);
struct x{
struct{
struct{
char ch;
} x;
}};
ans:definition wrong
struct *s;
s=(struct *)malloc(10*sizeof(struct)+90*sizeof(int));
free(s);
ans:total memory deallocated
one alogrithm is given:
ans:10395
func()
{ int x=1;
if(x=1)
x=1000;
else
x=10;
return x;
}
what is the return value?
ans:1000
ANS: 9
The minimum frequency of operation is specified for every processor because......
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.....
The reason for preferring CMOS over NMOS is....
Ans: Low power consumption.
Two binary numbers A,B are given and asked to find out A-B.
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.......
One question about the setassociativity of cache..
Write the postfix form of the following expression...
A+[[(B+C)+(D+E)*F]/G]
What is the function of the linker......
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:
int a[5,6]
how much memory will be allocated char p[6];
char *d[10];
ans:d=(char*)p using LFU algorithm,how many page faults will occur of the pages r
1,2,1,3,4.
ans:1,4 in which layer the bridges r used.
a)data link layer
b)session layer
c)physical layer
d)network layer
#define d 10+10
main()
{ printf("%d",d*d);
} in a complete binary tree if the number of levels r 4 then the number of
nodes will be, 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. in a k-way search tree with N keys, the number of node/no. of leaves= s->A0B
A->BB|1
B->AA|0
how many string can be constructed with length 5. in which of the following regular expression the srting contains
atleast 2 concetive 1\'s.
ans:(0+10)*||(0+1)* int i,j=1;
for(i=0;i<10;i++);
{
j=j+1;
}
printf("%d %d",i,j);
ans:10 11
static char *i;
i=malloc(sizeof(char));
find the error;
ans:malloc returns void
virtual memory address capacity depends on--
main()
{ int i=1;
fork();
fork();
fork();
printf("%d",i);
}
how many times i will be printed
ans:8
question on threads
int i=0xaa
char *p;
p=(char *)i;
p=p>>4;
printf("%x",p);
ans:0x000000a;
union
{ char *p;
int i;
char b;
}
main()
{
--
p=(char*)malloc(8*sizeof(char));
}
what is the size of union?
enum{sunday=-1,monday,...saturday}
printf("%d %d",sizeof(wednesday),wednesday);
struct x{
struct{
struct{
char ch;
} x;
}};
ans:definition wrong
struct *s;
s=(struct *)malloc(10*sizeof(struct)+90*sizeof(int));
free(s);
ans:total memory deallocated
one alogrithm is given:
ans:10395
func()
{ int x=1;
if(x=1)
x=1000;
else
x=10;
return x;
}
what is the return value?
ans:1000
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers