The subnet mask for a particular networkis 255.255.31.0 Whichof the following pairs of IP addresses could belong to this network?
Sign in
Please select an account to continue using cracku.in
↓ →
The subnet mask for a particular networkis 255.255.31.0 Whichof the following pairs of IP addresses could belong to this network?
In networking, UTP stands for
Loading solution...
The address resolution protocol (ARP) is used for
Loading solution...
Whichof the following is a MAC address?
Loading solution...
Whatis the primary purpose of a VLAN?
Loading solution...
SHA-1 is a
Loading solution...
Advanced Encryption Standard (AES) is based on
Loading solution...
The primary purpose of an operating system is
Loading solution...
Whichis the correctdefinition of a valid processtransition in an operating system?
Loading solution...
The correct matching for the following pairs is

Loading solution...
A page fault
Loading solution...
Using larger block size in a fixed block size file system leads to
Loading solution...
Whichof the following statements about synchronous and asynchronous 1/0 is NOT true?
Loading solution...
Consider three CPU-intensive processes, which require 10,20 and 30 time units and arrive at times 0,2, and 6, respectively. How many context switches are neededif the operating system implements a shortest remaining timefirst scheduling algorithm? Do not count the context switchesat time zero and at the end
Loading solution...
The performanceof Round Robin algorithm depends heavily on
Loading solution...
Consider a system having “n” resources of same type. These resources are shared by 3 processes A, B, C. These have peak demands of 3, 4 and 6 respectively. For what value of “n” deadlock won’t occur
Loading solution...
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below.

(Smaller the number, higher the priority.)
if the CPU scheduling policy is priority scheduling without pre-emption, the average waiting time will be
Loading solution...
The range of integers that can be represented by an n-bit 2’s compiement number system is
Loading solution...
The switching expression corresponding to $$f(A, B, C, D) = \sum (1, 4, 5, 9, 11, 12)$$ is
Loading solution...
Consider the following boolean function of four variables $$f(w, x, y, z) = \sum (1, 3, 4, 6, 9, 11, 12, 14)$$, The function is
Loading solution...
In which addressing mode,the effectives address of the operand is generated by adding a constantvalue to the content of a register?
Loading solution...
A certain microprocessor requires 4.5 microseconds to respond to an interrupt. Assuming that the three interrupts $$ I_1, I_2$$ and $$I_3 $$ require the following execution time after the interrupt is recognized :
(i) $$ I_1 $$ requires 25 micro seconds
(ii) $$ I_2 $$ requires 35 microseconds
(iii) $$ I_3 $$ requires 20 microseconds
$$ I_1 $$ has the highest priority and $$ I_3 $$ has the lowest. What is the possible range of time for $$ I_3 $$ to be executed assuming that it may or may not occur simultaneously with other interrupts?
Loading solution...
The processof organizing the memory into two banksto allow 8- and 16- bit data operation is called
Loading solution...
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the inorder traversal sequenceof the resultant tree?
Loading solution...
A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elementsin the set.
1. Deletion of the smallest element.
2. Insertion of an element if it is not already present in the set.
Whichof the following data structures can be used for this purpose?
Loading solution...
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 (the height is the maximum distance of a leaf node from the root)?
Loading solution...
Assume that the operators $$ +, -, \times $$ are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, $$ \times , +, -.$$ The postfix expression corresponding to the infix expression $$ a + b \times c - d$$ ^ e ^ f is
Loading solution...
The infix expression A + (B — C)* D is correctly represented in prefix notation as
Loading solution...
A one dimensionalarray A has indices 1.... 75. Each element is a string and takes up three memory words. The arrayis stored at location 1120 decimal. The starting addressof A [49] is
Loading solution...
Thefive items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each elementis inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is
Loading solution...
A full binary tree with n leaves contains
Loading solution...
The expression 1 * 2 ^ 3 * 4 ^ 5 * 6 will be evaluated as
Loading solution...
The feature in object-oriented programming that allows the same operation to be carried out differently, depending on the object,is
Loading solution...
The microinstructions stored in the control memory of a processor have a width of 26 bits. Each microinstruction is divided into three fields: a micro-operation field of 13 bits, a next addressfield (X), and a MUX selectfield (Y). There are 8 status bits in the inputs of the MUX. How manybits are there in the X and fields, and whatis the size of the control memoryin number of words?
Loading solution...
A CPU has 24-bit instructions. A program starts at address 300 (in decimal). Which one ofthe following is a legal program counter(all values in decimal)?
Loading solution...
Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors pertrack. 512 bytes of data are stores in a bit serial manner ina sector. The capacity of the disk pack and the numberof bits required to specify a particular sector in the disk are respectively
Loading solution...
Consider a pipelined processor with the following four stages
IF: Instruction Fetch
ID: Instruction Decode and Operand Fetch
EX: executed
WB: Write Back
The IF, ID and WB stagestake one clock cycle each to complete the operation. The ADD and SUB instructions need 1 clock cycle and the MUL instruction need 3 clock cycles in the EX stage. Operand forwarding is usedin the pipelined processor. What is the number of clock cycles taken to complete the following sequence of instructions?
ADD R2, R1, RO R2 $$\leftarrow$$ R1 + R0
MUL R4, R3, R2 R4 $$\leftarrow$$ R3 * R2
SUB R6, R5, R4 R6 $$\leftarrow$$ R5 - R4
Loading solution...
The use of multiple register windows with overlap causes a reduction in the number of memory accesses for
1.Function locals and parameters
2.Register saves and restores
3.Instruction fetches
Loading solution...
A processorthat has carry, overflow and sign flag bits as part of its program status word (PSW)performsaddition of the following two 2’s complement numbers 01001101 and 11101001. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be
Loading solution...
The two numbers given below are multiplied using the Booth’s algorithm.
Multiplicand : 0101 1010 1110 1110
Multiplier: 0111 0111 1011 1101
How manyadditions/Subtractions are required for the multiplication of the above two numbers?
Loading solution...
The addition of 4-bit, two’s complement, binary numbers 1101 and 0100 results in
Loading solution...
Which of the flowing statements about relative addressing modeis FALSE?
Loading solution...
Substitution of values for names (whose values are constants) is done in
Loading solution...
A root $$\alpha$$ of equation f(x) = 0 can be computed to any degree of accuracyif a ‘good’ initial approximation $$ X_0 $$ is chosen for which
Loading solution...
Whichof the following statement is correct
Loading solution...
The shift operator E is defined as
$$ E [f(X_i)] = f (X_i + h) $$ and $$ E^{-1} [f(X_i)] = f (X_i - h) $$
Then $$ \triangle $$ (forward difference) in terms of E is
Loading solution...
The formula $$ \int_{x0}^{xn} y(n) dx \simeq h/2 (y_0 + 2y_1 + ..... + 2y_{n - 1} + y_n) -h/12 ( \triangledown y_n - \triangle y_0) -h/24 (\triangledown^2 y_n + \triangle^2 y_0) -19h/720 (\triangledown^3 y_n - \triangle^3 y_0) $$ ....... is called
Loading solution...
The cubic polynomial y(x) which takes the following values: y(0) = 1, y(1) = 0, y(2) = 1 and y(3) = 10 is,
Loading solution...
$$x = a \cos(t), y = b \sin(t)$$ is the parametric form of
Loading solution...
The value of x at which y is minimum for $$ y = x^2 - 3x + 1$$ is
Loading solution...
The formula $$ P_k = y_0 + k\triangledown y_o + \frac{k(k+1)}{2} \triangledown^2 y_0 + ......+\frac{k...(k + n - 1)}{n!} \triangledown^n y_0 is $$
Loading solution...
If G is a graph with e edges and n vertices the sum of the degrees of all vertices in G is
Loading solution...
Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of componentsin the resultant graph must necessarily lie between.
Loading solution...
A graph in which all nodes are of equal degree, is known as
Loading solution...
If in a graph G there is one and only one path between everypair of vertices then G is a
Loading solution...
A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at most
Loading solution...
Consider the polynomial $$ p(X) = a_0 + a_1 X + a_2 X^2 + a_3 X^3 $$, where $$ a_i \neq 0, \forall i $$. The minimum numberof multiplications needed to evaluate p on an input is
Loading solution...
Consider the following code written in a pass-by-reference language like FORTRAN.
Subroutine swap (ix,iy)
it = ix
L1: ix = iy
L2: iy = it
end
ia = 3
ib = 8
call swap (ia, ib + 5)
print*, ia, ib
end
S1: The compiler will generate code to allocate a temporary nameless cell, initialize it to 13, and pass the address of the cell to swap
S2: On execution the code will generate a runtime error on line L1
S3: On execution the code will generate a runtime error on line L2
S4: The program will print 13 and 8
S5: The program will print 13 and -2
Exactly the following set of statement(s) is correct:
Loading solution...
A square matrix A is called orthogonal if A’A =
Loading solution...
If two adjacent rows of a determinantare interchanged, the value of the determinant
Loading solution...
If $$ \begin{bmatrix}3 & 3 \\x & 5 \end{bmatrix} = 3 $$. then the value of x is
Loading solution...
If A, B, C, are any three matrices, then A’ + B’ + C’ is equal to
Loading solution...

