Which of the following is an implementation of dynamic arrays in C++?
A. list
B. Array List
C. vector
D. List<>
Here is the complete solved Past Paper of Data Control Analyst Ministry of Defence MOD conducted by NTS in 2019.
A. list
B. Array List
C. vector
D. List<>
A. O(n² log n)²
B. O(n²)
C. O(n)
D. O(n log n)
A. It is easy to write the source code
B. It is faster to declare variables
C. Their execution speed is faster
D. Both A and B
A. Finite set of states
B. Finite set of input symbols
C. A transition function that maps Q × Σ → Q
D. A start state q0 ∈ Q
A. MAN (Metropolitan Area Networks)
B. SAN (Storage Area Network)
C. CAN (Campus Area Network)
D. PAN (Personal Area Network)
A. O(n log n)
B. O(n²)
C. O(n)
D. O(n log² n)
A. {S >> F(S)}
B. {S | F(S)}
C. {S → F(S)}
D. {S = F(S)}
A. O(n² log n)²
B. O(n²)
C. O(n)
D. O(log n)
A. The minimal number of attributes necessary to support the data requirements of the enterprise.
B. Attributes with a close logical relationship (described as functional dependency) are found in the same relation.
B. Implementation of a method that depends on the type of the object it is applied to (overriding).
C. Minimal redundancy with each attribute represented only once with the important exception of attributes that form all or part of foreign keys, which are essential for the joining of related relations.