COCOMO stands for **COnstructive COst MOdel**, an algorithmic software cost estimation model developed by Barry W. Boehm in 1981.
Q1mcq
The Software Maturity Index (SMI) is defined as
$$\text{SMI} = [\text{M}_{\text{f}} - (\text{F}_{\text{a}} + \text{F}_{\text{c}} + \text{F}_{\text{d}})]/\text{M}_{\text{f}}$$
where
$\text{M}_{\text{f}} =$ the number of modules in the current release.
$\text{F}_{\text{a}} =$ the number of modules in the current release that have been added.
$\text{F}_{\text{c}} =$ the number of modules in the current release that have been changed.
$\text{F}_{\text{d}} =$ the number of modules in the current release that have been deleted.
The product begins to stabilize when
a.
SMI approaches 1
Correct Answer
b.
SMI approaches 0
c.
SMI approaches $-1$
d.
None of the above.
Step-by-Step AI Explanation
Verified Method
The Software Maturity Index (SMI) assesses the stability of a software product as changes occur. As changes, additions, and deletions decrease ($F_a + F_c + F_d \to 0$), the ratio $[M_f - (F_a + F_c + F_d)]/M_f$ approaches $M_f / M_f = 1$. Therefore, the product begins to stabilize as SMI approaches 1.
Q2mcq
Match the following:
(A) Good quality - (i) Program does not fail for specified time in a given environment
(B) Correctness - (ii) Meets the functional requirements
(C) Predictable - (iii) Meets both functional and non-functional requirements
(D) Reliable - (iv) Process is under statistical control
Matching the terms with their definitions:
- **(A) Good quality**: A system exhibits good quality when it satisfies both functional and non-functional requirements (iii).
- **(B) Correctness**: Measures the degree to which a program meets its specified functional requirements (ii).
- **(C) Predictable**: A process is predictable when it is under statistical control (iv).
- **(D) Reliable**: Defined as the probability that a program will not fail for a specified period of time in a specified environment (i).
Hence, the correct mapping is (A)-(iii), (B)-(ii), (C)-(iv), (D)-(i).
Q2mcq
Match the following:
(A) Watson-Felix model (i) Failure intensity
(B) Quick-Fix model (ii) Cost estimation
(C) Putnam resource allocation model (iii) Project planning
(D) Logarithmic Poisson model (iv) Maintenance
Codes:
a.
A-ii, B-i, C-iv, D-iii
b.
A-i, B-ii, C-iv, D-iii
c.
A-ii, B-i, C-iii, D-iv
d.
A-ii, B-iv, C-iii, D-i
Correct Answer
Step-by-Step AI Explanation
Verified Method
Matching the models to their applications:
- **(A) Watson-Felix model**: An empirical **cost estimation** model (ii).
- **(B) Quick-Fix model**: A common approach to software **maintenance** where changes are made rapidly without updating design documents (iv).
- **(C) Putnam resource allocation model**: Used in **project planning** to determine project staffing and effort distribution over time (iii).
- **(D) Logarithmic Poisson model**: A software reliability model developed by Musa et al. that relates to **failure intensity** (i).
Therefore, the correct code is A-ii, B-iv, C-iii, D-i.
Q3mcq
While estimating the cost of software. Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following?
a.
Length of code
b.
Size of software
Correct Answer
c.
Functionality of software
d.
None of the above.
Step-by-Step AI Explanation
Verified Method
Lines of Code (LOC) is a size-oriented metric and Function Points (FP) is a function-oriented metric; both are primary metrics used to measure the **size of software** in cost and effort estimation models.
Q3mcq
_______ is a process model that removes defects before they can precipitate serious hazards
a.
Incremental model
b.
Spiral model
c.
Clean room software engineering
Correct Answer
d.
Agile model
Step-by-Step AI Explanation
Verified Method
**Cleanroom Software Engineering** is an engineering and formal methods approach that emphasizes defect prevention rather than defect detection and removal. It uses rigorous mathematical specification and verification (correctness proofs) along with statistical quality certification to ensure that defects are eliminated before they can cause serious failures.
Q4mcq
A good software design must have
a.
High module coupling, High module cohesion
b.
High module coupling, Low module cohesion
c.
Low module coupling, High module cohesion
Correct Answer
d.
Low module coupling, Low module cohesion
Step-by-Step AI Explanation
Verified Method
A fundamental principle of good software engineering design is achieving **low coupling** (minimizing interdependence between different modules) and **high cohesion** (maximizing the functional relatedness of elements within a single module) to promote modularity, maintainability, and reusability.
Q4mcq
Equivalence partitioning is a _______ method that divides the input domain of a program into classes of data from which test cases can be derived.
a.
White-box testing
b.
Black-box testing
Correct Answer
c.
Orthogonal array testing
d.
Stress testing
Step-by-Step AI Explanation
Verified Method
Equivalence partitioning is a well-known **black-box testing** technique. It divides the input domain into valid and invalid equivalence partitions (classes) such that testing a representative value from each class is assumed to yield the same result as testing any other value in that class, without examining internal code structure.
Q5mcq
Cyclometric complexity of a flow graph $\text{G}$ with $\text{n}$ vertices and $\text{e}$ edges is
Cyclomatic complexity $V(G)$ of a flow graph $G$ with $n$ vertices and $e$ edges is defined by McCabe's metric as:
$$V(G) = e - n + 2P$$
For a single connected component representing one program or procedure ($P = 1$), the formula simplifies to:
$$V(G) = e - n + 2$$
Therefore, option B is correct.
Q5mcq
The following three golden rules
(i) Place the user in control
(ii) Reduce the user's memory load
(iii) Make the interface consistent are for
a.
User satisfication
b.
Good interface design
Correct Answer
c.
Saving system's resources
d.
None of these
Step-by-Step AI Explanation
Verified Method
Theo Mandel formulated the three 'golden rules' for good user interface (UI) design in software engineering:
1. Place the user in control.
2. Reduce the user's memory load.
3. Make the interface consistent.
Hence, option B is the correct answer.
🎉 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.
Software safety is a _______ activity that focuses on the identification and assessment of potential hazards that may effect software negatively and cause an entire system to fail.
a.
Risk mitigation, monitoring and management
b.
Software quality assurance
c.
Software cost estimation
d.
Defect removal efficiency
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The employee information of an Organization is stored in the relation:
Employee (name, sex, salary, deptname)
Consider the following SQL query.
Select deptname from Employee
Where sex = 'M'
group by deptname
having avg (salary) > {select avg (salary) from Employee}
Output of the given query corresponds to
a.
Averge salary of employee more than average salary of the organization.
b.
Average salary less than average salary of the organization
c.
Average salary of employee equal to average salary of the organization.
d.
Average salary of male employees in a department is more than average salary of the organization
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
How many times the word ‘print’ shall be printed by the following program segment?
for $(\text{i} = 1, \text{i} \le 2, \text{i}++)$
for $(\text{j} = 1, \text{j} \le 2, \text{j}++)$
for $(\text{k} = 1, \text{k} \le 2, \text{k}++)$
printf(“print/n”)
a.
1
b.
3
c.
6
d.
8
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
For a database relation $R(a, b, c, d)$ where the domains of $a, b, c, d$ include only the atomic values. The functional dependency $a \rightarrow c$, $b \rightarrow d$ holds in the following relation
a.
In 1NF not in 2NF
b.
In 2NF not in 3NF
c.
In 3NF
d.
In 1NF
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A data file of $1,00,000$ characters contains only the characters g-l, with the frequencies as indicated in table:
\begin{tabular}{|l|c|c|c|c|c|c|}
\hline
& g & h & i & j & k & l \\
\hline
\textbf{Frequency in thousand} & 45 & 13 & 12 & 16 & 9 & 5 \\
\hline
\end{tabular}
using the variable-length code by Huffman codes, the file can be encoded with
a.
$2,52,000$ bits
b.
$2,64,000$ bits
c.
$2,46,000$ bits
d.
$2,24,000$ bits
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.
a.
polyalphabetic
b.
monoalphabetic
c.
transpositional
d.
multialphabetic
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy?
a.
10 clusters, 24 regions and 20 routers
b.
12 clusters, 20 regions and 20 routers
c.
16 clusters, 12 regions and 25 routers
d.
15 clusters, 16 regions and 20 routers.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following:
(A) Data link layer - (i) Flow control
(B) Network layer - (ii) Node to node delivery
(C) Transport layer - (iii) Mail services
(D) Application layer - (iv) Routing
\textbf{Codes:}
\begin{tabular}{ccccc}
& A & B & C & D \\
(a) & ii & i & iv & iii \\
(b) & ii & iv & i & iii \\
(c) & ii & i & iii & iv \\
(d) & ii & iv & iii & i \\
\end{tabular}
a.
A - ii, B - i, C - iv, D - iii
b.
A - ii, B - iv, C - i, D - iii
c.
A - ii, B - i, C - iii, D - iv
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.
An image is $1024 \times 800$ pixels with $3\text{ bytes/pixel}$. Assume the image is uncompressed. How long does it take to transmit it over a $10\text{-Mbps}$ Ethernet?
a.
$196.6\text{ seconds}$
b.
$19.66\text{ seconds}$
c.
$1.966\text{ seconds}$
d.
$0.1966\text{ seconds}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given $\text{L1} = \text{L}(\text{a*baa*})$ and $\text{L2} = \text{L}(\text{ab*})$. The regular expression corresponding to language $\text{L3} = \text{L1}/\text{L2}$ (right quotient) is given by
a.
$a^*b$
b.
$a^*baa^*$
c.
$a^*ba^*$
d.
None of the above.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given the production rules of a grammar $\text{G}_1$ as
$$\text{S}_1 \rightarrow \text{AB} \mid \text{aaB}; \quad \text{A} \rightarrow \text{a} \mid \text{Aa}; \quad \text{B} \rightarrow \text{b}$$
and the production rules of a grammar $\text{G}_2$ as
$$\text{S}_2 \rightarrow \text{aS}_2\text{bS}_2 \mid \text{bS}_2\text{aS}_2 \mid \lambda$$
Which of the following statement is correct statement?
a.
$\text{G}_1$ is ambiguous and $\text{G}_2$ is not ambiguous
b.
$\text{G}_1$ is ambiguous and $\text{G}_2$ is ambiguous
c.
$\text{G}_1$ is not ambiguous and $\text{G}_2$ is ambiguous
d.
$\text{G}_1$ is not ambiguous and $\text{G}_2$ is not ambiguous
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given a grammar: $\text{S}_1 \rightarrow \text{Sc}$, $\text{S} \rightarrow \text{SA} \mid \text{A}$, $\text{A} \rightarrow \text{aSb} \mid \text{ab}$, there is a rightmost derivation
$$\text{S}_1 \Rightarrow \text{Sc} \Rightarrow \text{SAc} \Rightarrow \text{SaSbc}$$
Thus, $\text{SaSbc}$ is a right sentential form, and its handle is
a.
$\text{SaS}$
b.
$\text{bc}$
c.
$\text{Sbc}$
d.
$\text{aSb}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
At any iteration of simplex method, if $\Delta j(Zj-Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test is
a.
Degenerate solution
b.
Unbounded solution
c.
Alternative solution
d.
Optimal solution
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:
The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
a.
5
b.
4
c.
3
d.
2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ________ if the number of positive allocations are less than $m + n - 1$.
a.
degenerate
b.
non-degenerate
c.
unbounded
d.
unbalanced
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which is the correct statement(s) for Non Recursive predictive parser?
$$\text{S}_1 : \text{First}(\alpha) = \left\{ t \mid \alpha \stackrel{*}{\Rightarrow} t\beta \text{ for some string } \beta \right\} \Rightarrow^* t\beta$$
$$\text{S}_2 : \text{Follow}(X) = \left\{ a \mid S \stackrel{*}{\Rightarrow} \alpha X a \beta \text{ for some strings } \alpha \text{ and } \beta \right\}$$
a.
Both statement $\text{S}_1$ and $\text{S}_2$ are incorrect
b.
$\text{S}_1$ is incorrect and $\text{S}_2$ is correct
c.
$\text{S}_1$ is correct and $\text{S}_2$ is incorrect
d.
Both statement $\text{S}_1$ and $\text{S}_2$ are correct.
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 for priority queue:
S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.
Which of the following is correct?
a.
Both S1 and S2 are incorrect
b.
S1 is correct and S2 is incorrect
c.
S1 is incorrect and S2 is correct
d.
Both S1 and S2 are correct.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machine) is
a.
$n \times 8\text{ MB}$
b.
$n/8\text{ MB}$
c.
$(1024 \times 1024)/8\text{ MB}$
d.
$1024\text{ MB}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Refer the points as listed below:
(1) What are the operator precedence rules?
(2) What are the operator associativity rules?
(3) What is the order of operand evalution?
(4) Are there restrictions on operand evaluation side effects?
Which of the above must be considered as primary design issues for arithmetic expressions?
a.
1, 2 and 3
b.
1, 3 and 4
c.
1, 2 and 4
d.
1, 2, 3 and 4
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.
a.
$^{100}\text{P}_2$
b.
$^{100}\text{C}_2$
c.
$2^{100}$
d.
$3^{100}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A pushdown automation $M = (Q, \Sigma, \Gamma, \delta, q_0, z, F)$ is set to be deterministic subject to which of the following condition(s), for every $q \in Q$, $a \in \Sigma \cup \{\lambda\}$ and $b \in \Gamma$
(s1) $\delta(q, a, b)$ contains at most one element
(s1) if $\delta(q, \lambda, b)$ is not empty then $\delta(q, c, b)$ must be empty for every $c \in \Sigma$
a.
only s1
b.
only s2
c.
both s1 and s2
d.
neither s1 nor s2
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 shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the q, p and r are true and one is false otherwise?
The truth value of the statements:
$\exists! x P(x) \rightarrow \exists x P(x)$ and $\exists! x \neg P(x) \rightarrow \neg \forall x P(x)$ (where the notation $\exists! x P(x)$ denotes the proposition “There exists a unique x such that P(x) is true”) are :
a.
True and False
b.
False and True
c.
False and False
d.
True and True
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The statements s1 and s2 are given as
s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.
Which of the following is correct statement?
a.
Both s1 and s2 are correct.
b.
s1 is correct and s2 is not correct
c.
s1 is not correct and s2 is correct
d.
both s1 and s2 are correct.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A Boolean operator $\ominus$ is defined as follows
$1 \ominus 1 = 1$, $1 \ominus 0 = 0$, $0 \ominus 1 = 0$ and $0 \ominus 0 = 1$
What will be the truth value of the expression $(x \ominus y) \ominus z = x \ominus (y \ominus z)$?
a.
Always false
b.
Always true
c.
Sometimes true
d.
True with x, y, z are all true.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A set of processors $\text{P}_1, \text{P}_2, \dots, \text{P}_k$ can execute in parallel if Bernstein's conditions are satisfied on a pairwise basis; that is
$$\text{P}_1 \parallel \text{P}_2 \parallel \text{P}_3 \parallel \dots \parallel \text{P}_k \text{ if and only if:}$$
a.
$\text{P}_i \parallel \text{P}_j$ for all $i \neq j$
b.
$\text{P}_i \parallel \text{P}_j$ for all $i = j + 1$
c.
$\text{P}_i \parallel \text{P}_j$ for all $i \le j$
d.
$\text{P}_i \parallel \text{P}_j$ for all $i \ge j$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______
a.
handoff
b.
mobile switching
c.
mobile routing
d.
cell switching
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following:
(A) TTL (i) High component density
(B) ECL (ii) Low power consumption
(C) MOS (iii) Evolution of 'diode-transistor-logic'
(D) CMOS (iv) High speed digital circuits.
a.
A - iii, B - ii, C - i, D - iv
b.
A - i, B - iv, C - iii, D - ii
c.
A - iii, B - iv, C - i, D - ii
d.
A - i, B - ii, C - iii, D - iv
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Assuming that the disk head is located initially at $32$, find the number of disk moves required with FCFS if the disk queue of I/O block requests are $98, 37, 14, 124, 65, 67$:
a.
$310$
b.
$324$
c.
$320$
d.
$321$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following:
(A) Foreign keys (i) Domain constraint
(B) Private keys (ii) Referential integrity
(C) Event control action model (iii) Encryption
(D) Data security (iv) Trigger
a.
A - iii, B - ii, C - i, D - iv
b.
A - ii, B - i, C - iv, D - iii
c.
A - iii, B - iv, C - i, D - ii
d.
A - i, B - ii, C - iii, D - iv
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let the page fault service time be $10\text{ milliseconds (ms)}$ in a computer with average memory access time being $20\text{ nanoseconds (ns)}$. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for memory?
a.
$21\text{ ns}$
b.
$23\text{ ns}$
c.
$30\text{ ns}$
d.
$35\text{ ns}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose you want to delete the name that occurs before 'Vivek' in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?
a.
Circular linked list
b.
Doubly linked list
c.
Linked list
d.
Dequeue
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What will be the output of the following segment of the program?
\begin{verbatim}
main ( ) {
char*s = "hello world";
int i = 7;
printf("%.*s", i, s); }
\end{verbatim}
a.
Syntax error
b.
hello w
c.
hello
d.
o world
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following:
(A) calloc( ) (i) Frees previously allocated space
(B) free( ) (ii) Modifies previously allocated space
(C) malloc ( ) (iii) Allocates space for array
(D) realloc( ) (iv) Allocates requested size of space
a.
(A)-(iii), (B)-(i), (C)-(iv), (D)-(ii)
b.
(A)-(iii), (B)-(ii), (C)-(i), (D)-(iv)
c.
(A)-(iii), (B)-(iv), (C)-(i), (D)-(ii)
d.
(A)-(iv), (B)-(ii), (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.
Consider the following processor with time slice of 4 milliseconds (I/O requests are ignored):
$$\begin{array}{lcccc}
\text{Process} & \text{A} & \text{B} & \text{C} & \text{D} \\
\text{Arrival time} & 0 & 1 & 2 & 3 \\
\text{CPU cycle} & 8 & 4 & 9 & 5
\end{array}$$
The average turn around time of these processes will be
a.
19.25 milliseconds
b.
18.25 milliseconds
c.
19.5 milliseconds
d.
18.5 milliseconds
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A job has four pagse A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD
Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
a.
9 and 7
b.
7 and 6
c.
9 and 8
d.
8 and 6
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources.
**P1 has statements**
wait(S);
wait(Q);
critical-section 1;
signal(S);
signal(Q);
**P2 has statements**
wait(Q);
wait(S);
critical-section 2;
signal(Q);
signal(S);
Their execution may sometimes lead to an undesirable situation called
a.
Starvation
b.
Race condition
c.
Multithreading
d.
Deadlock
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An operating system using banker's algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows:
**State 1**
Processes: P1, P2, P3
Devices allocated: 2, 3, 4
**State 2**
Processes: P1, P2, P3
Devices allocated: 0, 2, 4
Which of the following is correct?
a.
State 1 is unsafe and state 2 is safe.
b.
State 1 is safe and state 2 is unsafe.
c.
Both, state 1 and state 2 are safe
d.
Both, state 1 and state 2 are unsafe.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let the time taken to switch between user mode and kernel mode of execution be $\text{T1}$ while time taken to switch between two user processes be $\text{T2}$. Which of the following is correct?
a.
$\text{T1} < \text{T2}$
b.
$\text{T1} > \text{T2}$
c.
$\text{T1} = \text{T2}$
d.
Nothing can be said about the relation between $\text{T1}$ and $\text{T2}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A UNIX file system has $1\text{ KB}$ block size and $4\text{-byte}$ disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry?
a.
$30\text{ GB}$
b.
$64\text{ GB}$
c.
$16\text{ GB}$
d.
$1\text{ GB}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct?
a.
OS maintains only scheduling and accounting information for each thread.
b.
OS maintains only CPU registers for each thread.
c.
OS does not maintain a separate stack for each thread.
d.
OS does not maintain virtual memory state for each thread
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
If we convert
$$\exists u \; \forall v \; \forall x \; \exists y \; (\text{P}(\text{f}(\text{u}), \text{v}, \text{x}, \text{y}) \rightarrow \text{Q}(\text{u}, \text{v}, \text{y})) \text{ to } \forall v \; \forall x \; (\text{P}(\text{f}(\text{a}), \text{v}, \text{x}, \text{g}(\text{v}, \text{x})) \rightarrow \text{Q}(\text{a}, \text{v}, \text{g}(\text{v}, \text{x})))$$
This process is known as
a.
Simplication
b.
Unification
c.
Skolemization
d.
Resolution
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be
a.
3
b.
4
c.
5
d.
7
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A fuzzy set $\text{A}$ on $\text{R}$ is _____ iff $\text{A}(\lambda x_1 + (1-\lambda)x_2) \ge \min\left[\text{A}(x_1), \text{A}(x_2)\right]$ for all $x_1, x_2 \in \text{R}$ and all $\lambda \in [0,1]$, where $\min$ denotes the minimum operator.
a.
Support
b.
$\alpha-\text{cut}$
c.
Convex
d.
Concave
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
If $\text{A}$ and $\text{B}$ are two fuzzy sets with membership functions.
$$\mu_{\text{A}}(\text{x}) = \{0.6, 0.5, 0.1, 0.7, 0.8\}$$
$$\mu_{\text{B}}(\text{x}) = \{0.9, 0.2, 0.6, 0.8, 0.5\}$$
Then the value of $\mu_{\text{A}\cup \text{B}}(\text{x})$ will be
a.
$\{0.9, 0.5, 0.6, 0.8, 0.8\}$
b.
$\{0.6, 0.2, 0.1, 0.7, 0.5\}$
c.
$\{0.1, 0.5, 0.4, 0.2, 0.2\}$
d.
$\{0.1, 0.5, 0.4, 0.2, 0.3\}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a single perception with weights as given in the following figure:
and $\text{f(t)}$ defined as $\text{f(t)} = \begin{cases} 1, & t > 0 \\ 0, & t \le 0 \end{cases}$
The above perception can solve
a.
OR problem
b.
AND problem
c.
XOR problem
d.
All of the above.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
