Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Hareesh22
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Hareesh22
1
votes
1
GO Classes 2023 | Weekly Quiz 5 | Question: 7
Consider the following arguments. $\text{Argument 1:}$ Kerry errs or Myrna fails to show. If Kerry errs, then he does not break the record. Myrna fails to show. Therefore, Kerry does break the record. $\text{Argument 2:}$ If Tasha leaves, ... is true? Only Argument $1$ is valid. Only Argument $2$ is valid. Both Arguments are valid. No Argument is valid.
Consider the following arguments.$\text{Argument 1:}$ Kerry errs or Myrna fails to show. If Kerry errs, then he does not break the record. Myrna fails to show. Therefore,...
373
views
answered
Jun 22, 2022
Mathematical Logic
goclasses_wq5
goclasses
mathematical-logic
propositional-logic
1-mark
+
–
0
votes
2
Sorting(Algorithms)
The complexity of comparison based sorting algorithm is (nlogn) .How?
The complexity of comparison based sorting algorithm is (nlogn) .How?
634
views
answered
Oct 10, 2021
Algorithms
algorithms
time-complexity
sorting
+
–
0
votes
3
GATE CSE 2014 Set 1 | Question: 37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I p...
9.4k
views
answered
Aug 19, 2020
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
algorithm-design
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register