Purpose of a start bit in RS 232 serial communication protocol is

- a)to synchronize receiver for receiving every byte
- b)to synchronize receiver for receiving a sequence of bytes
- c)a parity bit
- d)to synchronize receiver for receiving the last byte

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

Roshni answered • 1 hour ago

A) Because RS 232 requires a start before each byte transmission for synchronization..

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

Let P be a regular language and Q be a context-free language such that (For example, let P be the language represented by the regular expression Then which of the following is ALWAYS regular?

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

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

Shakuntla answered • 14 hours ago

c)complement of regular Language is regular

The simplified SOP (Sum of Product) form of the Boolean expression

Manju Devi answered • 2 days ago

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

Neha Prajaapati asked • 4 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?

Pooja Daphal asked • 9 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?

Manikant Sharma asked • 10 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.

AMAN RAJ asked • 15 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?

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

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

Apurva Patel asked • yesterday

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?

Mahidar N asked • yesterday

Consider the following pseudo code, where x and y are positive integers.

begin

q := 0

r := x

while ?? ≥ ?? do

while ?? ≥ ?? do

begin

r := r – y

q := q + 1

end

end

The post condition that needs to be satisfied after the program terminates is

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

Correct answer is option 'B'. 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?

Kavya Basavaraj asked • yesterday

The probabilities that a student passes in Mathematics, Physics and Chemistry are m, p, and c respectively

. Of these subjects, the student has 75% chance of passing in atleast one, a 50% chance of passing in atleast two and a 40% chance of passing in exactly two. Following relation are drawn in m, p, c.

I. p + m + c = 27/20

II. p + m + c = 13/20

III. (p)+(m)+(C)= 1/10

- a)only relation I is true
- b)only relation II is true
- c)relations II and III are true
- d)relations I and iii are true

Correct answer is option 'D'. 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?

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?

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?

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?

Pooja Daphal asked • yesterday

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?

Damayanti Daule asked • yesterday

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?

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?

Vaishnavi Kature asked • yesterday

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?

Nisi Gupta asked • 2 days 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?

Richa Thakur asked • 2 days ago

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?

Fetching relevant content for you

Ask a question