Cisco 2000
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......
1
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??
all the best...
____________________________________________________________________
HOME
YEAR N ORG
- C++ (1)
- CISCO 2000 (1)
- CISCO IN ISI (1)
- CISCO SELECTION PROCEDURE (1)
- CTS-JUNE-2005 (1)
- GD TIPS (1)
- GE-NIT-CALICUT-06 (1)
- HCL 1995 (1)
- HCL INTERIVIEW (1)
- HUGHES - 2003 (1)
- HUGHES DELHI 1997 (1)
- HUGHES-26/12/03 (1)
- I'VIE QNS TECH COMP (1)
- I'VIEW HOW TO DRESS (1)
- I'VIEW QNS AT EBAY (1)
- I'VIEW QNS ON C (1)
- I'VIEW QNS ORACLE (1)
- I'VIEW TIPS (TEAM) (1)
- I'VIEW TIPS 1 (2)
- I'VIEW TIPS 2 (1)
- I'VIEW TIPS 3 (1)
- I'VIEW TIPS 5 (1)
- I'VIEW WAY OF ANSWERING (1)
- IBM - 2006 (1)
- INFOSYS DCE DELHI 2K (1)
- INFOSYS 1997 (1)
- INFOSYS 1998 (1)
- INFOSYS CET 2000 (1)
- INFOSYS I'VIEW 05 (1)
- INFOSYS IISC (1)
- INFOSYS IISC 2K (1)
- INFOSYS IISC B'LORE (1)
- INFOSYS IITB 2000 (1)
- INFOSYS IITD 2000 (1)
- INFOSYS IT BHU 2K (1)
- INFOSYS PAPER (1)
- INFOSYS PAPR 97 (1)
- INFOSYS QNS (1)
- INFOSYS QYESTIONS (1)
- INFOSYS TECH LTD (1)
- INFOSYS VJIT 2000 (1)
- INFOSYS-BANGLORE-2006 (1)
- interview tips (1)
- ORACLE CANDIDATE EXP (1)
- ORACLE CHENNAI 13/07/03 (1)
- Oracle OFF CAMP (1)
- ORACLE-2001 (1)
- ORACLE-GUIDANCE (1)
- ORACLE-NITK-11/07/03 (1)
- ORACLE-OF CAMPUS 22/06/06 (1)
- ORACLE-OFCAMP -21/06/03 (1)
- ORACLE-OFCAMP 21/06/03 (1)
- ORACLE-OFCAMP-JULY 2003 (1)
- ORACLE-RECW-2003 (1)
- PATNI 1999 (1)
- RESUME 2 (1)
- RESUME 3 (1)
- RESUME 4 (1)
- RESUME 5 (1)
- RESUME 6 (1)
- RESUME 7 (1)
- SAS (1)
- SASKEN SEP 2003 (1)
- SATYAM 2K3 (1)
- SATYAM 2003 (1)
- SATYAM PAPER (1)
- SATYAM PAPER - GD (1)
- SATYAM PAPER CAND EXP (1)
- SATYAM PATTERN (1)
- SATYAM SAMPLE TEST (1)
- SATYAM2003 (1)
- SQL (1)
- Tcs (1)
- TCS - 2006 (1)
- TCS -JADAVPUR UNI 99 (1)
- TCS 01/07/06 PAPER I'VIEW (1)
- TCS 1998 (2)
- TCS 2000 (1)
- TCS 2003 (1)
- TCS B'LRE 23/09/06CAND EXP (1)
- TCS CAND EXPERIENCE (1)
- TCS CHENNAI 10/12/06 (1)
- TCS COBOL PAPER (1)
- TCS HYD 07/10/06 (1)
- TCS HYD 07/10/06 CAND EXP (1)
- TCS I'VIEW (1)
- TCS MODEL PAPER (1)
- TCS PAPER (1)
- TCS PAPER 1998 (1)
- TCS PAPER 2000 (1)
- TCS PAPER I'VIEW 24/07/06 (1)
- TCS PAPER1 (1)
- TCS PATTERN CAND EXP (1)
- TCS PONDY 02/06/07 I'VIEW (1)
- TCS RANCHI 24/07/06 (1)
- TCS ROORKEE 31/07/97 (1)
- TCS SAMPLE TEST 1 (1)
- TCS SAMPLE TEST 2 (1)
- TCS TALENT TEST 1 (1)
- TCS-HYD-20/10/06 (1)
- TEX TECH TEST 2003 (2)
- TEXAS PAPER 2000 (1)
- TEXAS 1999 (1)
- TEXAS 28/07/08 (1)
- TEXAS CSE 2001 (1)
- TEXAS IISc (1)
- TEXAS IITB (1)
- TEXAS IITK (1)
- TEXAS INSTR PAPER (1)
- TEXAS JADAVPUR 99 (1)
- TEXAS PAPER (1)
- TEXAS REC 2000 (1)
- wipro (1)
- WIPRO 1995 (1)
- WIPRO 1999 (1)
- WIPRO 2000 (1)
- WIPRO 2K (2)
- WIPRO INTERVIEW (1)
- WIPRO INTERVIEW 95 (1)
- WIPRO JULY 1997 (1)
- WIPRO NITDURGAPUR 03 (1)
- WIPRO PAPER 2000 (1)
- WIPRO PROCESS B'LORE (1)
- WIPRO ROORKEE 2K (1)
- WIPRO SAMPLETEST 2 (1)
- WIPRO SAMPLETEST1 (1)
- WIPRO SMAPLETEST 3 (1)
- WIPRO SURAT 2002 (1)
- WIPRO TECH 2000 (1)
Wednesday, April 18, 2007
Cisco 2000
Posted by
pappuagloco
at
2:18 PM
Labels: CISCO 2000
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment