Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Rohan Mundhey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Rohan Mundhey
0
votes
1
answer
1
TABLE
Agency called immediate cover supplies part time 1 temporary staff to hotels throughout India. The table shown below lists the time speed by agency staff working at two hotels. In the process of normalizing the above table into 3NF, how many tables will be formed? (Assume FD’s based on given table)
asked
in
Databases
Nov 14, 2016
153
views
0
votes
1
answer
2
true ?
Which of the following statement(s) is/are true? I.Every existence dependency results in a weak entity. II.Role names are technically not necessary in relationships types when all the participating entity types are distinct. III.The relationship between owner entity and the weak entity is one to many.
asked
in
Databases
Nov 13, 2016
192
views
0
votes
1
answer
3
correct ?
Which of the following statement(s) is/are correct? I.A constraint showing the maximum number of entities to which another entity can be associated via a relationship set is called participation constraint. II.The number of entity sets participating in the relationship is known as the degree of that relationship
asked
in
Databases
Nov 13, 2016
458
views
3
votes
1
answer
4
Spanning Trees
Consider the following adjacency matrix representation of connected graph then find the number of spanning trees are possible for the given graph $\begin{bmatrix} 0&1&1&1&0 \\ 1&0&1&1&0 \\1&1&0&0&1 \\ 1&1&0&0&1 \\0&0&1&1&0 \end{bmatrix}$
asked
in
Algorithms
Nov 11, 2016
929
views
numerical-answers
spanning-tree
graph-algorithms
1
vote
1
answer
5
Dijikstra
Consider a Graph G which contains a negative weight edges but not negative cycles then which of the following statements is TRUE when we run Dijkstra’s algorithm? It may not terminate It terminates but may produce incorrect results. It never terminates due to cycles in graph None of these
asked
in
Algorithms
Nov 11, 2016
773
views
graph-theory
dijkstras-algorithm
0
votes
1
answer
6
Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6
asked
in
Algorithms
Nov 11, 2016
1.0k
views
algorithms
matrix-chain-ordering
dynamic-programming
1
vote
0
answers
7
recurssion
Let T(n) be a function which takes an integer n having k digits as input. The function T(n) finds the maximum number of perfect squares possible by removing either least significant digit or the most significant digit. For example, consider the number 32492, T(32492) = ... perfect square or not. If the time complexity for IS_SQUARE(a) is O(1), what is the time complexity to compute T(n)?
asked
in
Algorithms
Nov 11, 2016
1.3k
views
2
votes
1
answer
8
Time Complexity
asked
in
Algorithms
Nov 10, 2016
454
views
algorithms
time-complexity
test-series
3
votes
1
answer
9
Time Complexity
asked
in
Algorithms
Nov 10, 2016
135
views
time-complexity
recurrence-relation
test-series
1
vote
0
answers
10
Toom & Cook
asked
in
Algorithms
Nov 10, 2016
115
views
3
votes
2
answers
11
Recurrence
asked
in
Algorithms
Nov 10, 2016
199
views
algorithms
time-complexity
recurrence-relation
test-series
1
vote
1
answer
12
Array Heap
asked
in
Unknown Category
Nov 10, 2016
237
views
0
votes
1
answer
13
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty?
asked
in
Algorithms
Nov 9, 2016
484
views
hashing
probability
data-structures
0
votes
1
answer
14
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty? 2)What is the expected number of slots that are being nonempty?
asked
in
Algorithms
Nov 9, 2016
1.5k
views
hashing
chaining
probability
descriptive
1
vote
3
answers
15
Arrays
Consider an array of 19 elements, Find the minimum number of comparisons required to find minimum and maximum elements in an array
asked
in
Algorithms
Nov 9, 2016
691
views
algorithms
sorting
normal
numerical-answers
2
votes
2
answers
16
Comparisons in a Binary Search
How many comparisons are needed for a binary search in a set of 64 elements?
asked
in
Algorithms
Nov 9, 2016
4.6k
views
algorithms
binary-search
numerical-answers
3
votes
4
answers
17
ARRAYS
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?
asked
in
Algorithms
Nov 9, 2016
1.3k
views
algorithms
binary-search
time-complexity
1
vote
1
answer
18
COMPLEXITY
Suppose that the votes of n people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes. What is the time complexity to find a candidate who receives majority of the votes using divide and conquer approach?
asked
in
Algorithms
Nov 9, 2016
685
views
algorithms
divide-and-conquer
time-complexity
1
vote
1
answer
19
qUICK sORT
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0) Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, E What is the position of pivot element after completion of first pass?
asked
in
Algorithms
Nov 9, 2016
446
views
algorithms
quick-sort
numerical-answers
3
votes
1
answer
20
Arrays
Consider an array contains 2k distinct elements. How many comparisons are needed to find the smallest and the second smallest elements in the given array? 2k comparisons 2k-2 comparisons 2k + k -2 comparisons
asked
in
Algorithms
Nov 9, 2016
2.0k
views
algorithms
sorting
Page:
1
2
3
4
5
6
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This was very nice blog man!!😂😂
@abhi_3_0_12 bro revise now, Gate is on upcoming...
I want to buy the test series today but I want to...
@mahendrapatel The more you give those (some...
@ChatGPT bhai muze vo test bhi dena tha...