Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Answers by Debapaul
User Debapaul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Debapaul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
Made EasyCBT2
Which of the following is incorrect a. f(n) + Ω(f(n)) = Ω(f(n)). b. f(n) + Ο(f(n)) = Θ(f(n)). c. f(n) + Ο(f(n)) = Ο(f(n)). d. f(n) + Ω(f(n)) = Θ(f(n)).
answered
Jan 21
in
Algorithms

128
views
#madeeasycbt2
#algorithms
+1
vote
ACE Test Series Question 8
Anyone please clarify.
answered
Jan 17
in
Computer Networks

29
views
aceacademytestseries
computernetworks
0
votes
probability gate CE 04
A hydraulic structure has four gates which operate independently. The probability of failure of each gate is 0.2.0.2. Given that gate 11 has failed, the probability that both gates 22 and 33 will fail is A 0.240 B 0.200 C 0.040 D 0.008
answered
Dec 31, 2019
in
Probability

44
views
0
votes
Made Easy test series computer network subnetting
IP address of a computer is given as 44.93.53.119. Subnet mask is given as 255.255.0.0 then the number of 1’s in subnet Id _______. Given answer 8
answered
Dec 30, 2019
in
Computer Networks

23
views
madeeasytestseries
#computernetwork
subnetting
0
votes
FULL SYLLABUS TEST3 (BASIC LEVEL) GATE 2020 Q56 CN
answered
Dec 30, 2019
in
Computer Networks

28
views
0
votes
MadeEasy FULL SYLLABUS TEST3 (BASIC LEVEL) GATE 2020 Q52 CO
answered
Dec 30, 2019
in
CO & Architecture

29
views
+1
vote
Made Easy FLT 5 Adavance 2020 Graph theory
Consider graph G has 10 vertices. Minimum number of edges required to guarantee that the graph is connected? I think answer would be n1 edges. But in solution they user 1+(n1)C2 edges. Can you plz help me out? Thanks in advance for your suggestions.
answered
Dec 27, 2019
in
Algorithms

47
views
0
votes
Madeeasy Test Series  Number of comparisons
ans : 94
answered
Dec 26, 2019
in
Algorithms

28
views
algorithms
madeeasytestseries
data_structure
0
votes
Mde easy test series : Primary and secondary indexing in databases
answered
Dec 26, 2019
in
Databases

34
views
madeeasytestseries
+1
vote
ACE testAlgo
Suppose an integer array of size $n$ contains only $1,2,3.$ What is the time complexity of efficient algorithm to sort the array? $\left ( A \right )O\left ( n^{2} \right )$ $\left ( B \right )O\left ( n \log n\right )$ $\left ( C \right )\Theta \left ( n \log n\right )$ $\left ( D \right )\Theta \left ( n\right )$
answered
Dec 15, 2019
in
Algorithms

77
views
algorithms
0
votes
gatebook_practices
What is the time complexity to find k th smallest element in a Maxheap with n nodes? (A) O(kLogn) (B) O(n’2 ) (C) O(nlogn) (C) O(Logn) (D) O(n) (E) O(1
answered
Sep 15, 2019
in
Programming

45
views
7,393
questions
1,744
answers
10,711
comments
90,366
users