 Related Questions
C
If Link list is used to implement a stack what operations should be implemented :
A. insert front, delete front
B. insert front, delete rear
C. insert rear, delete front
D. none of these Link list is implemented as a structure (data, link *), How is pointer moved to the next node, cursor points to the present node.
A. cursor == cursor->link
B. cursor ++
C. ++ cursor
D. none of these Tags : Pointer Latest Answer : a ... ACL stands for
A. access central limit
B. access control limit
C. access control list
D. Both A and B Latest Answer : OSI 7 model in decreasing order1. Application2. Presentation3.Session4. Transport5.Network6.Datalink (Data Difinition Language, Data Manuplation Language).7.Physical ... In queue where do you insert a data?
A. front
B. rear
C. middle
C program code
int zap(int n)
{
if(n<=1) then zap=1;
else zap=zap(n-3)+zap(n-1);
}
then the call zap(6) gives the values of zap
A. 8
B. 9
C. 6
D. 12
E. 15 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 Latest Answer : LIFO ( Last In First Out ) ...
D
Latest Answer : (d) tree ...
Sponsored Links
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1 
0