Computer Science Engineering (CSE)
Madhu Arasi asked • 37 minutes agoWhich 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)A
- b)B
- c)C
- d)D
Correct answer is option 'D'. Can you explain this answer?
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
Zaufishan Khan asked • 59 minutes agoWhat is the use of algebraic identities in optimisation of basic blocks
?
Damayanti Daule asked • 1 hour agoconsider the directed graph given below
which one of the following is true- a)the graph does not have any topological ordering
- b)Both PQRS and SRQP are topological ordering
- c)Both PSRQ and SPRQ are topological ordering
- d)PSRQ is the only topological ordering
Correct answer is option 'C'. Can you explain this answer?
consider the directed graph given below
which one of the following is true
a)
the graph does not have any topological ordering
b)
Both PQRS and SRQP are topological ordering
c)
Both PSRQ and SPRQ are topological ordering
d)
PSRQ is the only topological ordering
Akhila Palavalasa asked • 3 hours agoOrthogonal trajectory of X^2 y^2 2gx c=0 Where g is parameter?
Damayanti Daule asked • 6 hours agoThe 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?
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
Rasazna Kls asked • 7 hours agoA 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?
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
Adepu Veena asked • 8 hours agoThe 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?
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
Navya Nalamasa asked • 10 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
Neha Prajaapati asked • 11 hours agoWhich 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?
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
Javed Ahmad asked • 14 hours agoWhich 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?
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
G Knowledge Ak asked • 14 hours agoIn 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?
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.
Satish Gaikwad asked • 14 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.
Nisi Gupta asked • 14 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?
Pooja Daphal asked • 15 hours agoA 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.The number of bits in the tag field of an address is- a)11
- b)14
- c)16
- d)27
Correct answer is option 'C'. Can you explain this answer?
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.
The number of bits in the tag field of an address is
a)
11
b)
14
c)
16
d)
27
Vishakha Kakde asked • 15 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
Ayushi Sharma asked • 15 hours agoGiven the following expression grammar:
E -> E * F | F + E | F
F -> F - F | id
which of the following is true?- a)* has higher precedence than +
- b)– has higher precedence than *
- c)+ and — have same precedence
- d)+ has higher precedence than *
Correct answer is option 'B'. Can you explain this answer?
Given the following expression grammar:
E -> E * F | F + E | F
F -> F - F | id
which of the following is true?
E -> E * F | F + E | F
F -> F - F | id
which of the following is true?
a)
* has higher precedence than +
b)
– has higher precedence than *
c)
+ and — have same precedence
d)
+ has higher precedence than *
Jigar Patel asked • 15 hours agoThe 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
Jnani Kurmadasu asked • 15 hours agoQ. 6 – Q. 10 carry two marks each.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 temperaturesWhat 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?
Q. 6 – Q. 10 carry two marks each.
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
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
parts of Tamil Nadu and Kerala
d)
Higher summer temperatures result in higher rainfall near the Palghat Gap area
Soumya Sanket Patra asked • 15 hours agoChoose 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.- 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?
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
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)
Puja Kunwar Kunwar asked • 15 hours agoGiven f1 , f3 and f is cannonical sop from im decimal for the ckt?
Shweta Sonkar asked • 15 hours agoGiven 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?
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)
Apurva Patel asked • 15 hours agoConsider 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:
Q. Which one of the following statements is correct?- 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?
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:
Q. Which one of the following statements is correct?
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.
Damayanti Daule asked • 15 hours ago
- a)
- b)
- c)
- d)
Correct answer is option 'C'. Can you explain this answer?
a)
b)
c)
d)
Hemant Gaikwad asked • 15 hours 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
Ambati Rajendra asked • 16 hours agoHow 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?
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
Gaurav Kumar asked • 17 hours agoAn 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
Mrudul Addipalli asked • 18 hours agoA 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?
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)
Vilas Shelke asked • 18 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
Virat Kohli asked • yesterdayWhich 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?
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.
Sai Kumar asked • yesterdayWhich 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?
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
Manikant Sharma asked • yesterdayConsider the pushdown automaton (PDA) below which runs over the input alphabet (a, b, c). It has the stack alphabet {Z0, X} where Z0 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, XZ0) 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 Z0 and X (in that order) on the stack.
... more
Consider the pushdown automaton (PDA) below which runs over the input alphabet (a, b, c). It has the stack alphabet {Z0, X} where Z0 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, XZ0) 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 Z0 and X (in that order) on the stack.
Anuja Fole asked • yesterdayConsider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following is true about Y?- a)Y has no right child
- b)Y has no left child
- c)Y has both children
- d)None of the above
Correct answer is option 'B'. Can you explain this answer?
Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following is true about Y?
a)
Y has no right child
b)
Y has no left child
c)
Y has both children
d)
None of the above
Apurva Patel asked • yesterdayMaximum 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)
Nikki Tiwari asked • yesterdayThe 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.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?
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.
Susan Oomen asked • yesterdayTwo processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an averageof 3 steps and B can execute with an average of 5 steps.For the execution of the same instruction which processor is faster- a)A
- b)B
- c)Both take the same time
- d)Insufficient information
Correct answer is option 'A'. Can you explain this answer?
Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an averageof 3 steps and B can execute with an average of 5 steps.For the execution of the same instruction which processor is faster
a)
A
b)
B
c)
Both take the same time
d)
Insufficient information
Damayanti Daule asked • yesterdayWhich 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?
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.
Rajendra Malaviya asked • yesterdayThree of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.- a)
- b)
- c)
- d)
Correct answer is option 'A'. Can you explain this answer?
Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
a)
b)
c)
d)
Fetching relevant content for you
Ask a question
Related Courses
|
Follow Us
|