AFCAT EKT Computer Science Mock Test - 5 - Computer Science Engineering (CSE) MCQ

10 flip flop will count from 0 to 1023. Hence 11 flip flops are required to count from 0 to 1024.

(211)_x = (152)₈
2x² + x + 1 = 64 + 40 + 2
x = 7

If G₀G₁G₂G₃ is a gray code number then the BCD equivalent number B₀B₁B₂B₃ can be estimated using:

B₃ = G₃

B₂ = B₃ ⊕ G₂

B₁ = B₂ ⊕ G₁

B₀ = B₁ ⊕ G₀

CRC stands for cyclic redundancy check it is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.

1) 2's complement number of 11100111 = 0011001 = (-25)₁₀
2) 2's complement numbefr of 11100100 = 0011100 = (-28)₁₀
3)2's complement number of 11010111 = 0101001 = (-41)₁₀
4) 2's complement number of 11011011 = 0100101 = (-37)₁₀
Divider,
2's complement number of 11111011 = 0000101 = (-5)₁₀
Since -25 is divisible by -5, thus the number 11100111 is divisible by 11111011. 

Ethernet→data link layer
Internet Protocol→ network layer
Hyper text protocol→application layer

The half adder adds two single binary digits A and B. It has two outputs, sum (S) and carry (C). The carry signal represents an overflow into the next digit of a multi-digit addition. A half adder circuit is basically made up of an a AND gate with XOR gate.
Sum (S) = 
Carry (C) = AB

Given three symbols with probability of 0.25, 0.25 and 0.50 at the rate of 3000 symbols per second.
Entropy 

= 1.5
Rate of information = r.H
= 1.5× 3000
= 4500 bits/sec

In binary multiplication, we only need to remember the following rules:

0 x 0 = 0

0 x 1 = 0

1 x 0 = 0

1 x 1 = 1

So, by using above rules when we will multiply binary 1000 with binary 1111 we will get binary 11110000 as the product.

The determinant if matrix A is given as

When a positive voltage is applied to the N-type material and a negative voltage is applied to the P-type material, then a diode is connected in a reverse bias condition. In reserve bias the holes and electrons are attracted to the battery terminal and depletion region increased.

For x = 3, (x² – 8) > 0 so |x² - 8| = x² – 8

f(x) = x + (x² – 8)

f’(x) = 1 + 2x

Referential Integrity Constraint.

When a foreign key value is used it must reference a valid, existing primary key in the parent table. For instance, deleting a record that contains a value referred to by a foreign key in another table would break referential integrity.

Angle between two vectors:

θ = 60°

The initial phase of database design is to characterize fully the data needs of the prospective database user.The outcome of this phase is a specification of user requirements. Next, the designer chooses a data model and by applying the concepts of the chosen data model, translates these requirements into a conceptual schema of the database. The E-R model, is typically used to represent the conceptual design.

Every weak key of weak entity set must participate therefore total participation.

Doing row operation on the given matrix, we get

Since the number of non-zero rows is one,
∴ ρ(A) = 1

1.000000 is printed but not 1.2 because 6 & 5 are both integers 6/5 yields integer 1. This 1, when stored in ‘a’ whose data type is a float, is converted into 1.000000.

In a binary search tree, key in the left child is smaller than key of the parent which in turn smaller than the key in the right child. Hence inorder traversal of any binary search tre is is always sorted.

Passed by reference unless inside a structure, in that case when we a structure instance, array is automatically get passed.

Here first value of ‘a’ i.e. 5 is copied to x & y; because of’x—‘,x will become 4 and y after performing y = y + 15 will become 20. Now both these two values i.e. 4 and 20 are copied back to ‘a’ but the order is not deterministic so if first 4 is copied back to ‘a’ and then 20, then final value of ‘a’ will be 20, else if 4 is copied later then final value of ‘a’ will be 4 so it is non deterministic and value of ‘a’ can be either 4 or 20.

CPU-scheduling decisions may take place under the following four circumstances:

1. When a process switches from the running state to the waiting state.

2. When a process switches from the running state to the ready state.

3. When a process switches from the waiting state to the ready state.

4. When a process terminates. If no process is ready, a system-supplied idle process is normally run.

• For situations 1 and 4, there is no choice in terms of scheduling. A new process (if one exists in the ready queue) must be selected for execution.
• There is a choice, however, for situations 2 and 3. When scheduling takes place only under circumstances 1 and 4, we say that the scheduling scheme is nonpreemptive or cooperative; otherwise, it is pre-emptive.

As it as an array of pointers to struct type.

Efficiency of CSMA/CD =1/(1+6.44(T_p/T_t))

Tp=propagation time

Tp=transmission time

Hence if propagation time increases efficiency will rapidly decrease.

Fragment offset, source IP address, and destination IP address are part of the IP header but destination port number which is part of TCP header, so correct answer (D)

In TCP sequence Number is assigned to each byte.

(I) TCP connections are full duplex.

(II) TCP has option for selective acknowledgement.

(III) TCP connections are byte streams.

Here n = 10⁹ electrons/sec; Total charge, Q = 1 C
Charge given/sec, q = ne = 10⁹ × 1.6 × 10^-19 = 1.6 × 10^-10 C
If t second is the time required, then,