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

Praveen Naragund asked • 9 hours ago

Which one of the following is an SMTP server configured in such a way that anyone on the internet can send e-mail through it?

- a)open mail relay
- b)wide mail reception
- c)open mail reception
- d)none of the mentioned

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

Tatai Das asked • 11 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?

Anonymous Keepprivacy asked • 11 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?

Adityagupta Gupta asked • 11 hours ago

Prashant Waghwase asked • 12 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?

LUIS ALDRIGE asked • 12 hours ago

A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT

- a)block entire HTTP traffic during 9:00PM and 5:00AM
- b)block all ICMP traffic
- c)stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address
- d)block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM

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

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

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

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?

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

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

Megha Karmakar asked • 16 hours ago

Let R be a relation. Which of the following com m ents about the relation R are correct?

1. R will necessarily have a composite key if R is in BCNF but not in 4NF.

1. R will necessarily have a composite key if R is in BCNF but not in 4NF.

2. If R is in 3NF and if every key of R is simple , then R is in BCNF.

3. If R is in BCNF and if R has at least one

4. If R is in 3NF and if its every key is simple, then R is in 5NF.

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

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

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

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

Ramya M asked • 20 hours ago

Let R and S be two relations with the following schema R (__P,Q__,R1,R2,R3) S (__P,Q__,S1,S2) Where {P, Q} is the key for both schemas. Which of the following queries are equivalent?

- a)Only I and II
- b)Only I and III
- c)Only I, II and III
- d)Only I, III and IV

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

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

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

Ambati Rajendra asked • 22 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?

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?

VUTUKURI SMS asked • yesterday

Which of the following regular expression corresponds to the language of
all strings over the alphabet {a, b) that contains exactly two a’s

more

more

(ii) ab*a

(iii) b* ab*a

a) (i) arid (ii) only

b) (ii) and (iii) only

c) (i) and (iii) only

d) None of these

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

ANCHAL NIRANJAN asked • yesterday

A given relation is known to be in third normal form. Select the statement which can be inferred from this

- a)All attributes contribute to the primary key.
- b)Each non-key attribute determine the primary key.
- c)Each non-key attribute is determine by the primary key.
- d)Every determinant is a candidate key.

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

GURIK SINGH asked • yesterday

The data flow model of an application mainly shows

- a)The underlying data and the relationships among them.
- b)Processing requirements and the flow of data.
- c)Decision and control information.
- d)Communication network structure.

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

Arvind Kumar asked • yesterday

Which of the following statements is false?

- a)Virtual memory implements the translation of a program‘s address space into physical memory address space
- b)Virtual memory allows each program to exceed the size of the primary memory
- c)Virtual memory increases the degree of multiprogramming
- d)Virtual memory reduces the context switching overhead

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

Rahul Yadav asked • yesterday

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

Fetching relevant content for you

Ask a question