On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at tracks 345 and the head is moving towards track 0. The queue in FIFO order contains requests for the following tracks. 123, 874, 692, 475, 105, 376. Perform the computation using C-SCAN scheduling algorithm. What is the total distance?

- a)1219
- b)1009
- c)1967
- d)1507

Correct answer is option 'C'. Can you explain this answer?

Saurabh Verma answered • 54 minutes ago

∴ Total distance covered by the head

= (345 -123) + (123 -105) + (105 - 0) + (999 - 0)

+ (999-874) + (874-692) + (692-475) + (475 -376)

= 222 + 18 + 105 + 999 + 125 + 182 + 217 + 99

= 1967

The graph shown below 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is ______________.

- a)66
- b)69
- c)68
- d)70

Correct answer is option 'B'. Can you explain this answer?

Munni Devi answered • 55 minutes ago

In every cycle, the weight of an edge that is not part of MST must by greater than or equal to weights of other edges which are part of MST. Since all edge weights are distinct, the weight must be greater. So the minimum possible weight of ED is 7, minimum possible weight of CD is 16 and minimum possible weight of AB is 10. Therefore minimum possible sum of weights is 69.

NEELAM KUMARI asked • 35 minutes ago

(Diretion) Common Data Questions: 50 & 51

Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.

- a)3
- b)4
- c)5
- d)6

Correct answer is option 'B'. Can you explain this answer?

KRISHNA NAUTIYAL asked • 52 minutes ago

Consider a RISC machine where each instruction is exactly 4 bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with respect to the address of the next instruction in the program sequence. Consider the following

instruction sequence Instr. No. Instruction

i : add R2, R3, R4

i + 1 : sub R5, R6, R7

i + 2 : cmp R1, R9, R10

i + 3 : beq R1, Offset

If the target of the branch instruction is i, then the decimal value of the Offset is ____________

instruction sequence Instr. No. Instruction

i : add R2, R3, R4

i + 1 : sub R5, R6, R7

i + 2 : cmp R1, R9, R10

i + 3 : beq R1, Offset

If the target of the branch instruction is i, then the decimal value of the Offset is ____________

Correct answer is '(-16)'. Can you explain this answer?

SHARDUL VINOD asked • 1 hour ago

Which of the following is true

- a)The AVL trees are more balanced compared to Red Black Trees, but they may cause more rotations during insertion and deletion.
- b)Heights of AVL and Red-Black trees are generally same, but AVL Trees may cause more rotations during insertion and deletion.
- c)Red Black trees are more balanced compared to AVL Trees, but may cause more rotations during insertion and deletion.
- d)Heights of AVL and Red-Black trees are generally same, but Red Black rees may cause more rotations during insertion and deletion.

Correct answer is option 'A'. Can you explain this answer?

ANJALI PRADEEP asked • 1 hour ago

The numbers 1 , 2 .... n are inserted in a binary search tree in some order, In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be

- a)p
- b)p + 1
- c)n - p
- d)n - p + 1

Correct answer is option 'C'. Can you explain this answer?

AMISH KUMAR asked • 2 hours ago

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?

- a)In deadlock prevention, the request for resources is always granted if the resulting state is. safe.
- b)In deadlock avoidance, the request for resources is always granted if the resulting state is safe.
- c)Deadlock avoidance is less restrictive than deadlock prevention.
- d)Deadlock avoidance requires knowledge of resource requirements a priori.

Correct answer is option 'A'. Can you explain this answer?

SAVITA THAKUR asked • 2 hours ago

An 8-Bit DMA Device is operating'is Cycle Stealing Mode (Single Transfer Mode). Each DMA cycle is of 6 clock states and DMA clock is 2 MHz. Intermediate CPU machine cycle takes 2 μsa, determine the DMA Data Transfer Rat

- a)100 Kbytes/sec
- b)200 Kbytes/sec
- c)350 Kbytes/sec
- d)None of these

Correct answer is option 'B'. Can you explain this answer?

SUNAINA RAJESH asked • 2 hours ago

Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10, and 10 x 5, respectively. The minimum number of scalar multiplications required to find the product A1A2A3A4 using the basic matrix multiplication method is

- a)1500
- b)2000
- c)500
- d)100

Correct answer is option 'A'. Can you explain this answer?

LUIS ALDRIGE asked • 2 hours ago

Which of the following statements is not true?

