Recent activity by dishendra / GATE Overflow for GATE CSE

1 answer

1

UGCNET CSE December 2022: 11
If a constructor 'Date' is declared explicitly and has to be defined outside the class, which of the following is correct? 1. Date::Date(int dd) $\{/ * \ldots * /\}$ 2. explicit Date:: Date(int dd) $\{/ * \ldots * /\}$ 3. Such a constructor cannot be ... $1$ (Option $2 [39342]) 2$ (Option $3[39343]$ ) $3$ (Option $4 [39344]) 4$ Answer Given by Candidate : $4$

If a constructor 'Date' is declared explicitly and has to be defined outside the class, which of the following is correct?1. Date::Date(int dd) $\{/ * \ldots * /\}$2. exp...

359 views

answered Oct 4, 2023

0 answers

2

LECTURES IN DISCRETE MATHEMATICS Edward A. Bender and S. Gill Williamson
Consider the statement form p ⇒ q where p = If Tom is Jane's father then Jane is Bill's niece and q = Bill is Tom's brother. Which of the following statements is equivalent to this statement? (a) If Bill is Tom's Brother, ... 's niece. (e) If Bill is not Tom's Brother, then Tom is not Jane's father and Jane is Bill's niece.

Consider the statement form p ⇒ q where p =“If Tom is Jane’s father then Jane isBill’s niece” and q =“Bill is Tom’s brother.” Which of the following state...

251 views

asked Jan 20, 2023

1 answer

3

UGC NET CSE | October 2020 | Part 1 | Question: 26
Which one of the following schools has not accepted anumana (inference) as a valid source of knowledge? Advaita Vedanta Visistadvaita Charvaka Sankhya

Which one of the following schools has not accepted anumana (inference) as a valid source of knowledge?Advaita VedantaVisistadvaitaCharvakaSankhya

642 views

answered Apr 17, 2021

2 answers

4

UGC NET CSE | December 2019 | Part 2 | Question: 39
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$ $T(n) = \theta (\lg ( \lg ^2 n) \lg n )$ $T(n) = \theta ( \lg ^2 n \lg n )$ $T(n) = \theta (\lg ^2 n \lg \lg n )$ $T(n) = \theta (\lg ( \lg n) \lg n )$

Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$$T(n) = \theta (\lg ( \lg ^2 n) \l...

2.2k views

commented Dec 21, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true