Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 9052 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 |
What are the advantages of c preprocessor?
How would you find a cycle in a linked list?
#include<stdio.h> main() { int a[3]; int *I; a[0]=100;a[1]=200;a[2]=300; I=a; Printf(“%d\n”, ++*I); Printf(“%d\n”, *++I); Printf(“%d\n”, (*I)--); Printf(“%d\n”, *I); } what is the o/p a. 101,200,200,199 b. 200,201,201,100 c. 101,200,199,199 d. 200,300
User define function contain thier own address or not.
How can I sort a linked list?
Why can arithmetic operations not be performed on void pointers?
main is a predefined or user define function if user defined why? if predefined whay?
In a switch statement, explain what will happen if a break statement is omitted?
What the different types of arrays in c?
When should the volatile modifier be used?
how can we print hellow world programme without using semicolon
Who invented bcpl language?
C 