- a)Deadlock can never occur if resources can be shared by competing processes.
- b)Deadlock can never occur if resources must be requested in the same order by processes.
- c)The Banker’s algorithm for avoiding deadlock requires knowing resource requirements in advance
- d)If the resource allocation graph depicts a cycle then deadlock has certainly occured.

Correct answer is option 'B'. Can you explain this answer?

PAWAN KUMAR asked • 2 hours ago

Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true? (GATE CS 2000)

- a){u,v} must be an edge in G, and u is a descendant of v in T
- b){u,v} must be an edge in G, and v is a descendant of u in T
- c)If {u,v} is not an edge in G then u is a leaf in T
- d)If {u,v} is not an edge in G then u and v must have the same parent in T

Correct answer is option 'C'. Can you explain this answer?

SAVITA THAKUR asked • 2 hours ago

Consider a network path with three links.

Link 1 – Speed : 10 Gbps, Propagation Delay : 40ms

Link 2 – Speed : 2 Gbps, Propagation Delay : 5ms

Link 3 – Speed : 2 Gbps, Propagation Delay : 10ms

Assume processing delay to be zero.

A data packet of 500 KB is sent from a source to a destination via the path : link 1 – link 3 – link 2.

Link 1 – Speed : 10 Gbps, Propagation Delay : 40ms

Link 2 – Speed : 2 Gbps, Propagation Delay : 5ms

Link 3 – Speed : 2 Gbps, Propagation Delay : 10ms

Assume processing delay to be zero.

A data packet of 500 KB is sent from a source to a destination via the path : link 1 – link 3 – link 2.

- a)54.90 ms
- b)50.20 ms
- c)55.55 ms
- d)59.40 ms

Correct answer is option 'D'. Can you explain this answer?

KAJAL PAWAN asked • 2 hours ago

In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent?

- a)x = 5 AND not(not(x = 5))
- b)x = 5 AND x> 4 and x < 6, where x is an integer
- c)x < 5 AND not (x = 5)
- d)None of the above

Correct answer is option 'C'. Can you explain this answer?

Sampath Warrior asked • 2 hours ago

In a multi-user operating system, 20 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 45 minutes is

- a)e
^{-15} - b)e
^{-5} - c)1 - e
^{-5} - d)1 - e
^{-10}

Correct answer is option 'A'. Can you explain this answer?

Lucian Storm Xenith asked • 3 hours ago

The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that the processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol is used, is:

- a)
- b)
- c)
- d)

Correct answer is option 'C'. Can you explain this answer?

ATUL SINGH asked • 3 hours ago

A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below? 4, 7, 6, 1, 7, 6, 1, 2, 7, 2

- a)4
- b)5
- c)6
- d)7

Correct answer is option 'C'. Can you explain this answer?

VIVEK KUMAR asked • 3 hours ago

A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals.

Which of the following strings is generated by the grammar above?

- a)aabbaba
- b)aabaaba
- c)abababb
- d)aabbaab

Correct answer is option 'D'. Can you explain this answer?

HIND PRATAP asked • 3 hours ago

B^{+} trees are preferred to binary trees in databases because

- a)Disk capacities are greater than memory capacities
- b)Disk access is much slower than memory access
- c)Disk data transfer rates are much less than memory data transfer rates
- d)Disks are more reliable than memory

Correct answer is option 'B'. Can you explain this answer?

ADITYA DATTATRAY asked • 3 hours ago

Consider the grammar with the following translation rules and E as the start symbol.

E → E1 # T { E.value = E1.value * T.value }

| T{ E.value = T.value }

T → T1 & F { T.value = T1.value + F.value }

| F{ T.value = F.value }

F → num { F.value = num.value }

Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

- a)200
- b)180
- c)160
- d)40

Correct answer is option 'C'. Can you explain this answer?

Meghna Kataria asked • 3 hours ago

From the following instance of a relation schema R(A, B, C), we can conclude that:

- a)A functionally determines B and B functionally determines C.
- b)A functionally determines B and B does not functionally determine C.
- c)A does not functionally determine C.
- d)All of the above are correct.

Correct answer is option 'D'. Can you explain this answer?

SUSHMA KUMARI asked • 4 hours ago

G is a graph on n vertices and 2n - 2 edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for G?

- a)For every subset of k vertices, the induced subgraph has at most 2k-2 edges
- b)The minimum cut in G has at least two edges
- c)There are two edge-disjoint paths between every pair to vertices
- d)There are two vertex-disjoint paths between every pair of vertices

