Register

NIELIT 2021 Dec Scientist B - Section B: 61

• edited by
548 views

1 Answer

0 votes
0 votes

B. Forward Engineering ...

 

Forward engineering is the process of building from a high-level model or concept to build in complexities and lower-level details. This type of engineering has different principles in various software and database processes....

Generally, forward engineering is important in IT because it represents the 'normal’ development process....

Forward engineering is thus related to the term 'reverse engineering,’ where there is an effort to build backward, from a coded set to a model, or to unravel the process of how something was put together.…

 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
soujanyareddy13 asked Dec 7, 2021
929 views
NIELIT 2021 Dec Scientist B - Section B: 43
Write Recurrence of Quick Sort in worst case. $ \text{T(n)} = \text{T (n-1)} + 1 $ $ \text{T(n)} = \text{T (n-1) + n} $ $ \text{T(n)} = 2 \text{T (n-1) + n} $ $ \text{T(n)} = \text{ T (n/3) + T (2n/2) + n} $
Write Recurrence of Quick Sort in worst case.$ \text{T(n)} = \text{T (n-1)} + 1 $$ \text{T(n)} = \text{T (n-1) + n} $$ \text{T(n)} = 2 \text{T (n-1) + n} $$ \text{T(n)} =...
User Avatar
0 votes
0 votes
0 answers
2
soujanyareddy13 asked Dec 7, 2021
537 views
NIELIT 2021 Dec Scientist B - Section B: 44
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$ $0.5$ $0.7$ $1$
$y = 10 \cos (1800 \; \pi t) + 20 \cos (2000 \; \pi t) + 10 \cos (220 \; \pi t).$ Find the modulation index $(\mu)$ of the given wave. $0.3$$0.5$$0.7$$1$
User Avatar
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Dec 7, 2021
594 views
NIELIT 2021 Dec Scientist B - Section B: 45
Match the following: ... $\text{W-3, X-1, Y-4, Z-2}$ $\text{W-3, X-1, Y-2, Z-4}$
Match the following:$$\begin{array} {llll} & \textbf{List-I} & & \textbf{List-II} \\ \text{W.} & \text{Condition coverage} & 1. & \text{Black-box testing} \\ \text{X.} ...
User Avatar
0 votes
0 votes
2 answers
4
soujanyareddy13 asked Dec 7, 2021
3,355 views
NIELIT 2021 Dec Scientist B - Section B: 46
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. $\text{NP}$ $\text{P}$ Hard Complete
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete
User Avatar
Link Copied!