-
Assume a particular CPU works properly with 100 MHz clock. What happens if clock is increased to1000 MHz?
Yogesh
- Dec 15th, 2006
If CPU works properly at 100Mhz then it may not work properly at 1000MHz if it is not designed for 1000 MHz. The moment you feed the 1000MHz it may hang /malfunction coz of overclocking and all transistors in CPU would go in matastable states.
akhileshkesavanunnithan
- Jul 17th, 2006
the answer is as followsthe CPU speed will increases by 10 times the orginal speedbcoz the clock frequency is directly proportional to the cpu speed
-
Which one of the following statements allocates enough space to hold an array of 10 integers that are initialized to 0 ?
a) int *ptr = (int *) calloc(10,sizeof(int)); b) int *ptr = (int *) alloc( 10*sizeof(int)); c) int *ptr = (int *) malloc( 10*sizeof(int)); d) int *ptr = (int *)calloc(10*sizeof(int)); Answered by Ragini rani on 2005-05-13 09:01:56: a is the correct ans Calloc allocates space and initialized them to 0
-
-
Mode of operation of stack ______ A. LIFO B. FIFO C. FCFS D. none of these
RINWAZ
- Oct 13th, 2006
LIFO ( Last In First Out )
-
The equivalent of NAND gate is A. NAD with NOT B. OR with NOT C. NOT with OR
hardik
- Oct 7th, 2006
for NAND gate 0 0 -> 10 1 -> 11 0 -> 11 1 -> 0for OR gate 0 0 -> 00 1 -> 11 0 -> 11 1 -> 1for NOT WITH OR gate 0 0 -> 10 1 -> 11 0 -> 11 1 -> 0SO ANSWER IS C.
-
Add 79H and 86H and tell the contents of flag
-
-
-
-
-
If the angle of incidence is less than angle of critical angle then there is loss in cladding due to A. Rayleigh's scattering B. scattering C. absorption D. bending
Bineet kumar
- Jul 12th, 2005
Answer - A
-
-
-
-
-
What does USB stands for?
universal serial bus
-
Write the program of factorial using recursion?
purani86
- Jun 18th, 2006
fact(n)where fact(int n) is the function with code k = n*fact(n-1) and returns k
-
-
The operation to be performed on a stack using a linked list can be realized using the function A. delete front, insert rear B. insert front, delete rear C. delete front, insert front D. delete rear, insert rear
purani86
- Jun 18th, 2006
We insert or delete at rear end only.so for stack D ins rear and del rear is right
Sarada
- Feb 24th, 2006
Stack is a Last in First Out (LIFO) data structure.So, Insertion and Deletion are made at the same end i.e front end.Any one option should be Insert front,Delete front for Answer.
-
If function t is called what is printed void r(int x ,int y, int &z) { cout <<"r:x="<<x<<"y=",,y <<"z=",,z,,endl; x=x+1; z=y+x; } void t() { int a,b,x; a=20; b=25; x=250; r(a,b,x); r(x,a,b); cout<<"t:a"<<a<<"b="<<b <<"x="<<x<<endl; }
purani86
- Jun 18th, 2006
If function t is called what is printed void r(int x ,int y, int &z){cout <<"r:x="<<x<<"y=",,y<<"z=",,z,,endl;x=x+1;//has no meaning since x is local to fnz=y+x;//has no me...
Languages Interview Questions
Sub Category
Questions
Answers
Last Updated
Ans