What are the phases in s/w developed life cycle?
wat is the diff b/w stack & queue...where do we use stack
- 6 Answers
- 7066 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / prakash.m
phases in SDLC
The phases may be diffred for different SDLC models.
some of the SDLC are
waterfall model(all requirements must be collected in the
first phase itself)
spiral model(processing looks like a spiral fashion,the
desired requirements can be added in next level spirals)
incremental model
prototype model
Stack and queue are data structures. stack is referred as
Last In First Out(LIFO), uses a single pointer
queue is First In First Out(FIFO), uses 2 pointers , one
for insertion and another for deletion.
stack is used for all arithmatic operations, eg. polynomial
addition.
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / subha raman
stack follows-LIFO
-used to evaluate postfix/prefix expressions
queue follows-FIFO
-which has normal applications like-priority being given
1st..i.e. first come-first serve basis..
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / rani
Stack follows LIFO. whereas queue follows FIFO.
All local variables and function calls are stored
temporarily in stack during program execution.
It is easy to manipulate stack operation rather than queue.
| Is This Answer Correct ? | 0 Yes | 0 No |
The phases of SDLC are:
**Communication.
**Requirements gathering
**Analysis
**Implementation
**Testing
**Maintainance
Differance between stack and queue..
Stack follows LIFO structure i.e -> last in first out.
the element which enters last exits first..
Queue follows FIFO structure. i.e -> first in first out.
the element which enters first exits first..
USE OF STACK:
with refrance to C, we use stack wiht the program counter.
i.e when we jump to a function, we store the address to
return to on a stack..
u can understand this in more detail if you study teh
actual flow of program while calling functions.
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / asdf
Use of stack:
1) All local variables get stored in stack.
2) To store the parameters passed to the function
3) To store the return address of the function
4) To Evaluate arithmetic expressions.
5) In recursive programming
Use of Queue:
1)Used to implement OS internals algorithms (example: in
scheduling algorithms)
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / nisha
Stack follows LIFO i.e last in first out.The last element
entered would be removed first while Queue follows FIFO i.e
first in first out.The element that ws entered first would
be removed first.
| Is This Answer Correct ? | 0 Yes | 1 No |
Which of the following is not an infinite loop ? a.while(1){ .... } b.for(;;){ ... } c.x=0; do{ /*x unaltered within theloop*/ ... }while(x==0); d.# define TRUE 0 ... while(TRUE){ .... }
please give me some tips for the selection in TCS.
to find the closest pair
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
Why the use of alloca() is discouraged?
#define DCHAR char* typedef char* TCHAR; if using these following variables will be declared like DCHAR ch1, ch2; TCHAR ch3, ch4; then what will be types of ch1, ch2, ch3 and ch4?
What is the Difference between Macro and ordinary definition?
3 Answers Bosch, Cognizant, College School Exams Tests, Motorola,
/*what is the output for the code*/ void main() { int r; r=printf("naveen"); r=printf(); printf("%d",r); getch(); }
What is the use of c language in real life?
2)#include<iostream.h> main() { printf("Hello World"); } the program prints Hello World without changing main() the o/p should be intialisation Hello World Desruct the changes should be a)iostream operator<<(iostream os, char*s) os<<'intialisation'<<(Hello World)<<Destruct b) c) d)none of the above
How do we declare variables in c?
What is the meaning of c in c language?
C 
