Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 3

• reopened by
1,317 views
0 votes
0 votes

By open domain CASE tools we mean

  1. tools available in open domain
  2. software packages which can be downloaded from the internet
  3. software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet
  4. source codes of CASE tools
• reopened by
User Avatar

1 Answer

0 votes
0 votes

CASE tools stand for Computer Aided Software Engineering tools. As the name implies they are computer based programs to increase the productivity of analysts. They permit effective communication with users as well as other members of the development team. They integrate the development done during each phase of a system life cycle and also assist in correctly assessing the effects and cost of changes so that maintenance cost can be estimated.

So C is correct.

Ref: https://nptel.ac.in/content/storage2/courses/106108103/pdf/Lecture_Notes/LNm14.pdf

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

Related questions

0 votes
0 votes
0 answers
1
admin asked Apr 1, 2020
622 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 21
A program $P$ calls two subprograms $P1$ and $P2.\;P1$ can fail $50\%$ time and $P2$ can fail $40\%$ times. The program $P$ can fail $50\%$ $10\%$ $60\%$ $70\%$
A program $P$ calls two subprograms $P1$ and $P2.\;P1$ can fail $50\%$ time and $P2$ can fail $40\%$ times. The program $P$ can fail$50\%$$10\%$$60\%$$70\%$
User Avatar
0 votes
0 votes
1 answer
3
admin asked Apr 1, 2020
943 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is$max(f(n),g(n))$$min(f(n),g(n))$$f(n) + ...
User Avatar
1 votes
1 votes
2 answers
4
admin asked Apr 1, 2020
753 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 4
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
Bit stuffing refers toInserting a $’0’$ in user data stream to differentiate it with a flagInserting a $’0’$ in flag stream to avoid ambiguityAppending a nibble t...
User Avatar
Link Copied!