Cisco Placement Paper : Cisco Placement Paper Latest 2013
Cisco Placement Paper : Cisco Placement Paper Model questions 15 November 2012
Cisco Placement Paper : Cisco Placement Paper Bangalore Marathahalli Cisco Office 20 January 2012
Cisco Placement Paper : Cisco Placement Paper CDAC-ACTS PUNE 12 January 2012
Cisco Placement Paper : Cisco Placement Paper Chennai 16 September 2012
Cisco Placement Paper : Cisco Whole Testpaper
CISCO PLACEMENT PAPER ON 16th DECEMBER AT BANGALORE
Hai Guys,
I attend this paper on dec16
The written test consists of 50 questions in 60 minutes there may be different sets.
1-6 on quantitative problems very easy on basics
7-11 on general English a passage will be given and 4 sentences will be given as ans whether the data is sufficient, not sufficient, correct conclusion, full information not given.
12-22 picture reasoning such as guess the fifth one from the four figures
23-30 missing letters in a sequence of letters very easy.
<!--[if !supportLists]-->31-40 <!--[endif]-->two reasoning questions r given with some q below
41-50 some quantitative problems,3 qs on linux pl/sql ,c lang r given
2. Binary sort explain line by line
3. Insertion sort how does it differ from binary sort explain line by line (they provide rough sheets)
4. OSI layers and functions
5. Microcroprocessors
6. Tress, program on insertion of node in single linked list
7. Pre order, inorder,post order explain with examples
8. Sliding window protocol explain
9. Write the of a c program for printing numbers into words such as 123 (one hundred and twenty three)
10. About my project fully explained and its applications and some qs on that
11. Why cisco
12. What u know abt cisco
It has taken 1 hr 15 min to complete the techinal round And in hr its simple no qs for me they will explain abt the company
Cisco Placement Paper : Cisco Whole Testpaper
Cisco Placement Paper : Cisco Aptitude - General
Some Sample questions (m.tech.) tech.--24, apti.--20
On cmos power( formula- P=CV*Vf
Lowest noise margin in which logic family--
a) TTL b) CMOS c) biCMOS d) all have same
If CMOS has tr(rise time)=tf.find Wp/Wn. given beta(n)=2*beta(p)
gm of a transistor is proportional to
a)Ic b)Vt c)1/Vt d)none
If A and B are given in 2,s complement find A-B in decimal.
Set up time,hold time ,clock to Q delay time (very important)
.3 questions on opamp (transfer function)(2 marks each)
2 questions on sequence detector (2 marks each)
Logic function boolean expressions(true/false) (3 question-1 mark each)probabily all false
In I/O mapped how do you represent memory(1 mark)
The design of FSM(finite state machine) will--
a) increase time of design
b) increase delay
c) increase power
d) all of the above
K-map minimization
Phase locked loop(PLL) 1 question sachin
Cisco Placement Paper : Cisco Technical - Other
analytical questions
find perimeter of a trapezium wit 3 sides given and distance b/w parallel sides given...
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..
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
difference b/w the perimeteres of two concentric circles is 66.find the difference b/w radius..
ans 10.5
3/p=6,3/q=15......find p-q
Technical questions.....
#define clrscr() 100
main()
{
clrscr();
printf("%d",clrscr());
}
which of the followin is used for avoidin network congestion
bufferin
cachin
sourcequench
all of de above
main()
{
int a;
printf("%d",scanf(%d,&a));
}
wats o/p of this pgm..wat will b printed
ans :0
main()
{
printf("as");
printf("\bhi");
printf("is\n");
} wat will b printed.
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
arrays base address is 1000....array is a[5][4]..then wat is de
correct address of a[4][3]...
ans:1056
one packet is 64bytes..no of pkts send is 16000..then total no of bytes send is
ans 1024000
#define maxval 5
int main (void)
{
int i=1;
if(i-maxval)
{
printf("inside");
}
else
{
printf("out");
}
find o/p???
#define a 3+3
#define b 11-3
main()
{
printf("%d",a*b);
}
wat is o/p?????
A question in which segment address is given ..logical address is 800..base addresses also given ..u hav 2 find physical address..
There was a question on processor speed in nanocycles..then it performs a instruction in x cycles..dont remember
main()
{
int *i;
int s=(int *)malloc(10*sizeof(int));
for (i=0;i<10;i++)
{
printf("%d",i*i)
}
wats o/p
Cisco Placement Paper : Cisco Aptitude - General
Sample Question Paper
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.
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
The locality of reference means.............
If two ausigned 8 bit numbers are multiplied what is the memory space required...............
The vector address of RST 7.5 is ............
ANS: 003C (multiply 7.5 by 8 and convert to hex)
int b = 0xAA;
b>>4;
printf("%x",b);
What is the output of the above program....
struct s1 { struct { struct {int x;}s2}s3}y;
How to access x? ANS: y.s3.s2.x
Why there is no recursion in Fortran?
ANS: There is no dynamic allocation
What is the worst case complexity of Quick sort?
ANS: O(n^2)
Quick sort uses..............
Ans: Divide and conquer
In a sequential search, the time it takes to search through n elements is
What is the size of the array declared as double * X[5]
ANS: 5* sizeof (double *)
A binary search tree is given and asked to write the preorder traversal result.
If size of the physical memory is 2^32-1, then the size of virtual memory......
S-> A0B
A-> BB|0
B-> AA|1 How many strings of length 5 are possible with the above productions??
(3*4096+15*256+3*16+3). How many 1,s are there in the binary representation of the result.
ANS: 10
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...)
What is the use of ALE in 8085.......
ANS: To latch the lower byte of the address.
If the logical memory of 8 X 1024 is mapped into 32 frames, then the number of bits for the logical address ......
ANS: 13
Context free grammar is useful for...
ANS: If-then structures.
In ternary number representation, numbers are represented as 0,1,-1. Here -1 is represented as - (1 bar). Then how is 352/9 represented......
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
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