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

Damayanti Daule asked • 6 hours ago

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?

Sarat Rath asked • 7 hours ago

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

AYUSH TOMAR asked • 11 hours ago

Consider the procedure below for the Producer-Consumer problem which uses semaphores:

- a)The producer will be able to add an item to the buffer, but the consumer can never consume it.
- b)The consumer will remove no more than one item from the buffer.
- c)Deadlock occurs if the consumer succeeds in acquiring semaphore s when the buffer is empty.
- d)The starting value for the semaphore n must be 1 and not 0 for deadlock-free operation.

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

NARWAL JAGVIR asked • 12 hours ago

An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, … , dn respectively. Which of the following 6-tuples is NOT graphic?

- a)(1, 1, 1, 1, 1, 1)
- b)(2, 2, 2, 2, 2, 2)
- c)(3, 3, 3, 1, 0, 0)
- d)(3, 2, 1, 1, 1, 0)

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

Luxmi Devi asked • 12 hours ago

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?

I. 7, 6, 5, 4, 4, 3, 2, 1

II. 6, 6, 6, 6, 3, 3, 2, 2

III. 7, 6, 6, 4, 4, 3, 2, 2

IV. 8, 7, 7, 6, 4, 2, 1, 1

II. 6, 6, 6, 6, 3, 3, 2, 2

III. 7, 6, 6, 4, 4, 3, 2, 2

IV. 8, 7, 7, 6, 4, 2, 1, 1

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

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

KANCHAN BALA asked • 12 hours ago

Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then

- a)|S| = 2|T|
- b)|S| = |T|-1
- c)|S| = |T|
- d)|S| = |T|+1

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

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

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

Richa Thakur asked • 14 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?

VIKAS YADAV asked • 15 hours ago

A data model is a collection of conceptual tools for describing

- a)Data and data relationships.
- b)Data semantics and consistency constraints.
- c)Data, data relationship, data semantics and consistency constraints.
- d)None of the above

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

Apurva Patel asked • 15 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?

Jigar Patel asked • 19 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?

Sai Kumar asked • 20 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?

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

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?

G Knowledge Ak asked • yesterday

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?

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?

Jnani Kurmadasu asked • yesterday

the following logical formulae represents the above statement?

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

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

Vilas Shelke asked • yesterday

Which one of the following is an internet standard protocol for managing devices on IP network?

- a)dynamic host configuration protocol
- b)simple newtwork management protocol
- c)internet message access protocol
- d)media gateway protocol

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

Vilas Shelke asked • yesterday

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?

Apurva Patel asked • yesterday

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?

Javed Ahmad asked • yesterday

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?

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?

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?

Manikant Sharma asked • yesterday

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.

Neha Prajaapati asked • yesterday

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?

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?

Gaurav Kumar asked • yesterday

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?

Fetching relevant content for you

Ask a question