Computer Science Engineering (CSE)
Hemant Gaikwad asked • 29 minutes agoGiven the relationsemployee (name, salary, deptno) and department (deptno, deptname, address)Q. Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x,
, p)?- 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?
Given the relations
employee (name, salary, deptno) and department (deptno, deptname, address)
Q. Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x, , p)?
, p)?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
Arvind Kumar asked • 1 hour agoWhich 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?
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
Apurva Patel asked • 5 hours agoMaximum 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?
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)
Vilas Shelke asked • 14 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?
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
Mahidar N asked • 14 hours agoConsider the following pseudo code, where x and y are positive integers.beginq := 0r := x
while ?? ≥ ?? dobeginr := r – yq := q + 1endendThe 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?
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)
Prashant Waghwase asked • 15 hours agoLet 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?
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)
Vishakha Kakde asked • 17 hours agoAfter several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?- a)Failure is the pillar of success
- b)Honesty is the best policy
- c)Life begins and ends with adventures
- d)No adversity justifies giving up hope
Correct answer is option 'D'. Can you explain this answer?
After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?
a)
Failure is the pillar of success
b)
Honesty is the best policy
c)
Life begins and ends with adventures
d)
No adversity justifies giving up hope
Nisi Gupta asked • 19 hours agoConsider 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?
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?
Satish Gaikwad asked • 20 hours agoConsider 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?
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.
Navya Nalamasa asked • 20 hours agoConsider the following transactions with data items P and Q initialized to zero:
Any non-serial interleaving of T1 and T2 for concurrent execution leads to- 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?
Consider the following transactions with data items P and Q initialized to zero:
Any non-serial interleaving of T1 and T2 for concurrent execution leads to
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
Ishani Arora asked • 21 hours agoIf given two turing decidable languages L1 and L2, then L1-L2 will be?
LOKARE SANDESH asked • 22 hours agoConsider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. The routing table is synchronously updated as follows. In each updation interval, three tasks are performed.
i. A node determines whether its neighbours in the graph are accessible. If so, it sets the tentative cost to each accessible neighbour as 1. Otherwise, the cost is set to ∞.
ii. From each accessible neighbour, it gets the costs to relay to other nodes via that neighbour (as the next hop).
iii. Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost.
Continuing from the earlier problem, suppose at some time t, when the costs have stabilized, node A goes down. The cost from node F to node A at time (t + 100) is :... more
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. The routing table is synchronously updated as follows. In each updation interval, three tasks are performed.
i. A node determines whether its neighbours in the graph are accessible. If so, it sets the tentative cost to each accessible neighbour as 1. Otherwise, the cost is set to ∞.
ii. From each accessible neighbour, it gets the costs to relay to other nodes via that neighbour (as the next hop).
iii. Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost.
i. A node determines whether its neighbours in the graph are accessible. If so, it sets the tentative cost to each accessible neighbour as 1. Otherwise, the cost is set to ∞.
ii. From each accessible neighbour, it gets the costs to relay to other nodes via that neighbour (as the next hop).
iii. Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost.
Continuing from the earlier problem, suppose at some time t, when the costs have stabilized, node A goes down. The cost from node F to node A at time (t + 100) is :
Tatai Das asked • 22 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?
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
Megha Karmakar asked • yesterdayLet 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.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 one4. 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?
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
Gaurav Kumar asked • yesterdayAn 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?
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
Damayanti Daule asked • yesterdayAn 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. 
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?... more
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?
Jigar Patel asked • yesterdayThe 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.- 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?
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
Fetching relevant content for you
Ask a question
Related Courses
© EduRev
Follow Us
Follow Us