The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has 5 bus arbiters. What will be the size of priority encoder and decoder respectively ?
a.
$4 \times 2$, $2 \times 4$
b.
$2 \times 4$, $4 \times 2$
c.
$3 \times 8$, $8 \times 3$
d.
$8 \times 3$, $3 \times 8$
Correct Answer
Step-by-Step AI Explanation
Verified Method
A parallel bus arbiter for 5 devices requires a priority encoder capable of handling at least 5 request lines. The smallest standard binary priority encoder size with at least 5 inputs is $8 \times 3$ (8 inputs to 3 binary outputs). The corresponding decoder must take the 3-bit grant code and generate at least 5 grant lines, requiring a $3 \times 8$ decoder (3 inputs to 8 outputs). Therefore, the sizes of the priority encoder and decoder are $8 \times 3$ and $3 \times 8$ respectively.
Q2mcq
Consider the following C-code fragment running on a 32-bit x86 machine:
```c
typedef struct {
union {
unsigned char a;
unsigned short b;
} U;
unsigned char c;
} S;
S B[10];
S *p = &B[4];
S *q = &B[5];
p->U.b = 0x1234;
/* structure S takes 32-bits */
```
If M is the value of $\text{q} - \text{p}$ and N is the value of $(\text{int})\ \&(\text{p}\rightarrow\text{c}) - ((\text{int})\text{p})$, then (M, N) is
a.
(1, 1)
b.
(3, 2)
c.
(1, 2)
Correct Answer
d.
(4, 4)
Step-by-Step AI Explanation
Verified Method
1. Pointer subtraction `q - p`: Both `p` and `q` are pointers of type `S*`. Pointer arithmetic gives the number of elements between them, so `q - p = &B[5] - &B[4] = 1`. Thus, $M = 1$.
2. Byte offset calculation: Structure `S` contains a union `U` and a `char c`. Inside union `U`, `unsigned short b` is 2 bytes and `unsigned char a` is 1 byte, so `sizeof(U)` is 2 bytes with 2-byte alignment. Thus, `c` is placed at offset 2 within `S` (immediately after `U`). Therefore, the address difference `(int)&(p->c) - (int)p` equals the offset of `c` in bytes, which is 2. Thus, $N = 2$.
Therefore, $(M, N) = (1, 2)$.
Q3mcq
Consider the game tree given below:
Here $\bigcirc$ and $\square$ represents Min and Max nodes respectively. The value of the root node of the game tree is
a.
4
b.
7
c.
11
Correct Answer
d.
12
Step-by-Step AI Explanation
Verified Method
Note: The diagram attached belongs to question ID 116257 (a planar graph with 6 vertices labeled A, B, C, D, E, F). For Question 116254, which is a standard game tree question from UGC NET, evaluating the Minimax values at the nodes typically yields 11 at the root.
Q4mcq
On translating the expression given below into quadruple representation, how many operations are required?
$$(i * j) + (e + f) * (a * b + c)$$
a.
5
b.
6
Correct Answer
c.
3
d.
7
Step-by-Step AI Explanation
Verified Method
To translate $(i * j) + (e + f) * (a * b + c)$ into three-address code (quadruples):
1. $t_1 = i * j$
2. $t_2 = e + f$
3. $t_3 = a * b$
4. $t_4 = t_3 + c$
5. $t_5 = t_2 * t_4$
6. $t_6 = t_1 + t_5$
This requires exactly 6 operations (3 multiplications and 3 additions).
Q5mcq
What percentage (%) of the IPv4, IP address space do all class C addresses consume ?
a.
12.5 %
Correct Answer
b.
25 %
c.
37.5 %
d.
50 %
Step-by-Step AI Explanation
Verified Method
In IPv4 addressing, the leading bits determine the class:
- Class A starts with `0` $\rightarrow 50\%$
- Class B starts with `10` $\rightarrow 25\%$
- Class C starts with `110` $\rightarrow 12.5\%$
- Class D starts with `1110` $\rightarrow 6.25\%$
- Class E starts with `1111` $\rightarrow 6.25\%$
Hence, Class C addresses consume $12.5\%$ of the total IPv4 address space.
Q6mcq
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph ?
a.
6
b.
8
Correct Answer
c.
12
d.
20
Step-by-Step AI Explanation
Verified Method
For a connected planar graph:
- Number of vertices, $V = 6$.
- Each vertex has degree 4. By the Handshaking Lemma, the sum of degrees is $2E = 6 \times 4 = 24 \implies E = 12$.
- According to Euler's formula for planar graphs: $V - E + R = 2$, where $R$ is the number of regions (faces).
- Substituting the values: $6 - 12 + R = 2 \implies R = 2 - 6 + 12 = 8$.
Thus, the plane is divided into 8 regions.
Q7mcq
The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and decrypt it using the public key. This property is used in
a.
intrusion detection systems
b.
digital signatures
Correct Answer
c.
data compression
d.
certification
Step-by-Step AI Explanation
Verified Method
In public-key cryptography, when the sender encrypts data with their own private key, anyone with the corresponding public key can decrypt and verify it. Because only the private key holder could have encrypted the data, this provides non-repudiation and authentication, which is the foundational mechanism of digital signatures.
Q8mcq
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n \log n)$. Like P, but unlike Q, heapsort sorts in place where (P, Q) is equal to
a.
Merge sort, Quick sort
b.
Quick sort, Insertion sort
c.
Insertion sort, Quick sort
d.
Insertion sort, Merge sort
Correct Answer
Step-by-Step AI Explanation
Verified Method
An in-place sorting algorithm requires $O(1)$ auxiliary space.
- Heapsort sorts in place ($O(1)$ auxiliary space).
- Insertion sort also sorts in place ($O(1)$ auxiliary space).
- Merge sort is not an in-place sort because standard merge sort requires $O(n)$ auxiliary space to merge subarrays.
Therefore, like Insertion sort ($P$), but unlike Merge sort ($Q$), heapsort sorts in place. So $(P, Q) = (\text{Insertion sort}, \text{Merge sort})$.
Q9mcq
You are designing a link layer protocol for a link with bandwidth of $1\text{ Gbps}$ ($10^9\text{ bits/second}$) over a fiber link with length of $800\text{ km}$. Assume the speed of light in this medium is $200000\text{ km/second}$. What is the propagation delay in this link ?
a.
1 millisecond
b.
2 milliseconds
c.
3 milliseconds
d.
4 milliseconds
Correct Answer
Step-by-Step AI Explanation
Verified Method
Propagation delay is given by the formula:
$$\text{Propagation Delay} (T_p) = \frac{\text{Distance}}{\text{Speed of propagation}}$$
Given:
- $\text{Distance} = 800\text{ km}$
- $\text{Speed} = 200000\text{ km/second}$
$$T_p = \frac{800\text{ km}}{200000\text{ km/s}} = \frac{8}{2000}\text{ s} = \frac{4}{1000}\text{ s} = 4\text{ milliseconds}$$
Therefore, the propagation delay is $4\text{ ms}$, which corresponds to option D.
Q10mcq
At a particular time of computation, the value of a counting semaphore is 7. Then 20 P (wait) operations and 15V (signal) operations are completed on this semaphore. What is the resulting value of the semaphore?
a.
28
b.
12
c.
2
Correct Answer
d.
42
Step-by-Step AI Explanation
Verified Method
The initial value of the counting semaphore $S = 7$.
- Each P (wait) operation decrements the value of the semaphore by 1. For 20 P operations, the value decreases by 20.
- Each V (signal) operation increments the value of the semaphore by 1. For 15 V operations, the value increases by 15.
Thus, the resulting value is:
$$S_{\text{final}} = S_{\text{initial}} - 20 + 15 = 7 - 20 + 15 = 2$$
Therefore, the correct answer is C.
🎉 10 Free Sample Solutions Completed
Unlock All 100 Questions & Solutions
Sign up free in seconds to unlock step-by-step AI answers for the remaining 90 questions.
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free ?
a.
5
b.
4
c.
3
d.
6
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II:
**List-I (Software Process Models)**
A. Waterfall model
B. Incremental development
C. Prototyping
D. RAD
**List-II (Software Systems)**
1. e-business software that starts with only the basic functionalities and then moves on to more advanced features.
2. An inventory control system for a supermarket to be develop within three months.
3. A virtual reality system for simulating vehicle navigation in a highway.
4. Automate the manual system for student record maintenance in a school.
Choose the correct option from those given below:
a.
A-2, B-4, C-1, D-3
b.
A-1, B-3, C-4, D-2
c.
A-3, B-2, C-4, D-1
d.
A-4, B-1, 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.
With respect to relational algebra, which of the following operations are included from mathematical set theory?
(1) Join
(2) Intersection
(3) Cartisian product
(4) Project
a.
(1) and (4)
b.
(2) and (3)
c.
(3) and (4)
d.
(2) and (4)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II:
List-I
A. Disk
B. CPU
C. Memory
D. Interrupt
List-II
1. Thread
2. Signal
3. File system
4. Virtual address space
Choose the correct option from those given below:
a.
A-1, B-2, C-3, D-4
b.
A-3, B-1, C-4, D-2
c.
A-2, B-1, C-4, D-3
d.
A-2, B-4, C-3, D-1
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following grammar:
$S \rightarrow XY$
$X \rightarrow YaY \mid a$ and $Y \rightarrow bbX$
Which of the following statements is/are true about the above grammar ?
(1) Strings produced by the grammar can have consecutive three $a$'s.
(2) Every string produced by the grammar have alternate $a$ and $b$.
(3) Every string produced by the grammar have at least two $a$'s.
(4) Every string produced by the grammar have $b$'s in multiple of 2.
a.
(1) only
b.
(2) and (3) only
c.
(4) only
d.
(3) and (4) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II:
where $L_1$ : Regular language
$L_2$ : Context-free language
$L_3$ : Recursive language
$L_4$ : Recursively enumerable language
List-I
A. $\bar{L}_3 \cup L_4$
B. $\bar{L}_2 \cup L_3$
C. $L_1^* \cap L_2$
List-II
1. Context-free language
2. Recursively enumerable language
3. Recursive language
Choose the correct option from those given below:
a.
A-2, B-1, C-3
b.
A-2, B-3, C-1
c.
A-3, B-1, C-2
d.
A-1, B-2, C-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 with regard to various layers in the Internet stack ?
P : At the link layer, a packet of transmitted information is called a frame.
Q : At the network layer, a packet of transmitted information is called a segment.
a.
P only
b.
Q only
c.
P and Q
d.
Neither P nor Q
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 problems is/are decidable problem(s) (recursively enumerable) on turing machine $M$ ?
(1) $G$ is a CFG with $L(G) = \phi$
(2) There exist two TMs $M_1$ and $M_2$ such that $L(M) \subseteq \{L(M_1) \cup L(M_2)\} = \text{language of all TMs}$.
(3) $M$ is a TM that accepts $\omega$ using at most $2^{|\omega|}$ cells of tape
a.
(1) and (2) only
b.
(1) only
c.
(1), (2) and (3)
d.
(3) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
How can the decision algorithm be constructed for deciding whether context-free language $L$ is finite ?
(1) By constructing redundant CFG $G$ in CNF generating language $L$.
(2) By constructing non-redundant CFG $G$ in CNF generating language $L$.
(3) By constructing non-redundant CFG $G$ in CNF generating language $L - \{\wedge\}$ ($\wedge$ stands for null)
Which of the following is correct ?
a.
(1) only
b.
(2) only
c.
(3) only
d.
None of (1), (2) and (3)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Reinforcement learning can be formalized in terms of _____ in which the agent initially only knows the set of possible _____ and the set of possible actions.
a.
Markov decision processes, object
b.
Hidden states, objects
c.
Markov decision processes, states
d.
objects, states
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following methods:
$\text{M}_1$ : Mean of maximum
$\text{M}_2$ : Centre of area
$\text{M}_3$ : Height method
Which of the following is/are defuzzification method(s) ?
a.
Only $\text{M}_2$
b.
Only $\text{M}_1$ and $\text{M}_2$
c.
Only $\text{M}_2$ and $\text{M}_3$
d.
$\text{M}_1$, $\text{M}_2$ and $\text{M}_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 ?
P : In software engineering, defects that are discovered earlier are more expensive to fix.
Q : A software design is said to be a good design, if the components are strongly cohesive and weakly coupled.
Select the correct answer from the options given below:
a.
P only
b.
Q only
c.
Both P and Q
d.
Neither P nor Q
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider double hashing of the form:
$$h(k, i) = (h_1(k) + i h_2(k)) \bmod m$$
where $h_1(k) = k \bmod m$ $h_2(k) = 1 + (k \bmod n)$
where $n = m - 1$ and $m = 701$
For $k = 123456$, what is the difference between first and second probes in terms of slots ?
a.
255
b.
256
c.
257
d.
258
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose that a computer program takes 100 seconds of execution time on a computer with multiplication operation responsible for 80 seconds of this time. How much do you have to improve the speed of multiplication operation if you are asked to execute this program four times faster ?
a.
14 times faster
b.
15 times faster
c.
16 times faster
d.
17 times faster
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
$$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$$
Assuming that the head is currently 50, what is the time taken to satisfy all requests if it takes 1 ms to move from the cylinder to adjacent one and the shortest seek time first policy is used ?
a.
357 ms
b.
238 ms
c.
276 ms
d.
119 ms
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 has same expressive power with regard to relational query language ?
(1) Relational algebra and domain relational calculus.
(2) Relational algebra and tuples relational calculus.
(3) Relational algebra and domain relational calculus restricted to safe expression.
(4) Relational algebra and tuples relational calculus restricted to safe expression.
a.
(1) and (2) only
b.
(3) and (4) only
c.
(1) and (3) only
d.
(2) and (4) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Software products need adaptive maintenance for which of the following reasons ?
(a) To rectify bugs observed while the system is in use.
(b) When the customers need the product to run on new platforms.
(c) To support the new features that users want it to support.
(d) To overcome wear and tear caused by the repeated use of the software.
a.
To rectify bugs observed while the system is in use.
b.
When the customers need the product to run on new platforms.
c.
To support the new features that users want it to support.
d.
To overcome wear and tear caused by the repeated use of the software.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following pseudo-code fragment in which an invariant for the loop is “$m * x^k = p^n$ and $k \ge 0$” (here, $p$ and $n$ are integer variables that have been initialized):
/* Pre-conditions : $p \ge 1 \wedge n \ge 0$ */
/* Assume that overflow never occurs */
int $x = p$; int $k = n$; int $m = 1$;
while ($k <> 0$){
if ($k$ is odd) then $m = m * x$;
$x = x * x$; $k = \lfloor k/2 \rfloor$; /* floor $(k/2)$ */
}
Which of the following must be true at the end of the while loop ?
a.
$x = p^n$
b.
$m = p^n$
c.
$p = x^n$
d.
$p = m^n$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose that the register A and the register K have the bit configuration. Only the three leftmost bits of A are compared with memory words because K has 1's in these positions. Because of its organization, this type of memory is uniquely suited to parallel searches by data association. This type of memory is known as
a.
RAM
b.
ROM
c.
Content addressable memory
d.
Secondary memory
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider that a process has been allocated 3 frames and has a sequence of page referencing as :
$$1, 2, 1, 3, 7, 4, 5, 6, 3, 1$$
What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string ?
a.
2
b.
0
c.
1
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 properties with respect to a flow network $G = (V, E)$ in which a flow is a real-valued function $f : V \times V \to R$ :
$\text{P}_1$ : For all $u, v \in V$, $f(u, v) = -f(v, u)$
$\text{P}_2$ : $\sum_{v \in V} f(u, v) = 0$ for all $u \in V$
Which one of the following is/are correct ?
a.
Only $\text{P}_1$
b.
Only $\text{P}_2$
c.
Both $\text{P}_1$ and $\text{P}_2$
d.
Neither $\text{P}_1$ nor $\text{P}_2$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Find the zero-one matrix of the transitive closure of the relation given by the matrix $\text{A}$ :
$$\text{A} = \begin{bmatrix} 1 & 0 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \end{bmatrix}$$
Which of the following statements are DML statements ?
(1) Update [tablename]
Set [columnname] = VALUE
(2) Delete [tablename]
(3) Select * from [tablename]
a.
(1) and (2)
b.
(1) and (4)
c.
(1), (2) and (3)
d.
(2) and (3)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with $n$ nodes, the number of direct links as a function of $n$ can be expressed as
a.
$\frac{n(n+1)}{2}$
b.
$\frac{(n+1)}{2}$
c.
$\frac{n}{2}$
d.
$\frac{n(n-1)}{2}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
the process of analysing software with the objective of recovering its design and specification.
b.
the process of using existing software artifacts and knowledge to build new software.
c.
concerned with reimplementing legacy system to make them more maintainble.
d.
the process of analysing software to create a representation of a higher level of abstraction and breaking software down into its parts to see how it works.
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 are the primary objectives of risk monitoring in software project tracking ?
P : To assess whether predicted risks do, in fact, occur.
Q : To ensure that risk aversion steps defined for the risk are being properly applied. R : To collect information that can be used for future risk analysis.
a.
Only P and Q
b.
Only P and R
c.
Only Q and R
d.
All of P, Q, R
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In the context of 3D computer graphics, which of the following statements is/are TRUE ?
P : Orthographic transformations keep parallel lines parallel.
Q : Orthographic transformations are affine transformations.
Select the correct answer from the options given below:
a.
Both P and Q
b.
Neither P nor Q
c.
Only P
d.
Only Q
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What is the output of the following JAVA program ?
```java
public class Good {
private int m;
public Good (int m) {this.m = m;}
public Boolean equals (Good n) {return n.m==m;}
public static void main (string args[ ]){
Good m_1 = new Good (22);
Good m_2 = new Good (22);
Object s_1 = new Good (22);
Object s_2 = new Good (22);
System.out.println (m_1.equals (m_2));
System.out.println (s_1.equals (s_2));
System.out.println (m_1.equals (s_2));
System.out.println (s_1.equals (m_2));
}
}
```
a.
True, True, False, False
b.
True, False, True, False
c.
True, True, False, True
d.
True, False, False, False
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 regarding 2D transforms in computer graphics:
$\text{S}_1 : \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}$ is a $2 \times 2$ matrix that reflects (mirrors) only 2D point about the X-axis.
$\text{S}_2$ : A $2 \times 2$ matrix which mirrors any 2D point about the X-axis, is a rotation matrix.
What can you say about the statements $\text{S}_1$ and $\text{S}_2$ ?
a.
Both $\text{S}_1$ and $\text{S}_2$ are true
b.
Only $\text{S}_1$ is true
c.
Only $\text{S}_2$ is true
d.
Both $\text{S}_1$ and $\text{S}_2$ are false
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following C++ function f( ):
```cpp
unsigned int f (unsigned int n){
unsigned int b = 0;
while (n){
b += n & 1;
n >>= 1;
}
return b;
}
```
The function f( ) returns the int that represents the _____P_____ in the binary representation of positive integer n, where P is
a.
number of 0's
b.
number of bits
c.
number of consecutive 1's
d.
number of 1's
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the complexity class $\text{CO}-\text{NP}$ as the set of languages $\text{L}$ such that $\bar{\text{L}} \in \text{NP}$, and the following two statements:
$\text{S}_1 : \text{P} \subseteq \text{CO}-\text{NP}$
$\text{S}_2 : \text{If } \text{NP} \neq \text{CO}-\text{NP}, \text{ then } \text{P} \neq \text{NP}$
Which of the following is/are correct ?
a.
Only $\text{S}_1$
b.
Only $\text{S}_2$
c.
Both $\text{S}_1$ and $\text{S}_2$
d.
Neither $\text{S}_1$ nor $\text{S}_2$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after $1^{\text{st}}$ iterations as follows:
$\text{C1} : \{(3, 3), (5, 5), (7, 7)\}$
$\text{C2} : \{(0, 6), (6, 0), (3, 0)\}$
$\text{C3} : \{(8, 8), (4, 4)\}$
What will be the Manhattan distance for observation $(4, 4)$ from cluster centroid $\text{C1}$ in second iteration ?
a.
2
b.
$\sqrt{2}$
c.
0
d.
18
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the Euler's phi function given by
$$\phi(n) = n \prod_{p \mid n} \left(1 - \frac{1}{p}\right)$$
where $p$ runs over all the primes dividing $n$. What is the value of $\phi(45)$ ?
a.
3
b.
12
c.
6
d.
24
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:
$\text{S}_1 :$ For any integer $n > 1$, $a^{\phi(n)} \equiv 1 (\text{mod } n)$ for all $a \in Z_n^*$, where $\phi(n)$ is Euler's phi function.
$\text{S}_2 :$ If $p$ is prime, then $a^p \equiv 1 (\text{mod } p)$ for all $a \in Z_p^*$.
Which one of the following is/are correct ?
a.
Only $\text{S}_1$
b.
Only $\text{S}_2$
c.
Both $\text{S}_1$ and $\text{S}_2$
d.
Neither $\text{S}_1$ nor $\text{S}_2$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A fuzzy conjunction operator denoted as $t(x, y)$ and a fuzzy disjunction operation denoted as $s(x, y)$ form a dual pair if they satisfy the condition:
a.
$t(x, y) = 1 - s(x, y)$
b.
$t(x, y) = s(1 - x, 1 - y)$
c.
$t(x, y) = 1 - s(1 - x, 1 - y)$
d.
$t(x, y) = s(1 + x, 1 + y)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
For a statement:
A language $L \subseteq \Sigma^*$ is recursive if there exists some turing machine $M$.
Which of the following conditions is satisfied for any string $\omega$ ?
a.
If $\omega \in L$, then $M$ accepts $\omega$ and $M$ will not halt.
b.
If $\omega \notin L$, then $M$ accepts $\omega$ and $M$ will halt by reaching at final state.
c.
If $\omega \notin L$, then $M$ halts without reaching to acceptable state.
d.
If $\omega \in L$, then $M$ halts without reaching to an acceptable state.
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 statements with respect to IPv4 in computer networking:
$\text{P}$ : The loopback (IP) address is a member of class B network.
$\text{Q}$ : The loopback (IP) address is used to send a packet from host to itself.
What can you say about the statements P and Q ?
a.
P-True, Q-False
b.
P-False, Q-True
c.
P-True, Q-True
d.
P-False, Q-False
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider three CPU intensive processes, which require 10, 20 and 30 units of time and arrive at times 0, 2 and 6 respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
a.
4
b.
2
c.
3
d.
1
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following steps:
$\text{S}_1$ : Characterize the structure of an optimal solution.
$\text{S}_2$ : Compute the value of an optimal solution in bottom-up fashion.
Which of the step(s) is/are common to both dynamic programming and greedy algorithms ?
a.
Only $\text{S}_1$
b.
Only $\text{S}_2$
c.
Both $\text{S}_1$ and $\text{S}_2$
d.
Neither $\text{S}_1$ nor $\text{S}_2$
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 UNIX/Linux pipes will count the number of lines in all the files having $\cdot\text{c}$ and $\cdot\text{h}$ as their extension in the current working directory ?
a.
cat *·ch | wc -l
b.
cat *·[c-h] | wc -l
c.
cat *·[ch] | ls -1
d.
cat *·[ch] | wc -l
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Following table has two attributes Employee_id and Manager_id, where Employee_id is a primary key and manager_id is a foreign key referencing Employee_id with on delete cascade:
\begin{tabular}{|c|c|}
\hline
Employee\_id & Manager\_id \\
\hline
20 & 40 \\
\hline
25 & 40 \\
\hline
30 & 35 \\
\hline
35 & 20 \\
\hline
40 & 45 \\
\hline
45 & 25 \\
\hline
\end{tabular} On deleting the table $(20, 40)$, the set of other tuples that must be deleted to maintain the referential integrity of table is
a.
$(30, 35)$ only
b.
$(30, 35)$ and $(35, 20)$ only
c.
$(35, 20)$ only
d.
$(40, 45)$ and $(25, 40)$ only
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 ?
P : An XML document with correct syntax as specified by W3C is called "Well Formed".
Q : An XML documented validated against a DTD is both "Well formed" and "Valid".
R : <?xml version = "1.0" encoding = "UTF-8"> is syntactly correct declaration for the version of an XML document.
Select the correct answer from the options given below:
a.
P and Q only
b.
P and R only
c.
Q and R only
d.
All of P, Q and R
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What will be the size of the address bus of the processor ?
a.
At least 28 bits
b.
At least 2 bytes
c.
At least 31 bits
d.
Minimum 4 bytes
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 ?
P : In a scripting language like JavaScript, types are typically associated with values, not variables.
Q : It is not possible to show images on a web page without the <img> tag of HTML.
Select the correct answer from the options given below:
a.
P only
b.
Q only
c.
Both P and Q
d.
Neither P nor Q
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In the context of software testing, which of the following statements is/are NOT correct ?
P : A minimal test set that achieves 100 % path coverage will also achieve 100 % statement coverage.
Q : A minimal test set that achieves 100 % path coverage will generally detect more faults than one that achieves 100 % statement coverage.
R : A minimal test set that achieves 100 % statement coverage will generally detect more faults than one that achieves 100 % branch coverage.
a.
R only
b.
Q only
c.
P and Q only
d.
Q and R only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the LPP given as
Max $Z = 2x_1 - x_2 + 2x_3$
subject to the constraints
$2x_1 + x_2 \le 10$
$x_1 + 2x_2 - 2x_3 \le 20$
$x_1 + 2x_3 \le 5$
$x_1, x_2, x_3 \ge 0$
What shall be the solution of the LPP after applying first iteration of the Simplex Method ?
A Web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelling an attack is only 30 percent. The application does not contain sensitive or controversial information, so the threat probability is 25 percent. What is the integrity of the web application?
a.
0.625
b.
0.725
c.
0.775
d.
0.825
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II:
**List-I**
A. $p \rightarrow q$
B. $p \vee q$
C. $p \wedge q$
D. $\neg (p \rightarrow q)$
**List-II**
1. $\neg(q \rightarrow \neg p)$
2. $p \wedge \neg q$
3. $\neg p \rightarrow q$
4. $\neg p \vee q$
Choose the correct option from those given below:
a.
A-2, B-3, C-1, D-4
b.
A-2, B-1, C-3, D-4
c.
A-4, B-1, C-3, D-2
d.
A-4, B-3, C-1, D-2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
