Virat Kohli asked • 55 minutes ago

Which of the following is true about merge sort?

- a)Merge Sort works better than quick sort if data is accessed from slow sequential memory.
- b)Merge Sort is stable sort by nature
- c)Merge sort outperforms heap sort in most of the practical situations.
- d)All of the above.

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

Ambati Rajendra asked • 2 hours ago

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?

Hemant Gaikwad asked • 8 hours ago

Given the relations

employee (name, salary, deptno) and department (deptno, deptname, address)

- a)Department address of every employee
- b)Employees whose name is the same as their department name
- c)The sum of all employees’ salaries
- d)All employees of a given department

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

Damayanti Daule asked • 9 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 • 14 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?

Akhila Palavalasa asked • 14 hours ago

G Knowledge Ak asked • 15 hours ago

In case Of timestamp ordering R-timestamp (Q) denotes

- a)The largest timestamp of any transaction that execute read (Q) successfully.
- b)The average timestamp of any transaction that execute read (Q) successfully.
- c)The average timestamp of any transaction that execute read (Q) unsuccessfully.
- d)The smallest timestamp of any transaction that execute read (Q) successfully.

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

Nisi Gupta asked • 15 hours ago

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?

Vilas Shelke asked • 15 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 • 15 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?

Sai Kumar asked • 18 hours ago

Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.

- a)Worst case time complexity of both algorithms is same.
- b)Worst case time complexity of Kruskal is better than Prim
- c)Worst case time complexity of Prim is better than Kruskal

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

Javed Ahmad asked • 19 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?

Richa Thakur asked • 21 hours ago

Consider a computer system with ten physical page frames.The system is provided with an access sequence (a_{1};a_{2}; :::;a_{20};a_{1};a_{2}; :::;a_{20}), where each a_{i} is a distinct virtual page number.The difference in the number of page faults between the last-in-first-outpage replacement policy and the optimal page replacement policyis .

- a)1.0 : 2.0
- b)1.0 : 1.0
- c)2.0 : 1.0
- d)2.0 : 2.0

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

Ayushi Sharma asked • 22 hours ago

Given the following expression grammar:

E -> E * F | F + E | F

F -> F - F | id

which of the following is true?

E -> E * F | F + E | F

F -> F - F | id

which of the following is true?

- a)* has higher precedence than +
- b)– has higher precedence than *
- c)+ and — have same precedence
- d)+ has higher precedence than *

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

Rasazna Kls asked • 23 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?

Damayanti Daule asked • yesterday

Which one of the following is FALSE?

- a)A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.
- b)Available expression analysis can be used for common subexpression elimination.
- c)Live variable analysis can be used for dead code elimination.
- d)x = 4 ∗ 5 ⇒ x = 20 is an example of common subexpression elimination.

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

Damayanti Daule asked • yesterday

consider the directed graph given below

which one of the following is true

- a)the graph does not have any topological ordering
- b)Both PQRS and SRQP are topological ordering
- c)Both PSRQ and SPRQ are topological ordering
- d)PSRQ is the only topological ordering

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

Richa Thakur asked • yesterday

Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table perprocess and each page table entry requires48 bits,then the size of the per-process page table is megabytes.

- a)384.0 : 384.0
- b)385.0 : 385.0
- c)386.0 : 386.0
- d)387.0 : 387.0

Correct answer is '384'. Can you explain this answer?

Mrudul Addipalli asked • yesterday

A function f(x) is continuous in the interval [0,2]. It is known that f(0) = f(2) = -1 and f(1) =1 . which one of the following statemnts must be true?

- a)There exists a y in the interval (0,1) such that f(y)= f(y+1)
- b)for every y in the interval (0,1), f(2) = f(2-y)
- c)The maximum value of the function in the interval (0,2) is 1
- d)There exists a y in the interval (0,1) such that f(y) = -f(2-y)

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

Anonymous Keepprivacy asked • yesterday

A relation (from the relational database model) consists of a set of tuples, which implies that

- a)Relational model supports multi-valued attributes whose values can be represented in sets.
- b)For any two tuples, the values associated with all of their attributes may be the same.
- c)For any two tuples, the value associated with one or more of their attributes must differ.
- d)All tuples in a particular relation may have different attributes.

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

