For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?

- a)Non regular language
- b)0^n1^n | n>=0
- c)0^n1^n | n>=1
- d)None of the mentioned

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

Afroz Baig answered • yesterday

In option c mention>=1 so epsilon will not be accepted

Deekshant Semwal asked • 38 minutes ago

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is _________.

Correct answer is 'Ans: Given that at the time of Time Out, Congestion Window Size is 32 KB and RTT = 100 ms , When Time Out occurs, for the next round of Slow Start,Threshold = ,Threshold = 16KBSuppose we have a slow start ==>> 2KB|4KB|8KB|16KB (As the threshold is reached, Additive increase starts) 18KB|20KB|22KB|24KB|26KB|28KB|30KB|32KBHere | (vertical line) is representing RTT so the total number of vertical lines is 100*10ms ==>> and 1100m. sec so this is the answer...'. Can you explain this answer?

Keerthe Reddy asked • 4 hours ago

Anonymous Keepprivacy asked • 5 hours ago

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?

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

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

Lohit Jindal asked • 9 hours ago

Soumya Sanket Patra asked • 9 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?

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

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

Satish Gaikwad asked • 14 hours ago

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?

Nikki Tiwari asked • 14 hours ago

The access times of the main memory and the Cache memory, in a computer system, are 500 n sec and 50 n sec, respectively. It is estimated that 80% of the main memory request are for read the rest for write. The hit ratio for the read access only is 0.9 and a write-through policy (where both main and cache memories are updated simultaneously) is used.

Determine the average time of the main memory.

Determine the average time of the main memory.

Correct answer is 'Average memory access time = Time spend for read + Time spend for write= Read time when cache hit + Read time when cache miss+Write time when cache hit + Write time when cache miss= 0.8 ⨯ 0.9 ⨯ 50 + 0.8 ⨯ 0.1 ⨯ (500+50) (assuming hierarchical read from memory and cache as only simultaneous write is mentioned in question)+ 0.2 ⨯ 0.9 ⨯ 500 + 0.2 ⨯ 0.1 ⨯ 500 (simultaneous write mentioned in question)= 36 + 44 + 90 + 10 = 180 ns'. Can you explain this answer?

Kavya Basavaraj asked • 15 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?

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

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

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

Tatai Das asked • 19 hours ago

If a unit completes its task before the allotted time period, then

- a)It’ll perform some other task in the remaining time
- b)Its time gets reallocated to different task
- c)It’ll remain idle for the remaining time
- d)None of the mentioned

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

T. Priyanka asked • 21 hours ago

Jnani Kurmadasu asked • 22 hours 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?

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?

Rachika Grewal asked • yesterday

Given relations R(w, x) and S(y, z), the result of

SELECT DISTINCT w,x

FROM R, S

Is guaranteed to be same as R, if

SELECT DISTINCT w,x

FROM R, S

Is guaranteed to be same as R, if

- a)R has no duplicates and S is non-empty
- b)R and S have no duplicates
- c)S has no duplicates and R is non-empty
- d)R and S have the same number of tuples

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

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?

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?

Abidha J asked • yesterday

Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________

Correct answer is 'Because CPU is faster than memory. Fetching instructions from memory would require considerable amount of time while CPU is much faster. So, prefetching the instructions to be executed can save considerable amount of waiting time.'. Can you explain this answer?

Fetching relevant content for you

Ask a question