Loading solution...
Let f(x) be the continuous probability density function of a random variable x. The probability that $$ a < x \leq b,$$ is
Loading solution...
If the mean of a normal frequency distribution of 1000 items is 25 and its standard deviation is 2.5, then its maximum ordinate is
Loading solution...
If the pdf of a Poisson distribution is given by $$ f(x) = \frac {e^{-2} 2^x}{x!} $$, then its mean is
Loading solution...
Activities which ensure that the software that has been built, is traceable to customer requirement is covered as part of
Loading solution...
A Testing method, which is normally used as the acceptance test for a software system, is
Loading solution...
The ‘command’ used to change contents of one database using the contents of another databaseby linking them on a common keyfield is called
Loading solution...
A locked database file can be
Loading solution...
Whichof the following contains complete record ofall activity that affected the contents of a database during a certain period of time?
Loading solution...
Purpose of ‘Foreign Key’ in a table is to ensure
Loading solution...
Which of the following scenarios may lead to an irrecoverable error ina database system?
Loading solution...
Use of IPSEC in tunnel moderesults in
Loading solution...
Special software to create a job queue is called a
Loading solution...
Process is
Loading solution...
When a process is rolled back as a result of deadlock the difficulty which arises is
Loading solution...
On receiving an interrupt from an I/O device, the CPU
Loading solution...
Compared to CISC processors, RISC processors contain
Loading solution...
Which of the following is/are true of the auto increment addressing mode?
1. It is useful in creating self relocating code
2. If it is included in an instruction set architecture, then an additional ALU is required for effective address calculation
3. The amount of increment depends on the size of the data item accessed
Loading solution...
Start your IIM journey with the right preparation and crack CAT 2026.
Educational materials for CAT preparation