Correct answer is option 'D'. Can you explain this answer?

G AMSHUMAAN asked • 4 hours ago

Which of the following languages is (are) non-regular? L_{1} = {0^{m}1^{n} | 0 ≤ m ≤ n ≤ 10000} L_{2} = {w | w reads the same forward and backward} L_{3} = {w ∊ {0, 1} * | w contains an even number of 0's and an even number of 1's}

- a)L
_{2}and L_{3}only - b)L
_{1}and L_{2}only - c)L
_{3}only - d)L
_{2}only

Correct answer is option 'D'. Can you explain this answer?

SAVITA THAKUR asked • 5 hours ago

The CPU initializes the DMA by sending ______ .

- a)The starting address of the memory blocks where data is available or where data is to be stored.
- b)The word count.
- c)Control for mode and start the transfer.
- d)All of these

Correct answer is option 'D'. Can you explain this answer?

SHUBHAM KUMAR asked • 5 hours ago

Entity set TRANSACTION has the attributes transaction number, date, amount. Entity set ACCOUNT has the attributes account number, customer name, balance.

Q. Which is the primary key of the weak entity?

Q. Which is the primary key of the weak entity?

- a)Account number
- b){Account number, transaction number}
- c){Account number, date}
- d){Transaction number, date}

Correct answer is option 'B'. Can you explain this answer?

Pooja Daphal asked • 6 hours ago

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in

addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

- a)160 Kbits
- b)136 Kbits
- c)40 Kbits
- d)32 Kbits

Correct answer is option 'A'. Can you explain this answer?

MONIKA TEMPTA asked • 6 hours ago

Which of the following is TRUE?

- a)Every subset of a regular set is regular
- b)Every finite subset of a non-regular set is regular
- c)The union of two non-regular sets is not regular
- d)Infinite union of finite sets is regular

Correct answer is option 'B'. Can you explain this answer?

KIRAN SHARMA asked • 6 hours ago

Match the pairs in the following questions:

(A) Base addressing (p) Reentranecy

(B) Indexed addressing (q) Accumulator

(C) Stack addressing (r) Array

(D) Implied addressing (s) Position independent

(A) Base addressing (p) Reentranecy

(B) Indexed addressing (q) Accumulator

(C) Stack addressing (r) Array

(D) Implied addressing (s) Position independent

- a)A-S, B-R, C-P, D-Q
- b)A-S, B-R, C-Q, D-P
- c)A-R, B-S, C-Q, D-P
- d)A-R, B-S, C-P, D-Q

Correct answer is option 'A'. Can you explain this answer?

DILPREET SINGH asked • 6 hours ago

Which of the following statements is/are FALSE?

1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.

2. Turing recognizable languages are closed under union and complementation.

3. Turing decidable languages are closed under intersection and complementation.

4. Turing recognizable languages are closed under union and intersection.

2. Turing recognizable languages are closed under union and complementation.

3. Turing decidable languages are closed under intersection and complementation.

4. Turing recognizable languages are closed under union and intersection.

- a)1 and 4 only
- b)1 and 3 only
- c)2 only
- d)3 only

Correct answer is option 'C'. Can you explain this answer?

ANCHAL NIRANJAN asked • 6 hours ago

Consider a function f(A,B,C,D) defined by the summation of the terms 1, 5, 6, 7, 11, 12, 13, 15. What is the value of function ‘f’ in the SOP form?

- a)A’ C’ D + A B C’ + A’ B C + A C D
- b)A’ C’ D’ + A’ B C’ + A’ B C + A C D
- c)A’ C’ D + A’ B C’ + A’ B C’ + A’ C’ D
- d)A’ C’ D + A’ B C’ + A’ B’ C + A’ C’ D

Correct answer is option 'A'. Can you explain this answer?

PUSHPA KUMARI asked • 7 hours ago

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a person in that room, without knowing which type he is from and tell him to toss it and hide the result from you till you ask for it. Upon asking, the person replies the following:

“The result of the toss is head if and only if I am telling the truth.”

Q.

Which of the following options is correct?

Which of the following options is correct?

- a)The result is head
- b)The result is tail
- c)If the person is of Type 2, then the result is tail
- d)If the person is of Type 1, then the result is tai

Correct answer is option 'A'. Can you explain this answer?

Gaurav Kumar asked • 7 hours ago

Consider the languages:

