Questions by stanchion / GATE Overflow for GATE CSE

1 votes

0 answers

1

Domain of Mod-Trigo function ALLEN2017
For existence of f(x) = , x lies in (take n I) (1) [0, 2nπ] (2) (3) (4) None of these how to solve such question? Pl give detailed explanation. Always find difficult to solve Range and domain of such complex question.

For existence of f(x) = , x lies in (take n I)(1)[0, 2nπ](2)(3)(4)None of thesehow to solve such question? Pl give detailed explanation.Always find difficult to solve R...

551 views

asked Dec 19, 2017

0 votes

0 answers

2

Operating System – Processes sanfoundry.com
If a system allows execution of only one process at a time, it is called as (1) Uni-processing Systems (2) Uni-tasking Systems (3) Uni-programming Systems Acc to me, ans is Uni-programming but answer given is Uni- ... -programing not uni-processing. Rather if ques would have mentioned about single processor then i think answer would be uni-processor.

If a system allows execution of only one process at a time, it is called as(1)Uni-processing Systems(2)Uni-tasking Systems(3)Uni-programming SystemsAcc to me, ans is Uni-...

1.0k views

asked Dec 18, 2017

0 votes

3 answers

3

Linear Homogeneous Equation (Allen 2017)
Consider a system of equations (λ – a)x + 2y +3z = 0, x +2(λ – b) y + 3z = 0, x + 2y + 3(λ – c) z = 0, which has a non-trivial solution. Product of all values of λ for above system is (1) abc + a + b + c + 2 (2) abc + a + b + c – 2 (3) abc – a – b – c – 2 (4) abc – a – b – c + 2 Ans given is Option C. Can anyone explain the complete solution?

Consider a system of equations (λ – a)x + 2y +3z = 0, x +2(λ – b) y + 3z = 0, x + 2y + 3(λ – c) z = 0, which has a non-trivial solution. Product of all values o...

739 views

asked Dec 1, 2017

3 votes

1 answer

4

topological ordering of DAG
What is the method to find no of topological ordering of a Directed Acyclic Graph? For an instance, i found two graphs on internet, whose no of topological ordering is given but how to quickly calculate the total no of ordering? Graph 1 For graph 1, no of ... . If I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?

What is the method to find no of topological ordering of a Directed Acyclic Graph?For an instance, i found two graphs on internet, whose no of topological ordering is giv...

984 views

asked Oct 21, 2017

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