Questions by HeadShot

0 votes

0 answers

21

Doubt : Schedule Count ( Transaction Management )
How fractional value possible ? 😅 Please give the correct expression.

asked in Databases Dec 25, 2018

400 views

0 votes

0 answers

22

Doubt : Previous year
Question : https://gateoverflow.in/91103/me-flt-4-q-58 ( i couldn't understand the discussion so solved like this := ) (Please check where i am doing wrong ) Approach : Dont understand whether method is wrong or formula is wrong. ( default method is used i. ... solve this ? ( if penalty is mentioned then how to use it ? means when to add cache time in it and when to not )

asked in CO and Architecture Dec 19, 2018

623 views

0 votes

0 answers

23

Doubt
ALL operation : Why ALL(empty) is true ?

asked in Databases Dec 19, 2018

190 views

0 votes

0 answers

24

ME ots stack and heap
Please explain points in short, and intuition behind its working.

asked in Programming in C Dec 14, 2018

425 views

0 votes

0 answers

25

ME OTS 5
Consider the following grammar with corresponding synthesized attributes: F → ⋅L {F.val = L.val} L → LB {L.len = L.len + 1} {L.val = L.val+2 ^(-L.len) B.val} L → B {L.len = 1, L.val = B.val/2} B → 0 {B.val = 0} B → 1 {B.val = 1} If F.val gives the value ... . (Upto 3 decimal places) Solution : Doubt : B.val = 0 ( red) then how 0.875 ( yellow ) ? wont it be : 0.75 + 2^-3 * 0 = 0.75 ?

asked in Compiler Design Dec 14, 2018

608 views

1 vote

0 answers

26

ME OTS 4
Consider the following relational schema: R(A, B, C, D, E, F, G, H ) with FD set {AB → C, AC→ B, AD → E, B → D, BC → A, E → G} the following relations are sub relations of the relation R. 1. R1(A, B, C) 2. R2(A, B, C, D) 3. R3(A, ... of sub relation are in BCNF __________. Ans : 1 ( R1) Doubt : Ck : FHBC , then wont be "BC-> A " a partial dependency in all 3 relations ?

asked in Databases Dec 14, 2018

638 views

0 votes

0 answers

27

ME OTS
Consider the following recursive function which is used by dynamic programming: Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves the value from table. Otherwise it calls a recursive function call to compute its return value. Whenever ... so for n=5 its fine, and for n=6 it exceeds 12 , but in given answer n=12 is considered, why ?

asked in Algorithms Dec 14, 2018

367 views

0 votes

0 answers

28

ME OTS 1
Explain a bit.

asked in Computer Networks Dec 13, 2018

190 views

0 votes

1 answer

29

ME OTS
Show Functional Completeness

asked in Digital Logic Dec 13, 2018

225 views

0 votes

0 answers

30

Doubt : ACE ots 3
Answer : Option A Doubt : 0 repeated n-1 times and a single 1 , then how <0,n> ?

asked in Linear Algebra Dec 11, 2018

406 views

0 votes

2 answers

31

Doubt ACE ots 3
Why 50 * 3 and not 50+3 ? Does every Byte requires different instruction ?

asked in CO and Architecture Dec 11, 2018

373 views

0 votes

0 answers

32

Doubt : ACE ots 2
Answer : Option C Please explain ( Why do we need to assume that there were seperate tables related to customer and store ? )

asked in Databases Dec 11, 2018

342 views

1 vote

1 answer

33

Doubt : ACE OTS 1
Prove S1 without using venn -diagram ( using boolean algebra )

asked in Set Theory & Algebra Dec 11, 2018

417 views

0 votes

1 answer

34

Doubt :ACE OTS
Ans : Option D But array size is 14 then how 15 is printed ? ptr size is 2 but precise answer given was 2.29 , how ?

asked in Programming in C Dec 11, 2018

255 views

0 votes

1 answer

35

Doubt : ACE OTS
What if the "||" is replaced with "&&" ? ( What does former condition in "if" results and how ?)

asked in Programming in C Dec 11, 2018

821 views

0 votes

0 answers

36

Self Doubt
Plese explain me this series

asked in Calculus Dec 11, 2018

386 views

0 votes

0 answers

37

Self Doubt
Given a standard 9*9 sudoku, What is the probability that I solved a sudoku and it results into a diagonal sudoku ? ( 1. Is it a valid question ? 2. What would be the difficulty ? )

asked in Combinatory Dec 10, 2018

151 views

0 votes

0 answers

38

Just A Curiosity !
I found it by doing some calculations on Google calculator. What I am interested in is , by word "handling" i dont want to handle error but want to produce a valid output. So how can i implement it in my code so that even if its invalid or not defined ... but they downvoted it.. :/ May be they dontt care about curiosity or its a silly thought :p but still i aske :v )

asked in Others Dec 4, 2018

395 views

0 votes

0 answers

39

Doubt : Reducibility
$Question:$ https://gateoverflow.in/63261/%23made-easy $Approach:$ A is reduced to B . Here reduction is done at polynomial time. Here B is solved in polynomial time. So A should also be in polynomial time. Now A can not be harder than ... just an argument for complexity classes? Explain if possible how reduction actually works, and why I couldn't apply it to my problem.

asked in Algorithms Dec 4, 2018

277 views

0 votes

0 answers

40

Doubt : Computability
"MATCH be the set of all graphs that have a perfect matching " Is it decidable ? My way of thinking : Using Blossoms Theirem we can find whether graph has matching set or not in polynomial time , But there is no bound on Number of graphs then I think it is undecidable whether my graph has membership in MATCH. Please help.

asked in Theory of Computation Dec 3, 2018

182 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