Cisco Placement Preparation Contributed by Jins updated on May 2019

" Mock tests based on latest pattern followed by company


" Fully solved Test  with answer and explanation


" Test Analytics and customized reports to evaluate performance


" Assess selection probability before the Cisco recruitment drive


" Mostly asked Cisco Technical / HR interview questions and best answers


" Start your preparation now for Cisco

 

Practice

Mock Test

Cisco Placement Paper 1

Cisco Placement Paper 2

Cisco Placement Paper 3

Cisco Placement Paper 4

 



Cisco latest recruitment process-Writtent test ,Technical interview Questions

Cisco Job Interview Placement paper pattern

No of rounds:3

No of questions:50

Time limit:60 Minutes

Question type: Objective

Cisco campus recruitment writen Test pattern

1Written Test:

Cisco written test Aptitude and reasoning

a)20 questions Aptitude and Reasoning

The Questions Were Mainly Based On Aptitude Based Problems Like Age, Series, Permutation And Combination, Average, Train, Time And Work, And Time And Distance Based Problems

Probability in depth, Permutation and combination CAT level, Sets and Relations

Cisco Technical Questions

b)30 questions Technical section

Questions based on C,C++,java,Data Structures

Networks: 10 questions)

Software Quality Assurance (SQA) : 10 Questions

C++: 15 Questions

Some sample questions asked

Cisco Systems Inc. is an American multinational corporation operating with its headquarters in San Jose, California at the United States. The company is engaged in designing and selling of communication technology, voice, networking, consumer electronics and services. In India, Cisco Systems India was established in the year 1994 with the marketing and sales presence spread across importance cities in the nation.

Recruitment by Cisco:

Cisco recruits candidates either through campus recruitment in colleges or through its own offices in different parts of the nation. Irrespective of the place of recruitment, the company recruits candidates by conducting recruitment examination in the form of written test followed by interview.

Cisco placement exam pattern

CISCO selects technical candidates through written test for a duration of one hour and the question paper for this written examination will have three sections, where in section 1 will be common for all candidates and second and third section will have questions based on the specialization branch of candidates. The first section of the question paper will have questions from the following areas:

• Number representations
• Small numerical
• Virtual memory
• Microprocessor
• Architecture
• Flip flops
• Digital logic design

The second section of the question paper will be devoted for questions from software related areas, while third section is meant for questions from hardware area.

Cisco Previous years question papers:

Candidates, who are going to face Cisco placement examination can practice with the help of the previous years question papers of Cisco placement exam papers

Cisco Technical Interview Questions

TECHNICAL INTERVIEW :
1. ALL basics they asked me
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 questions on that
11. Why cisco
12. What u know about cisco

Cisco Interview Procedure

Interview Procedure :
The written test is followed by a lengthy technical interview. The interview may last up to 1 hour or more. It is entirely technical with questions on all basic fundamentals.

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

 

1.       struct s1 { struct { struct {int x;}s2}s3}y;
How to access x? ANS: y.s3.s2.x

 

2.       Why there is no recursion in Fortran?
ANS: There is no dynamic allocation
 

3.       What is the worst case complexity of Quick sort?
ANS: O(n^2)
 

4.       Quick sort uses..............
Ans: Divide and conquer
 

5.        In a sequential search, the time it takes to search through n elements is

 

6.       What is the size of the array declared as double * X[5]
ANS: 5* sizeof (double *)

 

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

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

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

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

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

12.    What is the use of ALE in 8085.......
ANS: To latch the lower byte of the address.
 

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

14.   Context free grammar is useful for...
ANS: If-then structures.
 

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

 

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

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

 

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

 

19.   The reason for preferring CMOS over NMOS is....
Ans: Low power consumption.
 

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

 

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

22.   One question about the setassociativity of cache..
 

23.   Write the postfix form of the following expression...
A+[[(B+C)+(D+E)*F]/G]
 

24.   What is the function of the linker......
 

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



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 

feedback