Gaurav Kumar asked • 44 minutes ago

An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?

- a)Graph G has no minimum spanning tree (MST)
- b)Graph G has a unique MST of cost n-1
- c)Graph G has multiple distinct MSTs, each of cost n-1
- d)Graph G has multiple spanning trees of different costs

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

Soumya Sanket Patra asked • 3 hours ago

Choose the incorrect statements:

1. In network model, data is represented by a collection of records, and relationship among data are represented by links.

2 . In hierarchical model, data and relationships among data are represented by records and links respectively.

3. In hierarchical model, the records are organized as a collection of arbitrary graphs.

4. In network model, the records are organized as a collection of trees.

1. In network model, data is represented by a collection of records, and relationship among data are represented by links.

2 . In hierarchical model, data and relationships among data are represented by records and links respectively.

3. In hierarchical model, the records are organized as a collection of arbitrary graphs.

4. In network model, the records are organized as a collection of trees.

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

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

Swati Rao asked • 5 hours ago

Suppose we have a block-addressable disk drive. With such block-organized disk nondata overhead of subblocks and interblock gaps have to be accounted for. There are 40000 bytes per track and the amount of space taken up/by subblocks and interblocks gaps equivalent to 250 bytes per block. A file contains records and record size is 200 bytes to be stored on the disk, if a total of 32 blocks can be stored per track then what is the blocking factor? The term "blocking factor” is used to indicate the number of records that are to the stored in each block in a file. A block is organized to hold an integral number of logical records.

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

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

Damayanti Daule asked • 5 hours ago

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the

allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given

below presents the current system state. Here, the Allocation matrix shows the current number of

resources of each type allocated to each process and the Max matrix shows the maximum number

of resources of each type required by each process during its execution.

allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given

below presents the current system state. Here, the Allocation matrix shows the current number of

resources of each type allocated to each process and the Max matrix shows the maximum number

of resources of each type required by each process during its execution.

There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is

currently in a safe state. Consider the following independent requests for additional resources in the

current state:

REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z

REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z

Which one of the following is TRUE?

currently in a safe state. Consider the following independent requests for additional resources in the

current state:

REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z

REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z

Which one of the following is TRUE?

Prashant Waghwase asked • 8 hours ago

Let q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"

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

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

Keerthe Reddy asked • 8 hours ago

Vilas Shelke asked • 13 hours ago

Which one of the following is not correct?

- a)telnet is a general purpose client-server program
- b)telnet lets user access an application on a remote computer
- c)telnet can also be used for file transfer
- d)none of the mentioned

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

Neha Prajaapati asked • 14 hours ago

Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.

- a)Leftmost derivation
- b)Leftmost derivation traced out in reverse
- c)Rightmost derivation
- d)Rightmost derivation traced out in reverse

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

Ankit Chakre asked • 14 hours ago

Jnani Kurmadasu asked • 16 hours ago

the following logical formulae represents the above statement?

- a)
^{} - b)
- c)
- d)

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

Apurva Patel asked • 19 hours ago

Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.

- a)O(n)
- b)O(nLogn)
- c)O(Logn)
- d)O(n^2)

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

Rasazna Kls asked • 19 hours ago

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.

- a)Array
- b)Linked List
- c)Heap Data Structures like Binary Heap, Fibonacci Heap
- d)None of the above

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

Madhu Arasi asked • 19 hours ago

Which of the following statements about relative addressing mode is FALSE?

A. It enables reduced instruction size

B. It allows indexing of array element with same instruction

C. It enables easy relocation of data

D. It enables faster address calculation than absolute addressing

A. It enables reduced instruction size

B. It allows indexing of array element with same instruction

C. It enables easy relocation of data

D. It enables faster address calculation than absolute addressing

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

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

Shruthi Lakkabathini asked • 23 hours ago

The term Product-of-sum in Boolean algebra means

- a)AND function of several OR functions
- b)OR function of several AND functions
- c)OR function of several OR functions
- d)AND function of several AND functions

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

Ambati Rajendra asked • yesterday

How is a privilege exception dealt with?

- a)The program is alted and the system switches into supervisor mode and restarts the program execution
- b)The Program is stopped and removed from the queue
- c)The system switches the mode and starts the execution of a new process
- d)The system switches mode and runs the debugger

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

Tarun Kumar asked • yesterday

The correct matching for the following pairs is:

(A) DMA I/O (1) High speed RAM

(B) Cache (2) Disk

(C) Interrupt I/O (3) Printer

(D) Condition Code Register (4) ALU

(A) DMA I/O (1) High speed RAM

(B) Cache (2) Disk

(C) Interrupt I/O (3) Printer

(D) Condition Code Register (4) ALU

- a)A-4 B-3 C-1 D-2
- b)A-2 B-1 C-3 D-4
- c)A-4 B-3 C-2 D-1
- d)A-2 B-3 C-4 D-1

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

Nisi Gupta asked • yesterday

Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?

Correct answer is between '200 KB,300 KB'. Can you explain this answer?

Navya Nalamasa asked • yesterday

- a)A serializable schedule
- b)A schedule that is not conflict serializable
- c)A conflict serializable schedule
- d)A schedule for which a precedence graph cannot be drawn

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

Susan Oomen asked • yesterday

Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an averageof 3 steps and B can execute with an average of 5 steps.For the execution of the same instruction which processor is faster

- a)A
- b)B
- c)Both take the same time
- d)Insufficient information

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

Comedy King asked • yesterday

Which one of the following is FALSE?

- a)There is unique minimal DFA for every regular language
- b)Every NFA can be converted to an equivalent PDA.
- c)Complement of every context-free language is recursive.
- d)Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

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

Fetching relevant content for you

Ask a question