Which of the followingis true?
Sign in
Please select an account to continue using cracku.in
↓ →
Which of the followingis true?
What is the sum to infinity of the series,
$$3+6x^{2}+9x^{4}+12x^{6}+$$........given $$\mid x$$ < 1 ?
Loading solution...
$$\lim_{x \rightarrow o} \frac{\sqrt{1+x}-\sqrt{1-x}}{x}$$ is given by
Loading solution...
If (G, -) is a group such that $$(ab)^{-1} =a_{-1} b^{-1}$$, $$\forall a,b \in G$$ then G is $$\frac{a}{an}$$
Loading solution...
A given connected graph G is a Euler Graphif and only if all vertices of G are of
Loading solution...
Maximum number of edges in a n—node undirected graph withoutself-loops is
Loading solution...
The mimmum number of NAND gates required to implement the Boolean function $$A+A \bar B+A \bar B C $$ is equal to
Loading solution...
The minimum Boolean expression for the following circuit is

Loading solution...
For a binary half-subtractor having two inputs A and B, the correct set of logical expression for the outputs D (= A minus B) and X = borrow) are
Loading solution...
Consider the following gate network

Which one of the following gates is redundant?
Loading solution...
The dynamic hazard problem occurs in
Loading solution...
The logic circuit given below converts a binary code $$y_1, y_2, y_3$$ into

Loading solution...
The circuit shown in the below figure is

