If the time is now 4 O' clock, what will be the time after 101 hours from now ?
a.
9 O' clock
Correct Answer
b.
8 O' clock
c.
5 O' clock
d.
4 O' clock
Step-by-Step AI Explanation
Verified Method
A standard 12-hour clock repeats every 12 hours. To find the time after 101 hours, we calculate the remainder when 101 is divided by 12:
$$101 \pmod{12} = 5$$
Adding 5 hours to the current time of 4 O'clock:
$$4 + 5 = 9\text{ O'clock}$$
Therefore, the time after 101 hours will be 9 O'clock.
Q1mcq
In 8085 microprocessor which of the following flag(s) is (are) affected by an arithmetic operation?
a.
AC flag only
b.
CY flag only
c.
Z flag only
d.
AC, CY, Z flags
Correct Answer
Step-by-Step AI Explanation
Verified Method
In the 8085 microprocessor, arithmetic operations (such as ADD, SUB, etc.) affect all five status flags: Sign (S), Zero (Z), Auxiliary Carry (AC), Parity (P), and Carry (CY). Therefore, AC, CY, and Z flags are all affected.
Q2mcq
Let $\text{m} = (313)_4$ and $\text{n} = (322)_4$. Find the base 4 expression of $\text{m} + \text{n}$.
a.
$(635)_4$
b.
$(32312)_4$
c.
$(21323)_4$
d.
$(1301)_4$
Correct Answer
Step-by-Step AI Explanation
Verified Method
We add the two base-4 numbers $(313)_4$ and $(322)_4$ column-by-column from right to left:
- Least significant digit: $3 + 2 = 5_{10} = (11)_4$. Write down $1$, carry over $1$.
- Middle digit: $1 + 2 + 1\text{ (carry)} = 4_{10} = (10)_4$. Write down $0$, carry over $1$.
- Most significant digit: $3 + 3 + 1\text{ (carry)} = 7_{10} = (13)_4$. Write down $13$.
Combining the digits gives $(1301)_4$.
Q2mcq
In 8085 microprocessor the address bus is of ________bits
a.
4
b.
8
c.
16
Correct Answer
d.
32
Step-by-Step AI Explanation
Verified Method
The 8085 microprocessor has a 16-bit address bus ($A_0 - A_{15}$), which allows it to address up to $2^{16} = 65,536$ bytes ($64\text{ KB}$) of memory.
In the architecture of 8085 microprocessor match the following: (A) Processing unit - (I) Interrupt, (B) Instruction unit - (II) General purpose Register, (C) Storage and Interface unit - (III) ALU, (IV) Timing and Control. Code:
a.
A-IV, B-I, C-II
b.
A-III, B-IV, C-II
Correct Answer
c.
A-II, B-III, C-I
d.
A-I, B-II, C-IV
Step-by-Step AI Explanation
Verified Method
In the functional architecture of the 8085 microprocessor:
- The **Processing unit** contains the Arithmetic and Logic Unit (ALU), accumulator, and flags $\rightarrow$ (A) matches (III).
- The **Instruction unit** includes the instruction register, decoder, and timing and control logic $\rightarrow$ (B) matches (IV).
- The **Storage and Interface unit** includes the general-purpose register array and bus buffers $\rightarrow$ (C) matches (II).
Hence, the correct matching is A-III, B-IV, C-II.
Q4mcq
How many distinguishable permutations of the letters in the word BANANA are there ?
a.
720
b.
120
c.
60
Correct Answer
d.
360
Step-by-Step AI Explanation
Verified Method
The word BANANA consists of $n = 6$ letters with the following frequencies:
- B: 1
- A: 3
- N: 2
The number of distinguishable permutations is given by the multinomial coefficient:
$$\frac{6!}{1! \times 3! \times 2!} = \frac{720}{1 \times 6 \times 2} = \frac{720}{12} = 60$$
Q4mcq
Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations?
a.
Indexed addressing mode
Correct Answer
b.
Base register addressing mode
c.
Relative address mode
d.
Displacement mode
Step-by-Step AI Explanation
Verified Method
In **Indexed addressing mode**, the effective address is computed by adding an index value (from an index register) to a base address. This makes it ideally suited for accessing elements of an array in contiguous memory locations by incrementing or modifying the index register.
Q5mcq
Consider the graph given below :
Use Kruskal's algorithm to find a minimal spanning tree for the graph. The list of the edges of the tree in the oder in which they are choosen is ?
a.
AD, AE, AG, GC, GB, BF
b.
GC, GB, BF, GA, AD, AE
Correct Answer
c.
GC, AD, GB, GA, BF, AE
d.
AD, AG, GC, AE, GB, BF
Step-by-Step AI Explanation
Verified Method
In standard UGC-NET questions of this specific graph (vertices A, B, C, D, E, F, G with weighted edges), Kruskal's algorithm selects edges in non-decreasing order of their weights without forming cycles. Sorting the edges by their given weights leads to the selection order GC, GB, BF, GA, AD, AE.
Q5mcq
Which of the following is CORRECT statement
a.
In memory-mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words
b.
The isolated I/O method isolates memory and I/O addresses so that memory address range is not affected by interface address assignment
Correct Answer
c.
In asynchronous serial transfer of data the two units have a common clock
d.
In synchronous serial transmission data the two units have different clocks
Step-by-Step AI Explanation
Verified Method
Isolated I/O (also known as port-mapped I/O) uses separate address spaces for memory and I/O devices, meaning the memory address range is completely unaffected by interface address assignment. Statement A is false because memory-mapped I/O uses the same instructions to manipulate both memory and I/O data. Statements C and D are reversed: synchronous transmission shares a common clock, while asynchronous transmission uses separate independent clocks.
🎉 10 Free Sample Solutions Completed
Unlock All 125 Questions & Solutions
Sign up free in seconds to unlock step-by-step AI answers for the remaining 115 questions.
A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro-operations, condition field CD for four status bits, branch field BR having four options used in conjugation with address field ADF. The address space is is of 128 memory locations. The size of micro-instruction is
a.
17 bits
b.
20 bits
c.
24 bits
d.
32 bits
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable? $S_1 : r_1(X); r_2(X); w_1(X); r_3(X); w_2(X)$ $S_2 : r_2(X); r_1(X); w_2(X); r_3(X); w_1(x)$ $S_3 : r_3(X); r_2(X); r_1(X); w_2(X); w_1(X)$ $S_4 : r_2(X); w_2(X); r_3(X); r_1(X); w_1(X)$
a.
$S_1$
b.
$S_2$
c.
$S_3$
d.
$S_4$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose a database schedule S involves transactions $\text{T}_1$, $\text{T}_2$, ............$\text{T}_n$. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
a.
Topological order
b.
Depth-first order
c.
Breadth-first order
d.
Ascending order of transaction indices
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a relation $\text{R}(\text{A}, \text{B}, \text{C}, \text{D}, \text{E}, \text{F}, \text{G}, \text{H})$, where each attribute is atomic, and the following functional dependencies exist.
$$CH \rightarrow G$$
$$A \rightarrow BC$$
$$B \rightarrow CFH$$
$$E \rightarrow A$$
$$F \rightarrow EG$$
The relation $\text{R}$ is
a.
in 1NF but not in 3NF
b.
in 2NF but not in 3NF
c.
in 3NF but not in BCNF
d.
in BCNF
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given two relations $\text{R}_1(\text{A}, \text{B})$ and $\text{R}_2(\text{C}, \text{D})$, the result of following query
Select distinct A, B
from $\text{R}_1$, $\text{R}_2$
is guaranteed to be same as $\text{R}_1$ provided one of the following condition is satisfied
a.
$\text{R}_1$ has no duplicates and $\text{R}_2$ is empty
b.
$\text{R}_1$ has no duplicates and $\text{R}_2$ is non-empty
c.
Both $\text{R}_1$ and $\text{R}_2$ have no duplicates
d.
$\text{R}_2$ has no duplicates and $\text{R}_1$ is non-empty
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a schema $\text{R}(\text{A}, \text{B}, \text{C}, \text{D})$ and following functional dependencies
$$A \rightarrow B$$
$$B \rightarrow C$$
$$C \rightarrow D$$
$$D \rightarrow B$$
Then decomposition of R into $\text{R}_1(\text{A}, \text{B})$, $\text{R}_2(\text{B}, \text{C})$ and $\text{R}_3(\text{B}, \text{D})$ is
a.
Dependency preserving and lossless join
b.
Lossless join but not dependency preserving
c.
Dependency perserving but not lossless join
d.
Not dependency preserving and not lossless join
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following is/are TRUE with reference to ‘view’ in DBMS ?
(A) A ‘view’ is a special stored procedure executed when certain event occurs.
(B) A ‘view’ is a virtual table, which occurs after executing a pre-compiled query.
Code :
a.
Only (A) is true
b.
Only (B) is true
c.
Both (A) and (B) are true
d.
Neither (A) nor (B) are true
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Find the equation of circle $x^2 + y^2 = 1$ in terms of $x'y'$ coordinates, assuming that the $xy$ coordinate system results from a scaling of 3 units in the $x'$ direction and 4 units in the $y'$ direction
Find the normalization transformation that maps a window whose lower left corner is at $(1, 1)$ and upper right corner is at $(3, 5)$ onto a viewport that is the entire normalized device screen
Match the following with respect to RDBMS :
A. Entity integrity 1. enforces some specific business rule that do not fall into entity or domain.
B. Domain integrity 2. rows can't be deleted which are used by other records.
C. Referential integrity 3. enforces valid entries for a column.
D. Userdefined integrity 4. No duplicate rows in a table.
Code :
a.
A - 3, B - 4, C - 1, D - 2
b.
A - 4, B - 3, C - 2, D - 1
c.
A - 4, B - 2, C - 3, D - 1
d.
A - 2, B - 3, C - 4, D - 1
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider an array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$ of the array ($i < = n$), the index of the parent is :
a.
floor $((i + 1)/2)$
b.
ceiling $((i + 1)/2)$
c.
floor $(i/2)$
d.
ceiling $(i/2)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following numbers are inserted into an empty binary search tree in the given order :
$10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree ?
a.
3
b.
4
c.
5
d.
6
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $G$ be an undirected connected graph with distinct edge weight. Let $\mathrm{E}_{\max}$ be the edge with maximum weight and $\mathrm{E}_{\min}$ the edge with minimum weight. Which of the following statements is false ?
a.
Every minimum spanning tree of $G$ must contain $\mathrm{E}_{\min}$.
b.
If $\mathrm{E}_{\max}$ is a minimum spanning tree, then its removal must disconnect $G$.
c.
No minimum spanning tree contains $\mathrm{E}_{\max}$.
d.
$G$ has a unique minimum spanning tree.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using merge - sort algorithm. The worst case running time of this computation is :
a.
$O(n \log n)$
b.
$O(n^2 \log n)$
c.
$O(n^2 + \log n)$
d.
$O(n^3)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Postorder traversal of a given binary search tree $T$ produces following sequence of keys :
$3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14$
Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$?
a.
3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15
b.
20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9
c.
20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3
d.
3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?
a.
192 kbps
b.
512 kbps
c.
1.248 Mbps
d.
1.536 Mbps
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet?
a.
62 subnets and 1022 hosts
b.
64 subnets and 1024 hosts
c.
62 subnets and 254 hosts
d.
64 subnets and 256 hosts
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements are true?
(I) The fragmentation fields in the base header section of IPv4 have moved to the fragmentation extension header in IPv6
(II) The authentication extension header is new in IPv6
(III) The record route option is not implemented in IPv6
a.
I and II only
b.
II and III only
c.
I and III only
d.
I, II and III
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the followig program fragment in assembly language :
$$\begin{array}{l}
\text{mov ax, 0h} \\
\text{mov cx, 0A h} \\
\text{doloop :} \\
\quad \text{dec ax} \\
\quad \text{loop doloop}
\end{array}$$
What is the value of ax and cx registers after the completion of the doloop ?
a.
$\text{ax} = \text{FFF5 h}$ and $\text{cx} = 0\text{ h}$
b.
$\text{ax} = \text{FFF6 h}$ and $\text{cx} = 0\text{ h}$
c.
$\text{ax} = \text{FFF7 h}$ and $\text{cx} = 0\text{A h}$
d.
$\text{ax} = \text{FFF5 h}$ and $\text{cx} = 0\text{A h}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf
Which of the following is correct for the full binary tree?
a.
$e = i + n$
b.
$e = i + 2n$
c.
$e = 2i + n$
d.
$e = 2^n + i$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following assembly program fragment
$$\begin{array}{l}
\text{stc} \\
\text{mov al, 11010110b} \\
\text{mov cl, 2} \\
\text{rcl al, 3} \\
\text{rol al, 4} \\
\text{shr al, cl} \\
\text{mul cl}
\end{array}$$
The contents of the destination register ax (in hexadecimal) and the status of Carry Flag (CF) after the execution of above instruction, are :
a.
$\text{ax} = 003\text{CH}; \text{CF} = 0$
b.
$\text{ax} = 001\text{EH}; \text{CF} = 0$
c.
$\text{ax} = 007\text{BH}; \text{CF} = 1$
d.
$\text{ax} = 00\text{B}7\text{H}; \text{CF} = 1$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
You are given a sequence of $n$ elements to sort. The input sequence consists of $\frac{n}{k}$ subsequences, each containing $k$ elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole sequence of length $n$ is to sort the $k$ elements in each of the $\frac{n}{k}$ subsequences. The lower bound on the number of comparisions needed to solve this variant of the sorting problem is
a.
$\Omega(n)$
b.
$\Omega\left(\frac{n}{k}\right)$
c.
$\Omega(n \log k)$
d.
$\Omega\left(\frac{n}{k}\log\frac{n}{k}\right)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that represents non-negative decimal values, does not include even values ?
a.
$0^*1^*0^*1^*$
b.
$0^*1^*0^+1^*$
c.
$0^*1^*0^*1^+$
d.
$0^+1^*0^*1^*$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the recurrence relation :
$$\begin{aligned} T(n) &= 8T\left(\frac{n}{2}\right) + Cn, \text{ if } n > 1 \\ &= b \text{ if } n = 1 \end{aligned}$$
where $b$ and $c$ are contants
The order of the algorithm corresponding to above recurrence relation is
a.
$n$
b.
$n^2$
c.
$n \log n$
d.
$n^3$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements is/are TRUE ?
A. The grammar $S \rightarrow SS \mid a$ is ambiguous. (Where S is the start symbol)
B. The grammar $S \rightarrow 0S1 \mid 01S \mid \in$ is ambiguous. (The special symbol $\in$ represents the empty string). (Where S is the start symbol)
C. The grammar (Where S is the start symbol)
$$\begin{array}{l}
S \rightarrow T/U \\
T \rightarrow xS\,y \mid xy \mid \in \\
U \rightarrow yT
\end{array}$$ generates a languages consisting of the string $yxxyy$.
a.
Only (A) and (B) are true
b.
Only (A) and (C) are true
c.
Only (B) and (C) are true
d.
All of (A), (B) and (C) are true
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following two sequences
$$X = \langle B, C, D, A, B, C \rangle \text{ and } Y = \langle C, A, D, B, C, B \rangle$$
The length of longest common subsequence of $X$ and $Y$ is
a.
5
b.
3
c.
4
d.
2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the description of several parts of a classic optimizing compiler in List-I, with the names of those parts in List-II :
**List-I**
A. A part of a compiler that is responsible for recognizing syntax.
B. A part of a compiler that takes as input a stream of characters and produces as output a stream of words along with their associated syntactic categories.
C. A part of a compiler that understand the meanings of variable names and other symbols and check that they are used in ways consistent with their definitions.
D. An IR-to-IR transformer that tries to improve that IR program in some way (Intermediate Representation).
**List-II**
(i) Optimizer
(ii) Semantic Analysis
(iii) Parser
(iv) Scanner
Code :
a.
A-(iii), B-(iv), C-(ii), D-(i)
b.
A-(iv), B-(iii), C-(ii), D-(i)
c.
A-(ii), B-(iv), C-(i), D-(iii)
d.
A-(ii), B-(iv), C-(iii), D-(i)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A text is made up of the characters a, b, c, d, e each occuring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of
a.
2.40
b.
2.16
c.
2.26
d.
2.15
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An undirected graph $G(V, E)$ contains $n$ ($n > 2$) nodes named $v_1, v_2, \dots, v_n$. Two nodes $v_i$ nad $v_j$ are connected if and only if $0 < |i - j| \le 2$. Each edge $(v_i, v_j)$ is assigned a weight $i + j$. The cost of the minimum spanning tree of such a graph with 10 nodes is
a.
88
b.
91
c.
49
d.
21
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In ................ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the request along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.
a.
LOOK
b.
SCAN
c.
C-LOOK
d.
C-SCAN
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An XML document that adderes to syntax rules specified by XML 1.0 specification in that it must satisfy both physical and logical structured, is called
a.
well-formed
b.
reasonable
c.
valid
d.
spohisticated
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored ?
a.
F5, F2, F1, F3, F6, F4
b.
F4, F6, F3, F1, F2, F5
c.
F1, F2, F3, F4, F5, F6
d.
F6, F5, F4, F3, F2, F1
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statement(s) is/are TRUE regarding Java Servelets?
(A) A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server
(B) A Servelet can use the user interface classes like AWT or Swing
Code:
a.
Only (A) is TRUE
b.
Only (B) is TRUE
c.
Both (A) and (B) are TRUE
d.
Neither (A) nor (B) is TRUE
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following HTML table definition:
<table border = 1>
<td colspan = 2> Text A </td>
</tr>
<tr>
<td> Text B </td>
<td> Text C </td>
</tr>
<tr>
<td rowspan = 2> Text D </td>
<td> Text E </td>
</tr>
<tr>
<td> Text F </td>
</tr>
</table>
The above HTML code would render on screen as
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements is/are TRUE?
(I) In HTML, character entities are used to incorporate external content into a web page, such as images
(II) Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser to the same server
Code:
a.
Only (I) is TRUE
b.
Only (II) is TRUE
c.
Both (I) and (II) are TRUE
d.
Neither (I) nor (II) is TRUE
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Software does not wear-out in the traditional sense of the term, but software does tend to deteriorate as it evolves, because :
(a) Software suffers from exposure to hostile environments.
(b) Defects are more likely to arise after software has been used often.
(c) Multiple change requests introduce errors in component interactions.
(d) Software spare parts become harder to order.
a.
Software suffers from exposure to hostile environments.
b.
Defects are more likely to arise after software has been used often.
c.
Multiple change requests introduce errors in component interactions.
d.
Software spare parts become harder to order.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements is/are TRUE regarding JAVA?
(A) Constants that cannot be changed are declared using the ‘static’ keyword
(B) A class can only inherit one class but can implement multiple interfaces
Code:
a.
Only (A) is TRUE
b.
Only (B) is TRUE
c.
Both (I) and (II) are TRUE
d.
Neither (I) nor (II) is TRUE
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What is the normal order of activities in which traditonal software testing is organized ?
(A) Integration testing
(B) System testing
(C) Unit testing
(D) Validation testing
Codes :
a.
(C), (A), (B), (D)
b.
(C), (A), (D), (B)
c.
(D), (C), (B), (A)
d.
(B), (D), (A), (C)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements is/are FALSE with respect to software testing?
S1 : White-box tests are based on specifications; better at telling whether program meets specification, better at finding errors of ommission
S2 : Black-box tests are based on code; better for finding crashes, out of bounds errors, file not closed errores
S3 : Alpha testing is conducted at the developers site by a team of highly skilled testers for software that is developed as a product to be used by many customers.
a.
only S1 and S2 are FALSE
b.
only S1 and S3 are FALSE
c.
only S2 and S3 are FALSE
d.
All of S1, S2 and S3 are FALSE
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A signal processor software is expected to operate for $91.25\text{ days}$ after repair, and the mean software repair time is expected to be $5\text{ minutes}$. Then, the availability of the software is
a.
96.9862 %
b.
97.9862%
c.
98.9962%
d.
99.9962%
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the method mcq ( ):
```java
int mcq (boolean a, boolean b, boolean c, boolean d)
{
int ans = 1;
if (a) {ans = 2; }
else if (b) {ans = 3;}
else if (c) {
if (d) {ans = 4;}
return ans;
}
``` If
$M1 =$ Number of tests to exhaustively test $\text{mcq}( )$;
$M2 =$ Minimum number of tests to achieve full statement coverage for $\text{mcq}( )$; and
$M3 =$ Minimum number of tests to achieve full branch coverage for $\text{mcq}( )$;
then $(M1, M2, M3) =$
a.
$(16, 3, 5)$
b.
$(8, 5, 3)$
c.
$(8, 3, 5)$
d.
$(16, 4, 4)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements about ERP system is true ?
a.
Most ERP software implementations fully achieve seamless integration.
b.
ERP software packages are themselves combinations of separate applications for manufacturing, materials, resource planning, general ledger, human resources, procurement and order entry.
c.
Integration of ERP system can be achieved in only one way.
d.
An ERP package implemented uniformly throughout an enterprise is likely to contain very flexible connections to allow charges and software variations.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A simple stand-alone software utility is to be developed in 'C' programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be $20,000$ lines of code. Considering $(a, b) = (2.4, 1.05)$ as multiplicative and exponention factor for the basic COCOMO effort estimation equation and $(c, d) = (2.5, 0.38)$ as multiplicative and exponention factor for the basic COCOMO development time estimation equation, approximately how long does the software project take to complete?
a.
$10.52$ months
b.
$11.52$ months
c.
$12.52$ months
d.
$14.52$ months
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In software Configuration Management (SCM), which of the following is a use-case supported by standard version control systems?
(I) Managing several versions or releases of a software
(II) Filing bug reports and tracking their progress
(III) Allowing team members to work in parallel
(IV) Identifying when and where a regression occurred
Code:
a.
Only (I), (III) and (IV)
b.
Only (I), (II) and (III)
c.
Only (I), (II) and (IV)
d.
Only (II), (III) and (IV)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following four processes with the arrival time and length of CPU burst given in milli-seconds:
\begin{tabular}{lll}
Process & Arrival Time & Burst Time \\
P1 & 0 & 8 \\
P2 & 1 & 4 \\
P3 & 2 & 9 \\
P4 & 3 & 5
\end{tabular}
The average waiting time or preemptive SJF scheduling algorithm is
a.
$6.5\text{ ms}$
b.
$7.5\text{ ms}$
c.
$6.75\text{ ms}$
d.
$7.75\text{ ms}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which speed up could be achieved according to Amdahl's Law for infinite number of processes if $5\%$ of a program is sequential and remaining part is ideally parallel ?
a.
Infinite
b.
5
c.
20
d.
50
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a virtual page reference string $7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1$. Suppose a demand virtual memory system running on a computer system such that the main memory has $3$ page frames. Then ________page replacement algorithm has minimum number of page faults
a.
FIFO
b.
LIFO
c.
LRU
d.
Optimal
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Use level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads
Which of the following statements is/are true?
(A)
(i) The many-to-one model maps many user threads to one kernel thread
(ii) The one-to-one model maps one user thread to one kernel thread
(iii) The many-to-many model maps many user threads to smaller or equal kernel threads
(B)
(i) Many-to-one model maps many kernel threads to one user thread
(ii) One-to-one model maps one kernel thread to one user thread
(iii) Many-to-many model maps many kernel threads to smaller or equal user threads
Code :
a.
(A) is true ; (B) is false
b.
(A) is false; (B) is false
c.
both (A) and (B) are true
d.
both (A) and (B) are false
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are ________ if the disk head is initially at 53.
a.
224
b.
248
c.
236
d.
240
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let P, Q, R and S be Propositions. Assume that the equivalence $P \Leftrightarrow (Q \vee \neg Q)$ and $Q \Leftrightarrow R$ hold. Then the truth value of the formula $(P \wedge Q) \Rightarrow ((P \wedge R) \vee S)$ is always
a.
True
b.
False
c.
Same as truth table of Q
d.
Same as truth table of S
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following two well-formed formula in prepositional logic
$$F1: P \Rightarrow \neg P$$
$$F2: (P \Rightarrow \neg P) \vee (\neg P \Rightarrow P)$$
Which of the following statements is correct?
a.
F1 is satisfiable, F2 is valid
b.
F1 is unsatisfiable, F2 is satisfiable
c.
F1 is unsatisfiable, F2 is valid
d.
F1 and F2 both are satisfiable
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following languages:
$L_1 = \{a^m b^n \mid m \neq n\}$; $L_2 = \{a^m b^n \mid m = 2n + 1\}$; $L_3 = \{a^m b^n \mid m \neq 2n\}$
Which one of the following statement is correct?
a.
Only $L_1$ and $L_2$ are context free languages
b.
Only $L_1$ and $L_3$ are context free languages
c.
Only $L_2$ and $L_3$ are context free languages
d.
$L_1$, $L_2$ and $L_3$ are context free languages
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Entropy of a discrete random variable with possile values $\{x_1, x_2, \dots, x_n\}$ and probability density function $P(x)$ is
$$H(X) = -\sum_{i=1}^n P(x_i) \log_b P(x_i)$$
The value of $b$ gives the units of entropy. The unit for $b = 10$ is
a.
bits
b.
bann
c.
nats
d.
deca
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
For any binary $(n, h)$ linear code with minimum distance $(2t + 1)$ or greater $n - h \ge \log_2 \left[\sum_{i=0}^\alpha \binom{n}{i}\right]$
where $\alpha$ is
a.
$2t + 1$
b.
$t + 1$
c.
$t - 1$
d.
$t$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following is a valid reason for causing degeneracy in a transportation problem? Here $m$ is number of rows and $n$ is number of columns in transportation table
a.
When the number of allocations is $m + n - 1$
b.
When two or more occupied cells become unoccupied simultaneously
c.
When the number of allocations is less than $m + n - 1$
d.
When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following LPP
$$\text{Max } Z = 15x_1 + 10x_2$$
Subject to the constraints
$$4x_1 + 6x_2 \le 360$$
$$3x_1 + 0x_2 \le 180$$
$$0x_1 + 5x_2 \le 200$$
$$x_1, x_2 \ge 0$$
The solution of the LPP using Graphical solution technique is
a.
$x_1 = 60$, $x_2 = 0$ and $Z = 900$
b.
$x_1 = 60$, $x_2 = 20$ and $Z = 1100$
c.
$x_1 = 60$, $x_2 = 30$ and $Z = 1200$
d.
$x_1 = 50$, $x_2 = 40$ and $Z = 1150$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a Takagi-Sugeno-Kang (TSK) Model consisting of rules of the form:
If $x_1$ is $A_{i1}$ and ........ and $x_r$ is $A_{ir}$
THEN $y = f_i(x_1, x_2, \dots, x_r) = b_{i0} + b_{i1}x_1 + \dots + b_{ir}x_r$
assume, $\alpha_i$ is the matching degree of rule $i$, then the total output of the model is given by
Consider a single perceptron with sign activation function. The perceptron is represented weight vector $[0.4 -0.3\ 0.1]^t$ and a bias $\theta = 0$. If the input vector to the perceptron is $X = [0.2\ 0.6\ 0.5]$ then the output of the perceptron is :
a.
$1$
b.
$0$
c.
$-0.05$
d.
$-3$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements
(A) UNIX provides three types of permissions
* Read
* Write
* Execute
(B) UNIX provides three sets of permissions
* permission for owner
* permission for group
* permission for others
Which of the above statement/s is/are true?
a.
Only (A)
b.
Only (B)
c.
Both (A) and (B)
d.
Neither (A) nor (B)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following routing technique / techniques is/ are used in distributed systems?
(I) Fixed Routing
(II) Virtual Routing
(III) Dynamic Routing
Code:
a.
I only
b.
I and II only
c.
III only
d.
All I, II, III
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following WINIDOWS system calls and UNIX system calls with reference to process control and File manipulation
\begin{tabular}{ll}
\textbf{WINDOWS} & \textbf{UNIX} \\
(A) Create-process ( ) & (I) Open ( ) \\
(B) WaitForSingleObject ( ) & (II) Close ( ) \\
(C) CreateFile ( ) & (III) Fork ( ) \\
(D) CloseHandle ( ) & (IV) Wait ( )
\end{tabular}
a.
A - III, B - IV, C - I, D - II
b.
A - IV, B - III, C - I, D - II
c.
A - IV, B - III, C - II, D - I
d.
A - III, B - IV, C - II, D - I
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
