Questions by HeadShot

0 votes

0 answers

61

Doubt - Source : Stack_Overflow
How the case is matched ? : T(n) = 2T(n/2) + O(n * m) we have a = 2, b = 2, c = 1 and c = $Log_ba$ (case 2) Hence, T(n) = O(n * m * log n) Now, substituting m with n T(n) = O(n2 * log n)

asked in Algorithms Nov 27, 2018

369 views

1 vote

1 answer

62

GATE 2010-IN - 02
The diameters of $10000$ ball bearings were measured. The mean diameter and standard deviation were found to be $10mm$ and $0.05mm$ respectively. Assuming Gaussian distribution of measurements, it can be expected that the number of measurements more than $10.15mm$ will be (A) 230 (B) 115 (C) 15 (D) 2

asked in Probability Nov 26, 2018

1.8k views

0 votes

0 answers

63

Conditional Probability

asked in Probability Nov 25, 2018

280 views

0 votes

0 answers

64

A request :)
@Arjun Sir, Please Unhide the one i didn't got answer for. At this moment , getting the clarity is the biggest concern as its a peak time of preparation. I will update it , but hiding them will not be beneficial for me as no one can clear my doubts , ... such questions as for most of the doubts i dont have a specific source, at least till feb :) Please, if possible. Thank you.

asked in Others Nov 24, 2018

775 views

0 votes

1 answer

65

TIFR Exam Pattern
If anyone had analysed the previous TIFR papers, which subjects/topics of GATE they dont or rarely ask ? Please do share.

asked in TIFR Nov 23, 2018

703 views

1 vote

1 answer

66

Definite Integrals
Do read the comments from thebottom of the page :)

asked in Calculus Nov 21, 2018

472 views

0 votes

1 answer

67

Limit
Please try to answer without using any standard result as i cant remember them.

asked in Calculus Nov 13, 2018

270 views

0 votes

1 answer

68

Calculus - Limits
Answer is 1 but where it is going wrong the way I solved in following image.

asked in Calculus Nov 12, 2018

958 views

0 votes

1 answer

69

Time Complexity
Why ? Isnt Option A true using "Binary search"

asked in Programming in C Nov 12, 2018

469 views

0 votes

2 answers

70

Recursion
How 22 ?

asked in Programming in C Nov 12, 2018

844 views

0 votes

0 answers

71

Recursion
Explain how post decrement works in recursion , in which iteration that decremented value is used. (In general how to use post decrement in recursive function calls when control jumps from one space to other, where that value actually get reflected.)

asked in Programming in C Nov 12, 2018

782 views

0 votes

0 answers

72

Pointers
How value to "*ptr" is being assigned ?

asked in Programming in C Nov 12, 2018

407 views

0 votes

0 answers

73

Programming Doubt
Can anyone tell me the difference in first condition of Option B and Option C.

asked in Programming in C Nov 12, 2018

313 views

0 votes

0 answers

74

C program

asked in Programming in C Nov 12, 2018

805 views

0 votes

0 answers

75

Column Major Order

asked in Programming in C Nov 12, 2018

1.6k views

0 votes

1 answer

76

Heap : Test question
Inorder Predecessor is 97 which got deleted so none of the option is matching. Am I wrong somewhere ?

asked in Programming in C Nov 11, 2018

300 views

0 votes

0 answers

77

Static Scope
Though parameters passed by reference , changes on "a" didn't reflect on "b" , why ?

asked in Programming in C Nov 11, 2018

1.4k views

0 votes

0 answers

78

Hashing Doubt
In this question : https://gateoverflow.in/2272/gate1997-12 Had it been "Open addressing" only then for part A would it be : $\frac{n-1}{n}*\frac{n-2}{n-1}*.....*\frac{n-k-1}{n-k}$ ? (as every time we occupy a bucket , the probability will be changed as all slots are equiprobable.)

asked in Programming in C Nov 11, 2018

178 views

0 votes

0 answers

79

Hashing Doubt
In this question : https://gateoverflow.in/2272/gate1997-12 Had it been "Open addressing" only then for part A would it be : $\frac{n-1}{n}*\frac{n-2}{n-1}*.....*\frac{n-k-1}{n-k}$ ? (as every time we occupy a bucket , the probability will be changed as all slots are equiprobable.) ?

asked in Programming in C Nov 11, 2018

309 views

0 votes

0 answers

80

Binary Tree Doubt
( Its a doubt so dont mark it as duplicate ) https://gateoverflow.in/1776/gate2014-1-12?show=27673#a27673 In the above answer, if I ignored all the ancestors of current node with subtree node count exact 4 as they surely will not have exact 4 count. ( they ... So ignoring such ancestors , can I reduce the time complexity ? or it will still be O(n) only ? Please explain. Question :

asked in Programming in C Nov 11, 2018

224 views

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

Questions by HeadShot

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by HeadShot

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments