Questions by aditi19

0 votes

0 answers

101

Doubt
can someone explain the formula n^k when k distinguishable items are to be placed in n distinguishable boxes without any restrictions?

asked in Combinatory Nov 16, 2018

278 views

2 votes

1 answer

102

Kenneth Rosen Edition 6th Exercise 5.6 Question 37 (Page No. 390)
How many solutions are there to the equation x1+x2+x3=17 with x1<6, x3>5?

asked in Combinatory Nov 16, 2018

2.1k views

3 votes

2 answers

103

Raghuramkrishnan
Tl:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), Tl:W(X), T2:R(Y) is this schedule view serializable?

asked in Databases Nov 16, 2018

594 views

0 votes

0 answers

104

Functional Completeness Doubt
Is Ex-NOR functionally complete? pls explain in details

asked in Digital Logic Nov 16, 2018

344 views

0 votes

1 answer

105

Kenneth Rosen Edition 6th Exercise 5.6 Question 25 (Page No. 389)
Suppose that a set S has n elements. How many ordered pairs(A,B) are there such that A and B are subsets of S with A$\subseteq$ B?

asked in Combinatory Nov 14, 2018

545 views

0 votes

2 answers

106

GATE-ECE-2018
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.

asked in Digital Logic Nov 14, 2018

3.7k views

0 votes

1 answer

107

Gilbert Strang
$\int_{}^{}\frac{x dx}{\sqrt{x^4-1}}$

asked in Calculus Nov 14, 2018

350 views

0 votes

0 answers

108

2 Phase Locking
https://gateoverflow.in/1484/gate1999-2-6 in this questions after T2 is not granted exclusive lock on A does the transaction T2 gets blocked entirely or it can continue to acquire exclusive lock on B? and if T2 continues to acquire lock on B followed by T1 requesting for read and write lock on B successively, is it deadlock situation here? And is that why it is not 2PL?

asked in Databases Nov 11, 2018

439 views

0 votes

0 answers

109

Karumanchi
f(n)=$2^n$ g(n)=n! h(n)=$n^{logn}$ which one is true? A) f(n)=O(g(n)) and g(n)=O(h(n)) B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n)) C) g(n)=O(f(n)) and h(n)=O(f(n)) D) h(n)=O(f(n)) and g(n)=$\Omega(f(n))$

asked in Algorithms Nov 6, 2018

365 views

0 votes

1 answer

110

Baud Rate
what is baud rate exactly? and what does it signifies?

asked in Computer Networks Nov 5, 2018

625 views

0 votes

2 answers

111

Karumanchi

asked in Algorithms Nov 4, 2018

851 views

0 votes

1 answer

112

Korth
give domain relation calculus expression works(person-name, company-name, salary) find the names of all employees who earn more than every employee of Small Bank Corporation

asked in Databases Nov 4, 2018

380 views

0 votes

1 answer

113

Aggregate Functions in relational algebra
is aggregate functions in relational algebra important with GATE's perspective or can I skip it?

asked in GATE Nov 3, 2018

1.3k views

0 votes

0 answers

114

JOIN Doubt
in case of outer join for combining two tables, if there is no common attribute does it returns cartesian product just like natural join does?

asked in Databases Nov 2, 2018

304 views

0 votes

0 answers

115

Korth
Give the relational algebra expression- works(person-name, company-name, salary) person-name is primary key Find the names of all employees who earn more than every employee of small bank corp

asked in Databases Nov 2, 2018

333 views

0 votes

1 answer

116

Karumanchi
what is the time complexity of function(int n) { if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } function(0.8n); } i'm getting O(nlogn base 5/4) using the recurrence relation method but in the book it's given O(n) $T(n)=T(\frac{4n}{5})+O(n)$

asked in Algorithms Oct 31, 2018

1.2k views

0 votes

0 answers

117

Process States-Doubt
when a process is in wait/blocked state it is in MM/disk/buffer?

asked in Operating System Oct 31, 2018

480 views

0 votes

1 answer

118

Mathematics: GATE-ME-2018

asked in Probability Oct 30, 2018

363 views

0 votes

1 answer

119

Mathematics: GATE-ME-2018

asked in Probability Oct 30, 2018

486 views

0 votes

0 answers

120

Decidability Doubt
A recursive language is empty or a recursive language contains all strings over sigma*. Why this problem is undecidable?

asked in Theory of Computation Oct 29, 2018

254 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 aditi19

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by aditi19

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments