Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Nukku
5
answers
1
GATE CSE 2001 | Question: 2.2
Consider the following statements: $S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite. $S_2:$ There exists two irrational numbers $x$ and y such that $(x+y)$ ... $S_2$? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following statements:$S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite.$S_2:$ There exists two irrational numbers $x$ a...
9.0k
views
commented
Jan 31, 2020
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
set-theory
+
–
4
answers
2
Book: MCQs in Computer Science by TJ williams
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
2.7k
views
asked
Sep 21, 2019
0
answers
3
Can Merge Sort Time Complexity be O(n^2) in any condition?
1.4k
views
commented
Sep 21, 2019
Algorithms
algorithms
time-complexity
sorting
+
–
1
answer
4
UGC NET CSE | July 2018 | Part 2 | Question: 25
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the average length of 2.4 1.87 3.0 2.15
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the avera...
3.0k
views
commented
Sep 21, 2019
Probability
ugcnetcse-july2018-paper2
probability
binary-tree
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register