Loading solution...
If $$12A7C_{16}=X_{8}$$ then the value of X is
Loading solution...
The Excess-3 Code is also called
Loading solution...
The simplified Sum of Product form of the following Boolean expression $$(P+\overline{Q}+\overline{R})(P+Q+R)(P+Q+\overline{R})$$
Loading solution...
Which of the following binary numberis the sameas its 2’s complement?
Loading solution...
The functional difference between SRflip-flop and JK flip-flop is that
Loading solution...
Which of the following binary numberis the sameas its 2’s complement?
Loading solution...
Whatis the output of this C code?
#include <stdio.h>
void main()
{
int k = 5;
int *p = &k;
int **m = &p;
printf("%d %d %d\n", k, *p, **m);
}
Loading solution...
Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial fashion in a sector. The capacity of the disk pack and the numberofbits required to specify a particular sector in the disk respectively
Loading solution...
Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every $$10^{6}$$ memory accesses, what is the effective access time for the memory?
Loading solution...
Register renaming is done in pipelined processors
Loading solution...
In which class of Flynn’s taxonomy, Von Neumann architecture belongs to?
Loading solution...
What will be output of following program? Assume that you are running this program in little-endian processor.
#include<stdio.h>
int main() {
short a = 320;
char *ptr;
ptr = (char *)&a;
printf("%d"_,*ptr);
return 0;
}
Loading solution...
Consider the following segment of C code
int j, n;
j =1;
while $$(j \leq n)$$
j=j*2;
The number of comparisons madein the execution of the loop for any n > 0 is
Loading solution...
The following postfix expression with single digit operands is evaluated using a stack
8 2 3 ^ / 2 3 * 5 1 * -
(Note that ^ is the exponential operator)
The top two elements of the stack after the first * operator is evaluated are
Loading solution...
Average number of comparison required for a successful search for sequential search on ‘n’ items is
Loading solution...
A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (count table Index 0 as $$0^{th}$$ location )?
Loading solution...
A complete binary tree with n non-leaf nodes contains
Loading solution...
Algorithm design technique used in quick sort algorithm is
Loading solution...
An FSM (Finite State Machine) can be considered to be a Turning Machineof finite tape length
Loading solution...
Let $$L = \left\{\omega \epsilon (0+1)*| \omega \right\}$$ has even number of 1s, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
Loading solution...
Consider the following recurrence
$$T(n)=2T(\sqrt{n})+1$$
$$T(1) = 1$$
Which of the following is true?
Loading solution...
Consider the following statements about the context-free grammar:
$$G = \left\{S \rightarrow SS,S \rightarrow ab, S \rightarrow ba, S\rightarrow \wedge \right\}$$
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III.G can be accepted by a deterministic PDA
Which combinations below expresses all the true statements about G?
Loading solution...
If L and $$\overline{L}$$ are recursively enumerable , then L is
Loading solution...
$$S \rightarrow a Sa|bSb|a|b$$
The language generated by the above grammar over the alphabets { a, b } is the set of
Loading solution...
What is the highest type number that can be assigned to this following grammar : $$S \rightarrow Aa, A \rightarrow Ba, B \rightarrow abc$$
Loading solution...
Access time of the symbol table will be logarithmic, if it is implemented by
Loading solution...
Recursive descent parsing is an example of
Loading solution...
A top-down parser generates
Loading solution...
Relative mode of addressing is most relevant to writing
Loading solution...
A simple two-pass assembler does which of the following in the first pass?
Loading solution...
Peephole optimization is a form of
Loading solution...
At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operation and x V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be
Loading solution...
With single resource, deadlock occurs
Loading solution...
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then
Loading solution...
Determine the numberof page faults whenreferences to pages occur in the following order: 1, 2, 4, 5, 2, 1, 2, 4 Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used)
Loading solution...
Working Set (t, k) at an instant of time t is
Loading solution...
A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is
4-way set associative. The minimum size of the TLB tag is
Loading solution...
The real-time operating system, which of the following is the most suitable scheduling scheme?
Loading solution...
In which one of the following page replacementpolicies, Balady’s anomaly may occur?
Loading solution...
Consider Join of a relation R with a relation S. If R has m tuples and S has n tuples, then maximum and minimum sizes of the Join respectively are
Loading solution...
Let R(a, b,c)and S(d,e, f) be two relations in which d is the foreign key of S that refers to the primary key of R Consider the following four operations in R and S
I.Insert into R
II.Insert into S
III.Deletion from R
IV.Deletion from S
Which of the following can cause violation of the relational integrity constraint above?
Loading solution...
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list?
[select title from book as B where (select count(*) from book as T where T.price > B.price) < 5]
Loading solution...
Goals for the design of the logical schemainclude
Loading solution...
Given the relations employee (name, salary, deptno) and department (depino, deptname, address)
Which of the following queries cannot be expressed using the basic relational algebra operations $$(U,-,x,\pi,\sigma,p)$$
Loading solution...
Trigger is
Loading solution...
The orderofa leaf node in a B+ tree is the maximum numberof (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long andablock pointeris 6 bytes long, what is the orderofthe leaf node?
Loading solution...
A clustering index is defined on thefields which are of type
Loading solution...
The Extent to which the software can continue to operate correctly despite the introduction of invalid inputs is called as
Loading solution...
Which one of the following is a functional requirement?
Loading solution...
Configuration managementis not concerned with
Loading solution...
A company needs to develop a strategy for software product development for which it has a choice of two programming languages L1 and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with L1. The product will have to be maintained for five years. Various parameters for the company are given in the table below.

Total cost of the project includes cost of development and maintenance. What is the LOC for $$L_{1}$$ for which the cost of the project using $$L_{1}$$ is equal to the cost of the project using $$L_{2}$$?
Loading solution...
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 20000 lines of code. The company needs to
determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.2 for the software development on embedded systems, while the exponentiation factor is given as 1.5. What is the estimated effort in person-months?
Loading solution...
In the spiral model of software development, the primary determinantin selecting activities in each iteration is
Loading solution...
Bit stuffing refers to
Loading solution...
Dynamic routing protocol enable routers to:
Loading solution...
In Ethernet $$\frac{CSMA}{CD}$$, the special bit sequenee is transmitted by media access managementto handle collision is called
Loading solution...
Which network protocol Allows hosts to dynamically get a unique IP number on each bootup?
Loading solution...
In a token ring network, the transmission speed is $$10^{7}$$ bps and the propagation speed is 200 $$\frac{m}{\mu s}$$. Then 1 bit delay in this network is equivalent to
Loading solution...
The address of a class B hostis to be split into subnets with a 6-bit subnet number. What is the maximum numberof subnets and the maximum numberofhosts in each subnet?
Loading solution...
The message 11001001is to be transmitted using the CRC polynomial $$x^{3}$$ +1 to protect it from errors. The message that should be transmitted is
Loading solution...
What is the maximum size of data that application layer can pass on to the TCP layer below?
Loading solution...
Framesof 1000 bits are sent over a $$10^{6}$$}bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).What is the minimum numberofbits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
Loading solution...
Which of the following is TRUE only for XML, but not for HTML?
Loading solution...
Consider a system with 2 level caches. Access times of Level 1 cache, Level 2 cache and main memory are 1 ns, 10 ns, and 500 ns, respectively. The hit rates of Level 1 and Level 2 caches are 0.8 and 0.9, respectively. What is the average access time of the system ignoring the search time within the cache?
Loading solution...
If a class C is derived from class B, which is derived from class A, all through public inheritance, then a class C memberfunction can access
Loading solution...
Which oneof the following is correct about the statements given below?
I, All function calls are resolved at compile-time in C language.
II. All function calls are resolved at compile-time in C++.
Loading solution...
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is called
Loading solution...
Start your IIM journey with the right preparation and crack CAT 2026.
Educational materials for CAT preparation