Dd Form 2630 - Software Description Annotated Outline Page 3

Download a blank fillable Dd Form 2630 - Software Description Annotated Outline in PDF format just by clicking the "DOWNLOAD PDF" button.

Open the file in any PDF-viewing software. Adobe Reader or any alternative for Windows or MacOS are required to access and complete fillable content.

Complete Dd Form 2630 - Software Description Annotated Outline with your personal data - all interactive fields are highlighted in places where you should type, access drop-down lists or select multiple-choice options.

Some fillable PDF-files have the option of saving the completed form that contains your own data for later use or sending it out straight away.

ADVERTISEMENT

8. BASIS OF SIZE ESTIMATE
a. (X as applicable)
b. IF SYSTEM WAS SIZED USING FUNCTION POINTS, ENTER NUMBER OF:
(1) From lower level
(1) Inputs (Unique major data types that enter the system)
(2) Function points
(2) Outputs (Unique logical major report formats generated by system)
(3) Analogy with (Specify)
(3) Inquiries (Types of queries that result in informational searches and
(4) Other (Specify)
responses)
(5) Additional Comments
(4) External interfaces
(5) Internal files (Unique logical files/databases used by the application)
9. SYSTEM HARDWARE ENVIRONMENT
a. AVAILABILITY OF TARGET PROCESSING HARDWARE (X one)
b. VIRTUAL MACHINE VOLATILITY OF TARGET SYSTEM
(1) To be developed; will be completed before software is ready
(Based on number of major/minor changes) (if different
from development system)
(2) To be developed under contract concurrently with software;
can/will have major impact
(1) Low - major and minor changes rarely
(3) To be developed under contract concurrently with software;
(2) Medium - major changes 2/year, minor 2/month
will have little impact
(3) High - major changes 4 or more times/year, minor
(4) No new hardware to be developed
often
(5) Additional Comments
(4) Additional Comments
c. TARGET SYSTEM ARCHITECTURE (If different from development system) (X one)
d. REHOSTING IMPACT (Effort to convert from host
to target system, if necessary) (X one)
(1) Centralized (Single processor)
(2) Tightly coupled (Multiple processor)
(1) None
(3) Loosely coupled (Multiple processor)
(2) Minor language and/or system change
(4) Functional processors communicating via bus
(3) Major language or system change
(5) Distributed (Centralized database)
(4) Major language and system change
(5) Additional Comments
(6) Distributed (Distributed database)
(7) Additional Comments
e. MAIN STORAGE CONSTRAINT
f. EXECUTION TIME CONSTRAINTS
g. SOFTWARE FUNCTIONS TO BE
IMPLEMENTED IN FIRMWARE
(1) Percentage of main storage expected to be used by all
(1) Percentage of available execution
CSCIs or CSCs sharing main storage hardware (Refers
time expected to be used by all
(1) Percentage
to random access storage, such as core, integrated-
CSCIs or CSCs sharing consumption
circuit, or plated-wire. Excludes drums, disks, tapes or
of execution time resource
bubble storage.)
(2) Additional Comments
(2) Additional Comments
(2) Additional Comments
10. SOFTWARE COMPLEXITY
a. SOFTWARE INTERFACE COMPLEXITY
b. EXPECTED LEVEL OF DIFFICULTY OF INTEGRATING AND TESTING COMPONENTS TO THE
CSCI OR CSC LEVEL (X one)
(1) With how many CSCIs or CSCs does
this CSCI or CSC interface?
(1) No internal integration
(2) Very little integration, no complex interfaces
(2) Additional Comments
(3) Average degree of CSCI or CSC integration and interface complexity
(4) Several CSCI or CSC interfaces, some complex
(5) Complex, time-intensive CSCI or CSC integration process anticipated
(6) Additional Comments
c. DIFFICULTY OF PROCESSING LOGIC (X one)
d. MATHEMATICAL COMPLEXITY (X one)
(1) Simple logic, straightforward I/O
(1) Simple algorithms and simple calculations
(2) Difficult, highly nested logic, real-time processing
(2) Majority of simple algorithms and calculations
(3) Routine nesting, minimal interface with operating system, standard I/O
(3) Algorithms and calculations of average complexity
(4) Complex dynamic resource allocation, multiple exception handles,
(4) Some difficult or complex calculations
recursion
(5) Many difficult algorithms and complex calculations
(5) Additional Comments
(6) Additional Comments
e. DEGREE OF REAL-TIME (X one)
f. PERCENTAGE OF TOTAL SOURCE CODE ALLOCATED
(1) No tasking, essentially batch response
TO EACH OPERATIONAL TIMING REQUIREMENT
(Sum equals 100%)
(2) Interactive with limited (Ada) tasking
(3) Interrupt drive, tasking in milliseconds
(1) Real-time
(4) On-line
(4) Concurrent tasking, rendezvous in milliseconds
(2) Time-constrained
(5) Other (Specify)
(5) Concurrent tasking, rendezvous in nanoseconds
(3) Non-time-critical
(6) Additional Comments
(6) Additional Comments
DD Form 2630, AUG 92
Page 3 of 4 Pages

ADVERTISEMENT

00 votes

Related Articles

Related forms

Related Categories

Parent category: Business
Go
Page of 4