Mani Karan Mansi Mani Ka answered • yesterday

;knnkm

Swati Rao asked • 2 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?

Manikant Sharma asked • 5 hours ago

Consider the pushdown automaton (PDA) below which runs over the input alphabet (a, b, c). It has the stack alphabet {Z_{0}, X} where Z_{0} is the bottom-of-stack marker. The set of states of the PDA is (s, t, u, f} where s is the start state and f is the final state. The PDA accepts by final state. The transitions of the PDA given below are depicted in a standard manner. For example, the transition (s, b, X) → (t, XZ_{0}) means that if the PDA is in state s and the symbol on the top of the stack is X, then it can read b from the input and move to state t after popping the top of stack and pushing the symbols Z_{0} and X (in that order) on the stack.

Gaurav Kumar asked • 6 hours 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?

Kavya Basavaraj asked • 6 hours ago

The chain snatchers "

- a)took shelter in a thick jungle
- b)open indiscriminate fire
- c)took to flight
- d)unconditionally surrendered

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

Mrudul Addipalli asked • 7 hours ago

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?

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

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

G Knowledge Ak asked • 13 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?

Damayanti Daule asked • 13 hours 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?

Apurva Patel asked • 14 hours ago

Consider the relation "enrolled(student, course)" in which (student, course) is the primary key, and the relation "paid(student, amount)" where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Given the following four queries:

- a)All queries return identical row sets for any database
- b)Query2 and Query4 return identical row sets for all databases but there exist databases for which Query1 and Query2 return different row sets.
- c)There exist databases for which Query3 returns strictly fewer rows than Query2
- d)There exist databases for which Query4 will encounter an integrity violation at runtime.

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

Hemant Gaikwad asked • 15 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?

AMAN RAJ asked • 16 hours ago

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

- a)Ω(log n)
- b)Ω(n)
- c)Ω(n log n)
- d)Ω(n
^{2})

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

Virat Kohli asked • 18 hours 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?

Damayanti Daule asked • 19 hours ago

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?

Jigar Patel asked • 21 hours ago

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?

Navya Nalamasa asked • 21 hours 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?

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

Adepu Veena asked • yesterday

The temporal aspect of the locality of reference means

- a)That the recently executed instruction wont be executed soon
- b)That the recently executed instruction is temporarily not referenced
- c)That the recently executed instruction will be executed soon again
- d)None of the mentioned

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

Prashant Waghwase asked • yesterday

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?

Ayushi Sharma asked • yesterday

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?

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?

Madhu Arasi asked • yesterday

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?

Sai Kumar asked • yesterday

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?

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?

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?

Damayanti Daule asked • 2 days ago

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?

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?

Fetching relevant content for you

Ask a question