Damayanti Daule asked • yesterday

The number of students in a class who have answered correctly, wrongly, or not attempted each question in exam, are listed in the table below. The marks fro each question are also listed. There is no negative or partial marking.

What is the average of the marks obtained by the class in the examination?

- a)2.290
- b)2.970
- c)6.795
- d)8.795

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

Jigar Patel asked • yesterday

The line graph L(G) of a simple graph G is defined as follows: · There is exactly one vertex v(e) in L(G) for each edge e in G. · For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e'are incident with the same vertex in G. Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.

(Q) The line graph of a clique is a clique.

(R) The line graph of a planar graph is planar.

(S) The line graph of a tree is a tree.

(Q) The line graph of a clique is a clique.

(R) The line graph of a planar graph is planar.

(S) The line graph of a tree is a tree.

- a)P only
- b)P and R only
- c)R only
- d)P, Q and S only

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

Kajal R Patil asked • yesterday

"We lived in culture and denied any merit to literally works, Considering them important only when they were handmaidens to something seemingly more urgent - namely ideology. This was a country where all gestures even the most private , interpreted as political terms." The author's believes that ideology is not as important as literature is revealed by the word :

- a)culture
- b)seemingly
- c)urgent
- d)political

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

Swati Rao asked • yesterday

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?

Neeraj Swani asked • yesterday

A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at 25 m intervals in this plot.

Satish Gaikwad asked • yesterday

Consider the following pseudo code. What is the total number of multiplications to be performed?

- a)Half of the product of the 3 consecutive integers.
- b)One-third of the product of the 3 consecutive integers.
- c)One-sixth of the product of the 3 consecutive integers.
- d)None of the above.

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

DIVYA ADITYA asked • yesterday

Consider the following graph:

Among the following sequences

1. a b e g h f

2. a b f e h g

3. a b f h g e

4. a f g h b e

1. a b e g h f

2. a b f e h g

3. a b f h g e

4. a f g h b e

Which are depth first traversals of the above graph?

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

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

Madhu Arasi asked • 2 days 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?

Shweta Sonkar asked • 2 days ago

Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?

- a)Insertion Sort with time complexity O(kn)
- b)Heap Sort with time complexity O(nLogk)
- c)Quick Sort with time complexity O(kLogk)
- d)Merge Sort with time complexity O(kLogk)

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

Pooja Daphal asked • 2 days 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)11
- b)14
- c)16
- d)27

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

Susan Oomen asked • 2 days ago

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?

Navya Nalamasa asked • 2 days ago

- 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?

Damayanti Daule asked • 2 days ago

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a

given graph. In this scenario, which one of the following represents the correct Venn diagram of the

complexity classes P, NP and NP Complete (NPC)?

given graph. In this scenario, which one of the following represents the correct Venn diagram of the

complexity classes P, NP and NP Complete (NPC)?

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

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

Jnani Kurmadasu asked • 2 days ago

The Palghat Gap (or Palakkad Gap), a region about 30 km wide in the southern part of the Western

Ghats in India, is lower than the hilly terrain to its north and south. The exact reasons for the

formation of this gap are not clear. It results in the neighbouring regions of Tamil Nadu getting

more rainfall from the South West monsoon and the neighbouring regions of Kerala having higher summer temperatures

Ghats in India, is lower than the hilly terrain to its north and south. The exact reasons for the

formation of this gap are not clear. It results in the neighbouring regions of Tamil Nadu getting

more rainfall from the South West monsoon and the neighbouring regions of Kerala having higher summer temperatures

What can be inferred from this passage?

- a)The Palghat gap is caused by high rainfall and high temperatures in southern Tamil Nadu and

Kerala - b)The regions in Tamil Nadu and Kerala that are near the Palghat Gap are low-lying
- c)The low terrain of the Palghat Gap has a significant impact on weather patterns in neighbouring

parts of Tamil Nadu and Kerala - d)Higher summer temperatures result in higher rainfall near the Palghat Gap area

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

Fetching relevant content for you

Ask a question