0 answers
1
Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)
1 answer
6
$\text{SRD}$ stands for __________.Software Requirements DefinitionStructured Requirements DefinitionSoftware Requirements DiagramStructured Requirements Diagram
2 answers
9
Find the output of the following Java code line System.out.printIn(math.floor(-7.4))-7-8-7.4-7.0
0 answers
11
Modules $\mathrm{X}$ and $\mathrm{Y}$ operate on the same input and output, then the cohesion isLogical cohesionSequential cohesionProcedural cohesionCommunicational cohe...
0 answers
14
The process to gather the software requirements from client, analyze and document is known as -Software Engineering ProcessUser Engineering ProcessRequirement Elicitation...
0 answers
15
If every requirement can be checked by a cost-effective process, then $\text{SRS}$ is calledVerifiableTraceableModifiableComplete
0 answers
16
Consider the following two lists :$\begin{array}{ll} \text{List I} & \text{List II} \\ \\\text {(A) Stack overflow } & \text { (I) Software interrupt } \\\text {(B)} \mat...
0 answers
18
Which mechanism in $\text{XML}$ allows organizations to specify globally unique names as element tags in documents?rootheaderschemanamespace
0 answers
21
Match List I with List II :$\begin{array}{II}\text{List I} & \text{List II} \\ \\\text{(A) Firmware} & \text{ (I) Number of logical records into physical blocks} \\ \\\te...
0 answers
22
Match List I with List II :$\begin{array}{ll} \text{List I} & \text{List II} \\ \\\text{(A) BIND} & \text {(I) Block the caller until a connection attempt arrives} \\\tex...
0 answers
28
Pointers cannot be used tofind the address of a variable in memoryreference value directlysimulate call by referencemanipulate dynamic data structure
1 answer
30
Hidden surface removal problem with minimal $3\text{D}$ pipeline can be solved withPainter's algorithmWindow Clipping algorithmBrute force rasterization algorithmFlood fi...