CISCO: ANALYTICAL
In a puzzle solving problem puzzle A was solved by 67, B by 46 and C by 40 candidates.
28 solved both A and B, 8 solved both B and C, 26 both A and C. 2 solved all three.
1) How many solved A but not B and C?
4 9 12 11
2) How many B but not A and C
8 18 28 39
3) 100 examinees appear for 2 tests. 76 passed in eng and 74 in science. 60 passed both.
How many failed in both subjects?
4 6 8 10
4) 450 play tennis, 240 billiard and 180 golf. 120 play both tennis and golf. 150both
tennis and billiard. If none of them play both billiards and golf, and/or all the three
games, find the number of members in the club.
200 360 480 600
5) A fair attended by 400 people, 140 attended cultural, 370 visited food stalls. How
many visited both cultural and food stalls?
110 180 230 460
In an art gallery, 12 paintings A, B, C, D, E, F…L are to be displayed in 12 different
slots. The slots are on either side of a long corridor with 6 slots on each side. Slot 1 is
opposite slot 7, 2 is opposite to 8 and so on. The arrangement of paintings is such that K
is in the same row as D, D is opposite to H which is exactly between E and F. C is
opposite to I which is exactly in between B and F. A is in slot 1. A is diagonally opposite
to B, which is opposite to J.
6) which is in slot 6?
A G J L
7) which is in between I and H?
A F I L
8) how many arrangements are possible?
1 2 3 4
9)which is in slot 12?
A B L K.
Directions for qs. 10-14.
1 if the question can be answered by statement 1 alone.
2 if question by statement by 2 alone.
3 if question can be answered by both statements, but not with the help of either of them
independently.
4, if can not be answered at all.
10) R lends some money to P at compound interest(compounded yearly). How much
interest does he receive in the third year?
1 Rate of interest = 10%
2 Interest in 4th year - Interest in 3rd year = Rs 1805.
1 2 3 4
11) A begger is counting his collection for the day. He has only 50 paise and Re 1 coins.
Does he have more of 50 paise coins?
1 His total collection for the day is Rs 30.
2. The value of all Re 1 coins is less than the value of all 50 paise coins.
1 2 3 4
12) there are 21 children. 9 are boys and 12 are girls. If one of the children is randomly
selected, what is the probability that the child is a boy who is not a student?
1 of the boys, 4 are students.
2 of the girls 5 are students.
1 2 3 4
13) Are triangles LMN and XYZ are congruent?
1 LMN and XYZ have equal bases and equal heights.
2 Both triangles are isosceles.
1 2 3 4
14) Does line A pass through origin of the co ordinate plane?
1. A passes through (2,0)
2. a is perpendicular to the Y axis.
1 2 3 4
15) A box contains some red, black and green balls. No. of red balls are 4/5 of black
balls. No. of green balls is ¾ the no of black balls. There are 470 balls. How many
are black?
184 200 316 354
Directions for qs. 16-20
In a certain code, the symbol for 0 is * and that for 1 is $. Numbers greater than 1 are to
be written only by using the two symbols given above. The value of symbol for 1 doubles
everytime it shifts one place to the left (eg. 4 is written as $**; 3 as $$ )
16) 460
$*$$*$*$$
$$$**$$**
$*$******
$******$
17) 17 x 2 / 16 x 4 / 5 x 2 + 6 / 10
$** $$ $$* $***
18) value of LCM (12, 14, 18)
$*******
$*$*****
$$$*****
$$$$$$**
19) Average of ($**, $*$, $**$)
*
$
$$*
$*$
20) Value of (33 + 43 + 32) / 52
$**
$$$
$$$$***
$$$$$*$*$
Directions for qs. 21-25
A big cube is divided into smaller cubes. The middle cubes on all the four edges of the
top layer are divided into eight smaller cubes each. The entire is then painted black.
21) How many smaller cubes are painted black on more than 3 faces?
0 4 8 12
22) How many smaller cubes are painted black on only 3 faces?
0 4 8 12
23) How many smaller cubes are painted black on only 2 faces?
4 8 12 16
24) how many smaller cubes are painted on only 1 face?
18 20 22 24
25) how many smaller cubes are not painted black at all?
1 3 6 9.
TECHNICAL
40 qs are there in technical, questions on diodes were there, such as PIV of center tapped.
Band gap of Silicon, what type of bonding in semiconductors and related to these. These
are too easy. Just have a look at the BTech/GATE level basics. NO questions were of
high funda.
There was a section on eletromagnetics and electrdynamics. I can not remember the
questions. 10 questions were there. But I think that they were basics in that field.
This is for electrical part. I don’t have any idea about computer science part.
Sunday, May 6, 2007
CISCO INTERVIEW CHENNAI
Ist round
1. Is windows/linux is preemptive or not(kernel).
2. Is the sheduler is a process or not.
3.What is the meaning of enabling kerenel level threading
4. What do you mean by allowing kernel preemption
5.What is the meaning of 8/16/32 bit operationg system
6. How interrupts will be handled in operating system
7.Why swapspace is required in operating system
8.how come a swapspace accessing is faster than normal secondary memory access though swapspace is a part of secondary memory.
9.What is the concept of micro kernel architecture
10.Is windows/linux is micro kernel architecture
11.Difference btw multi programming and multi processing
12.What is symmetric and asymmetric multi processing
12.Tell about IRQ's
12.How the devices are managed if more devices are available than IRQ lines
12.How the devices associated with a single IRQ line are managed.
13.How the operating system finds out which device has generated the interrupt in a single IRQ
14.Which ISR is serviced if we get an interrupt from an IRQ connected to more than one device.
13.write an inplace strrev routine
14.Why pointer manipulations are faster
15.
int sum(int a,int b)
{
int s;
s = a + b;
return s;
}
convert this function to a macro......
16.Finding unduplicated element in a list of n elements where n-1 elements are duplicated.
17.Finding the no. of 1's in a binary representation of a number.
18.Two linked lists are given, if the two lists are merging at one point and becoming a single list from that point find out point of merging in linear time.
19.What is the difference btw char *s="iitg"
char s[]="iitg"
like compiler error or runtime error if we try to change the value of that s array
20.Basics in networks
like OSI layers and TCP layers
21.difference between Hub and switch and which layer each one belongs to
22.Is it possible to broadcast using a switch.
23.which is more suitable for broadcasting either a hub or a switch
24.What is class D addressing
25.How a DLL device(switch) knows about multicast addresses.
26.What is the difference between a router and gateway
27.What is the function of Multiport router
28.About Adhoc routing protocols
2 nd round
1.Explain u r project work
2.Explain the routines that executes whenever the system boots up like ROM BIOS routines
3.What is the meaning of Partitioning and formating a disc
4.Is a system can have more than one primary partition
5.If linux and windows coexist which one lies on primary partition of the disk.
6.Which process executes first when os bootsup
7.What is master boot record
8.what is a super block
9.Which layer of networks u r most comfortable with (I told except physical layer I am comfortable with all other layers, then he started asking questions only on physical layer, though, I have answered well)
10.Tell about the significance of physical layer in networks
11.why fiber optics data rate is very high
12.What are advantages of fiber optics over normal copper or co-axial cables
13.Why cross talk and attenuation is insignificant in fiber cables
14. what is total internal reflection in fiber cables
15.what is single mode and multi modes in iptical fibers
16.Did u ever installed two windows versions on the same logical drive
17. Some questions on project
3 rd round(HR just for the formality)
1.Tell about u r self
2.Tell about any extra curricular activities and any significant work u have done in the past 2 years
3.Will u leave CISCO if some other company pays u high package
4.How can we believe in u r loyality towards the company
5.Any questions
How far CICSO is an R&D company
CISCO culture and employee values
1. Is windows/linux is preemptive or not(kernel).
2. Is the sheduler is a process or not.
3.What is the meaning of enabling kerenel level threading
4. What do you mean by allowing kernel preemption
5.What is the meaning of 8/16/32 bit operationg system
6. How interrupts will be handled in operating system
7.Why swapspace is required in operating system
8.how come a swapspace accessing is faster than normal secondary memory access though swapspace is a part of secondary memory.
9.What is the concept of micro kernel architecture
10.Is windows/linux is micro kernel architecture
11.Difference btw multi programming and multi processing
12.What is symmetric and asymmetric multi processing
12.Tell about IRQ's
12.How the devices are managed if more devices are available than IRQ lines
12.How the devices associated with a single IRQ line are managed.
13.How the operating system finds out which device has generated the interrupt in a single IRQ
14.Which ISR is serviced if we get an interrupt from an IRQ connected to more than one device.
13.write an inplace strrev routine
14.Why pointer manipulations are faster
15.
int sum(int a,int b)
{
int s;
s = a + b;
return s;
}
convert this function to a macro......
16.Finding unduplicated element in a list of n elements where n-1 elements are duplicated.
17.Finding the no. of 1's in a binary representation of a number.
18.Two linked lists are given, if the two lists are merging at one point and becoming a single list from that point find out point of merging in linear time.
19.What is the difference btw char *s="iitg"
char s[]="iitg"
like compiler error or runtime error if we try to change the value of that s array
20.Basics in networks
like OSI layers and TCP layers
21.difference between Hub and switch and which layer each one belongs to
22.Is it possible to broadcast using a switch.
23.which is more suitable for broadcasting either a hub or a switch
24.What is class D addressing
25.How a DLL device(switch) knows about multicast addresses.
26.What is the difference between a router and gateway
27.What is the function of Multiport router
28.About Adhoc routing protocols
2 nd round
1.Explain u r project work
2.Explain the routines that executes whenever the system boots up like ROM BIOS routines
3.What is the meaning of Partitioning and formating a disc
4.Is a system can have more than one primary partition
5.If linux and windows coexist which one lies on primary partition of the disk.
6.Which process executes first when os bootsup
7.What is master boot record
8.what is a super block
9.Which layer of networks u r most comfortable with (I told except physical layer I am comfortable with all other layers, then he started asking questions only on physical layer, though, I have answered well)
10.Tell about the significance of physical layer in networks
11.why fiber optics data rate is very high
12.What are advantages of fiber optics over normal copper or co-axial cables
13.Why cross talk and attenuation is insignificant in fiber cables
14. what is total internal reflection in fiber cables
15.what is single mode and multi modes in iptical fibers
16.Did u ever installed two windows versions on the same logical drive
17. Some questions on project
3 rd round(HR just for the formality)
1.Tell about u r self
2.Tell about any extra curricular activities and any significant work u have done in the past 2 years
3.Will u leave CISCO if some other company pays u high package
4.How can we believe in u r loyality towards the company
5.Any questions
How far CICSO is an R&D company
CISCO culture and employee values
Saturday, May 5, 2007
CISCO 2000
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...
____________________________________________________________________
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...
____________________________________________________________________
CISCO ISI
cisco paper
held in ISI on 5th august.
20 questions - analytical
40 questions - system concepts and c.
i am giving some question in both sections.
analytical section.
1.12 quantative questions
2.4 meanings
3.4 matching(like goat::rat)
1.what is the length of the largest diagonal in a cube of 1unit.
ans:2*sqrt(3).
3.one of the digits of a two digit number is 6,whose sum is half of there
product and whose product of the half of the reverse order number.what is
the number.
ans:63
4.how many times 0.01 is larger than (0.0001)*(0.0001)
ans:10**6.
5.a train of length 200mts is moving with a velocity of 100km/hr towards
east.a car is comming with a velocity of 72km/hr in the opposite
direction.how much time the car takes to cross the train.
6.canibalism-
7.humino::static
ans:human::--
8.concrete::abstract
ans:matter::mind
9.elevator-above
10.ramesh,robert,ravi,rahul r doing newpaper business.....
ans:ramesh,either ravi/rahul
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<10;i++);
{
j=j+1;
}
printf("%d %d",i,j);
ans:10 11
12.static char *i;
i=malloc(sizeof(char));
find the error;
ans:malloc returns void
13.virtual memory address capacity depends on--
14.main()
{ int i=1;
fork();
fork();
fork();
printf("%d",i);
}
how many times i will be printed
ans:8
15.question on threads
16.int i=0xaa
char *p;
p=(char *)i;
p=p>>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
all the best...
held in ISI on 5th august.
20 questions - analytical
40 questions - system concepts and c.
i am giving some question in both sections.
analytical section.
1.12 quantative questions
2.4 meanings
3.4 matching(like goat::rat)
1.what is the length of the largest diagonal in a cube of 1unit.
ans:2*sqrt(3).
3.one of the digits of a two digit number is 6,whose sum is half of there
product and whose product of the half of the reverse order number.what is
the number.
ans:63
4.how many times 0.01 is larger than (0.0001)*(0.0001)
ans:10**6.
5.a train of length 200mts is moving with a velocity of 100km/hr towards
east.a car is comming with a velocity of 72km/hr in the opposite
direction.how much time the car takes to cross the train.
6.canibalism-
7.humino::static
ans:human::--
8.concrete::abstract
ans:matter::mind
9.elevator-above
10.ramesh,robert,ravi,rahul r doing newpaper business.....
ans:ramesh,either ravi/rahul
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<10;i++);
{
j=j+1;
}
printf("%d %d",i,j);
ans:10 11
12.static char *i;
i=malloc(sizeof(char));
find the error;
ans:malloc returns void
13.virtual memory address capacity depends on--
14.main()
{ int i=1;
fork();
fork();
fork();
printf("%d",i);
}
how many times i will be printed
ans:8
15.question on threads
16.int i=0xaa
char *p;
p=(char *)i;
p=p>>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
all the best...
CISCO PREVIOUS PAPER
PREVIOUS 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)
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??
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??
Subscribe to:
Posts (Atom)