UGC NET CSE | December 2018 | Part 2 | Question: 65

Arjun asked Jan 2, 2019 • edited Jun 22, 2020 by soujanyareddy13

445 views

See all

Please log in or register to answer this question.

Related questions

0 votes

2 answers

Arjun asked Jan 2, 2019

3,627 views

UGC NET CSE | December 2018 | Part 2 | Question: 4
A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train and Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows : ... all the three methods $5$ people. How many people completed the survey form? $120$ $165$ $160$ $115$

A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train and Automobile as a major method of travelling ...

Arjun

3.6k views

Arjun asked Jan 2, 2019

0 votes

1 answer

Arjun asked Jan 2, 2019

1,675 views

UGC NET CSE | December 2018 | Part 2 | Question: 6
The relation $\leq$ and $>$ on a boolean algebra are defined as: $x \leq y$ if and only if $x \vee y =y$ $x <y$ means $x \leq y$ but $x \neq y$ $x \geq y$ means $y \leq x$ and $x>y$ means $y<x$ Considering ... $y < z$, then $x < y$ Choose the correct answer from the code given below: i and ii only ii and iii only iii only iv only

The relation $\leq$ and $>$ on a boolean algebra are defined as:$x \leq y$ if and only if $x \vee y =y$$x <y$ means $x \leq y$ but $x \neq y$$x \geq y$ means $y \leq x$ a...

Arjun

1.7k views

Arjun asked Jan 2, 2019

1 votes

0 answers

Arjun asked Jan 2, 2019

971 views

UGC NET CSE | December 2018 | Part 2 | Question: 9
Use Dual Simplex Method to solve the following problem: $\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}$ ... $x_1=0, x_2=2, \text{ and } z=-6$ $x_1=6, x_2=2, \text{ and } z=-18$

Use Dual Simplex Method to solve the following problem:$\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ ...

Arjun

971 views

Arjun asked Jan 2, 2019

0 votes

2 answers

Arjun asked Jan 2, 2019

4,400 views

UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$

Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$

Arjun

4.4k views

Arjun asked Jan 2, 2019

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

UGC NET CSE | December 2018 | Part 2 | Question: 65

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0