Home 

Job Placement Papers (All Companies) 

Placement Papers>>CISCO  
CISCO Job Placement PaperCisco 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) 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 ............
6. int b =
0xAA;
7. struct
s1 { struct { struct {int x;}s2}s3}y; 8.
Why there is no recursion in Fortran? 9.
What is the worst case complexity of Quick sort? 10.
Quick sort uses.............. 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] 13. A binary search tree is given and asked to write the preorder traversal result. 14. If size of the physical memory is 2^321, then the size of virtual memory...... 15.
S> A0B 16.
(3*4096+15*256+3*16+3). How many 1's are there in the binary
representation of the result. 17.
In memory mapped I/O how I/O is accessed............. 18.
What is the use of ALE in 8085....... 19.
If the logical memory of 8 X 1024 is mapped into 32 frames, then the
number of bits for the logical address ...... 20.
Context free grammar is useful for... 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.... 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.... 26. Two binary numbers A,B are given and asked to find out AB. 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... 30. What is the function of the linker...... 31.
void f(int y) system concepts: 1.
int a[5,6] 2.
char p[6]; 3.
using LFU algorithm,how many page faults will occur of the pages r 4.
in which layer the bridges r used. 5.
#define d 10+10 6.
in a complete binary tree if the number of levels r 4 then the number
of 7.
if we delete a node from a balanced binary tree,how can we retain the 8. in a kway search tree with N keys, the number of node/no. of leaves= 9.
s>A0B 10.
in which of the following regular expression the srting contains
11. int i,j=1;
12. static char
*i; 13. virtual memory address capacity depends on
14. main()
15. question on
threads
16. int i=0xaa
17. union
18. enum{sunday=1,monday,...saturday}
19. struct x{ 20.
struct *s;
21. one
alogrithm is given: 22.
func()


Contribute content or training reports / feedback /
Comments 