L1 = {a^{n}b^{n}c^{m} | n, m > 0} L2 = {a^{n}b^{m}c^{m} | n, m > 0}

- a)L1 ∩ L2 is a context-free language
- b)L1 U L2 is a context-free language
- c)L1 and L2 are context-free language
- d)L1 ∩ L2 is a context sensitive language

Correct answer is option 'A'. Can you explain this answer?

HEMLATA BELI asked • 7 hours ago

A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses 7 trucks, then at the end of the 4th day he can clear all the orders. Alternatively, if he uses only 3 trucks, then all the orders are cleared at the end of the 10th day. What is the minimum number of trucks required so that there will be no pending order at the end of the 5th day?

- a)4
- b)5
- c)6
- d)7

Correct answer is option 'C'. Can you explain this answer?

PRAGATI DHARAM asked • 7 hours ago

Consider an (n + k) bit instruction with a k-bit opcode and single n-bit address. Then this instruction allow_______operations and_______ addressable memory cells.

- a)2
^{k, }2^{n + k} - b)2
^{n + k, }2^{n + k} - c)2
^{k}, 2^{n} - d)2
^{n + k, }2^{n + 1}

Correct answer is option 'C'. Can you explain this answer?

HEMLATA BELI asked • 7 hours ago

The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and positive integer W, is there a subset of S whose elements sum to W? A dynamic program for solving this problem uses a 2-dimensional Boolean array X, with n rows and W+1 columns. X[i, j],1 <= i <= n, 0 <= j <= W, is TRUE if and only if there is a subset of {a1 ,a2 ,...,ai} whose elements sum to j. Which of the following is valid for 2 <= i <= n and ai <= j <= W?

- a)X[i, j] = X[i - 1, j] ∨ X[i, j -ai]
- b)X[i, j] = X[i - 1, j] ∨ X[i - 1, j - ai]
- c)X[i, j] = X[i - 1, j] ∧ X[i, j - ai]
- d)X[i, j] = X[i - 1, j] ∧ X[i -1, j - ai]

Correct answer is option 'B'. Can you explain this answer?

Javed Ahmad asked • 8 hours ago

Which of the following is not true about comparison based sorting algorithms?

- a)The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
- b)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
- c)Counting Sort is not a comparison based sorting algortihm
- d)Heap Sort is not a comparison based sorting algorithm

Correct answer is option 'D'. Can you explain this answer?

ANITA KUMARI asked • 8 hours ago

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?

I. Quicksort runs in Θ(n^{2}) time

II. Bubblesort runs in Θ(n^{2}) time

III. Mergesort runs in Θ(n) time

IV. Insertion sort runs in Θ(n) time

II. Bubblesort runs in Θ(n

III. Mergesort runs in Θ(n) time

IV. Insertion sort runs in Θ(n) time

- a)I and II only
- b)I and III only
- c)II and IV only
- d)I and IV only

Correct answer is option 'D'. Can you explain this answer?

NARWAL JAGVIR asked • 8 hours ago

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing.

- a)the shortest path between every pair of vertices.
- b)the shortest path from W to every vertex in the graph.
- c)the shortest paths from W to only those nodes that are leaves of T.
- d)the longest path in the graph

Correct answer is option 'B'. Can you explain this answer?

AMAN KARAKOTI asked • 9 hours ago

The recurrence relation that arises in relation with the complexity of binary search is

- a)T{n) = T{n/2) + k, where k is a constant
- b)T(n) = 27(n/2) + k, where k is a constant
- c)T{n) = T(n/2) + log(n)
- d)T(n) = T(n/2) + n

Correct answer is option 'A'. Can you explain this answer?

YAMUNA DEVI asked • 9 hours ago

A non relocatable program is one which

- a)Cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation.
- b)Consists of a program and relevant information for its relocation.
- c)Can itself perform the relocation of its address sensitive portions.
- d)All of the above

Correct answer is option 'A'. Can you explain this answer?

VUTUKURI SMS asked • 9 hours ago

Which of the following regular expression corresponds to the language of
all strings over the alphabet {a, b) that contains exactly two a’s

more

more

(ii) ab*a

(iii) b* ab*a

a) (i) arid (ii) only

b) (ii) and (iii) only

c) (i) and (iii) only

d) None of these

Correct answer is option 'D'. Can you explain this answer?

MONIKA TEMPTA asked • 9 hours ago

