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
Answers by Arnabvasudev23
0
votes
1
GATE CSE 2007 | Question: 14
Which of the following sorting algorithms has the lowest worse-case complexity? Merge sort Bubble sort Quick sort Selection sort
Which of the following sorting algorithms has the lowest worse-case complexity?Merge sortBubble sortQuick sortSelection sort
11.0k
views
answered
Aug 1, 2021
Algorithms
gatecse-2007
algorithms
sorting
time-complexity
easy
+
–
0
votes
2
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); } How many child processes are created upon execution of this program?
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); }How many child processes are created upon execution of this program?
3.6k
views
answered
Jul 18, 2020
Operating System
tanenbaum
operating-system
process-and-threads
fork-system-call
descriptive
+
–
0
votes
3
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just $1$?
Let us there are n nodes which are labelled.Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$Then the binary search trees possi...
6.9k
views
answered
Jun 7, 2020
DS
data-structures
binary-search-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
