Login/RegisterTechnical Interview Questions and Answers :: Wipro
- Select All
- C
- Java
- C++
- SQL
- Informatica
- WebMethod
- DBMS
- Soft. Engineering
- Operating System
- Data Structure
- Oracle PLSQL
- Finite Automata
- HR Question in TR
- Networking
41 / 84
Stack is a sequential datastructure which will follow last in first out (LIFO) rules. The mainly operations of stack are : push pop peer empty and full.
Qeque is also a sequential datastructure which will work on First In First Out(FIFI) . It is the datastructure with restriction that the insertion will be performed from one end and deletion from the another end with help of front and rear. The mainly operations will be performed are : enque and deque operations .
We can implement both by using an array (i.e. static implementation ) and another is using linklist that is dynamic implementation.
42 / 84
By using explicit type casting
43 / 84
No Discussion on this question yet!
44 / 84
Output is Good Morning
(1&&0) evaluates to 0
so !(1&&0) evaluates to 1
and Good Morning is printed.
45 / 84
10
46 / 84
No Discussion on this question yet!
47 / 84
No Discussion on this question yet!
48 / 84
No Discussion on this question yet!
49 / 84
switch(expression)
{
case a:------
break;
case b: -------
break;
default:-----
}
50 / 84
No Discussion on this question yet!