Which of the following algorithms exhibits the unnatural behaviour that, minimum number of comparisons are needed if the list to be sorted is in the reverse order and maximum number of comparisons are needed if they are already in sorted order?

- a)Heap sort
- b)Radix sort
- c)Binary insertion sort
- d)There can’t be any such sorting method

Correct answer is option 'C'. Can you explain this answer?

YAMUNA DEVI asked • 10 hours ago

A database table T1 has 2000 records and occupies 80 disk blocks. Another table T2 has 400 records and occupies 20 disk blocks. These two tables have to be joined as per a specified join condition that needs-to be evaluated for every pair of records from these two tables. The memory buffer space available can hold exactly one block of records for T1 and one block of records for T2 simultaneously at any point in time. No index is available on either table.

Q. If, instead of Nested-loop join, Block nested-loop join is used, again with the most appropriate choice of table in the outer loop, the reduction in number of block accesses required for reading the data will be

Q. If, instead of Nested-loop join, Block nested-loop join is used, again with the most appropriate choice of table in the outer loop, the reduction in number of block accesses required for reading the data will be

- a)0
- b)30400
- c)38400
- d)798400

Correct answer is option 'B'. Can you explain this answer?

AYUSH TOMAR asked • 10 hours ago

Consider the following organization of main memory and cache memory:

Main memory: 64K x 16

Cache memory; 256 x 16

Memory is word-addressable and block size is of 8 words. Determine the size of tag field if direct mapping is used for transforming data from main memory to cache memory.

Main memory: 64K x 16

Cache memory; 256 x 16

Memory is word-addressable and block size is of 8 words. Determine the size of tag field if direct mapping is used for transforming data from main memory to cache memory.

- a)5 bits
- b)6 bits
- c)7 bits
- d)8 bits

Correct answer is option 'D'. Can you explain this answer?

Nishu Mahalwal asked • 10 hours ago

Consider a program P that consists of two source modules M_{1} and M_{2} contained in two different files. If M_{1} contains a reference to a function defined in M_{2 }the reference will be resolved at

- a)Edit-time
- b)Compiie-time
- c)Link-time
- d)Load-time

Correct answer is option 'C'. Can you explain this answer?

SUJATA JEET asked • 10 hours ago

A single-precision floating point number contains the sequence of bits 100011111 00000000001 000000000000, Information is stored in the following left-to-right order, sign bit, exponent (bias 127) and mantissa. Which of the following representation in decimal is equivalent?

- a)2
^{31}(1 + 2^{-12}) - b)(-1) 2
^{31}(1 + 2^{-12}) - c)(—1) 2
^{-65}(1 + 2^{-10}) - d)(-1) 2
^{-96}(1 + 2^{-11})

Correct answer is option 'D'. Can you explain this answer?

Gireesha Gogula asked • 10 hours ago

Given the basic ER and relational models, which of the following is INCORRECT?

- a)An attribute of an entity can have more than one value
- b)An attribute of an entity can be composite
- c)In a row of a relational table, an attribute can have more than one value
- d)In a row of a relational table, an attribute can have exactly one value or a NULL value

Correct answer is option 'C'. Can you explain this answer?

MONIKA MANKOTIA asked • 11 hours ago

A 3000 km long trunk is used to transmit frames using a Go-Back-N protocol. The propagation speed is 6 jasec/ km and trunk data rate is 1.544 Mbps. We ignore the time taken to receive the bits in the acknowledgment. Frame size is 64 Bytes.

What is the maximum number of bits of the sequence number?

- a)5
- b)6
- c)7
- d)8

Correct answer is option 'C'. Can you explain this answer?

SAJAL SAINI asked • 11 hours ago

A certain moving arm disk storage with one head has following specifications:

Number of tracks/recording surface = 200

Disk rotation speed = 2400 rpm

Track storage capacity = 62500 bits

The average latency time (assume that the head can move from one track to another only by traversing the entire track) is

Number of tracks/recording surface = 200

Disk rotation speed = 2400 rpm

Track storage capacity = 62500 bits

The average latency time (assume that the head can move from one track to another only by traversing the entire track) is

- a)2.5 s
- b)2.9 s
- c)3.1 s
- d)3.6 s

Correct answer is option 'A'. Can you explain this answer?

HARSH ARORA asked • 11 hours ago

In a min-heap with n elements with the smallest element at the root, the 7th smallest element can be found in time.

The question was not clear in original GATE exam. For clarity, assume that there are no duplicates in Min-Heap and accessing heap elements below root is allowed.

