-
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