Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
aryavart
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by aryavart
0
votes
1
GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
Let $p, q, r$ denote the statements ”It is raining”, “It is cold”, and “It is pleasant”, respectively. Then the statement “It is not raining and it is pleas...
12.0k
views
answered
Jul 15, 2021
Mathematical Logic
gatecse-2017-set2
mathematical-logic
propositional-logic
+
–
1
votes
2
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$
980
views
answered
Jul 14, 2021
DS
nielit2017oct-assistanta-it
data-structures
binary-tree
+
–
0
votes
3
UGC NET CSE | December 2019 | Part 2 | Question: 72
Which of the following are legal statements in $C$ programming language? int *P=&44; int *P=&r; int P=&a; int P=a; Choose the correct option: (i) and (ii) (ii) and (iii) (ii) and (iv) (i) and (iv)
Which of the following are legal statements in $C$ programming language?int *P=&44;int *P=&r;int P=&a;int P=a;Choose the correct option:(i) and (ii)(ii) and (iii)(ii) and...
334
views
answered
Jun 24, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
4
Design and Analysis of Algorithm
Which of the following statements is not true? 1.For every fixed strategy to choose a pivot for quicksort, we can construct a worst case input that requires time O(n2). 2.If we randomly choose a pivot element each time, quicksort will ... would have worst case complexity O(n log n). 4.Quicksort and merge sort are both examples of divide and conquer algorithms.
Which of the following statements is not true? 1.For every fixed strategy to choose a pivot for quicksort, we can construct a worst case input that requires time O(n2). 2...
6.2k
views
answered
Jan 3, 2021
Algorithms
algorithm-design
sorting
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register