- a)(n log n)
- b)(n)
- c)(log n
- d)(1)

Correct answer is option 'D'. Can you explain this answer?

PUSHPA KUMARI asked • 12 hours ago

The Boolean expression is a simplified version of expression:

Then which of the following choice is correct:

1. Don’t care conditions don’t exist.

2. Don’t care conditions exist.

3. D (16, 18, 20, 23, 27, 29) is the set of don’t care conditions.

4. D (16, 20, 22, 27, 29) is the set of don’t care conditions.

Then which of the following choice is correct:

1. Don’t care conditions don’t exist.

2. Don’t care conditions exist.

3. D (16, 18, 20, 23, 27, 29) is the set of don’t care conditions.

4. D (16, 20, 22, 27, 29) is the set of don’t care conditions.

- a)1 only
- b)2 and 3 only
- c)2 and 4 only
- d)Data insufficient

Correct answer is option 'C'. Can you explain this answer?

LEKHA DEVI asked • 12 hours ago

RIP is

- a)Protocol used for transmission of IP datagrams across a serial line
- b)Resource information protocol
- c)Protocol used to exchange information between the routers
- d)Protocol used to exchanger information between the layers

Correct answer is option 'C'. Can you explain this answer?

ANCHAL NIRANJAN asked • 12 hours ago

A relation R is defined on the set of integers as xRy if f(x + y) is even. Which of the following statements is true?

- a)R is not an equivalence relation
- b)R is an equivalence relation having 1 equivalence class
- c)R is an equivalence relation having 2 equivalence classes
- d)R is an equivalence relation having 3 equivalence classes

Correct answer is option 'C'. Can you explain this answer?

PREETI VERMA asked • 12 hours ago

Consider the following problem X.

Given a Turing machine M over the input alphabet Σ, any state q of M And a word w∈Σ*, does the computation of M on w visit the state q?

- a)X is decidable
- b)X is undecidable but partially decidable
- c)X is undecidable and not even partially decidable
- d)X is not a decision problem

Correct answer is option 'B'. Can you explain this answer?

BINTA BALA asked • 12 hours ago

Consider the languages L_{1},L_{2} and L_{3} as given below.

and

Which of the following statements is NOT TRUE?

- a)Push Down Automata (PDA) can be used to recognize L1 and L2
- b)L1 is a regular language
- c)All the three languages are context free
- d)Turing machines can be used to recognize all the languages

Correct answer is option 'C'. Can you explain this answer?

HIMANI SHIV asked • 13 hours ago

Which of the following is true about linked list implementation of queue?

- a)In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
- b)In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
- c)Both of the above
- d)None of the above

Correct answer is option 'C'. Can you explain this answer?

POONAM PRITTAM asked • 13 hours ago

Consider the same code as given in above question. What does the function print() do in general? The function print() receives root of a Binary Search Tree (BST) and a positive integer k as arguments.

// A BST node

struct node {

int data;

struct node *left, *right;

};

int count = 0;

struct node {

int data;

struct node *left, *right;

};

int count = 0;

void print(struct node *root, int k)

{

if (root != NULL && count <= k)

{

print(root->right, k);

count++;

if (count == k)

printf("%d ", root->data);

print(root->left, k);

}

}

{

if (root != NULL && count <= k)

{

print(root->right, k);

count++;

if (count == k)

printf("%d ", root->data);

print(root->left, k);

}

}

ISHU KUMARI asked • 13 hours ago

Consider the undirected graph below:

Q.

Using Prim's algorithm to construct a minimum spanning tree starting with node A, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?

- a)(E, G), (C, F), (F, G), (A, D), (A, B), (A, C)
- b)(A, D), (A, B), (A, C), (C, F), (G, E), (F, G)
- c)(A, B), (A, D), (D, F), (F, G), (G, E), (F, C)
- d)(A, D), (A, B), (D, F), (F, C), (F, G), (G, E)

Correct answer is option 'D'. Can you explain this answer?

HIMANI SHIV asked • 13 hours ago

Consider the following translation scheme:

Here id is a token that represents an integer and id.value represents the corresponding integer value. For an input ‘2 * 3 + 4 ’ , this translation scheme prints

- a)2 * 3 + 4
- b)2 * + 3 4
- c)2 3 * 4 +
- d)2 3 4 + *

Correct answer is option 'D'. Can you explain this answer?

Fetching relevant content for you

Ask a question