Recent questions tagged numerical-answers / GATE Overflow for GATE CSE

2 votes

3 answers

691

GO Classes Test Series 2023 | Digital Logic | Test 2 | Question: 21
A combinational logic circuit takes a $4$-bit unsigned binary integer number at its inputs labeled $\mathrm{D}_{3}, \mathrm{D}_{2}, \mathrm{D}_{1}$ and $\mathrm{D}_{0}$, where $\mathrm{D}_{3}$ is the most ... $0$ otherwise. How many prime implicants does $S$ have which are not essential prime implicants?

A combinational logic circuit takes a $4$-bit unsigned binary integer number at its inputs labeled $\mathrm{D}_{3}, \mathrm{D}_{2}, \mathrm{D}_{1}$ and $\mathrm{D}_{0}$, ...

GO Classes

244 views

GO Classes asked May 27, 2022

0 votes

2 answers

692

Suppose an ISP owns the block of addresses of the form 131.210.16.0/21. Suppose it wants to create four subnets from this block, with each block having the same number of IP addresses. i. What are the prefixes (of form a.b.c.d/x) for the four subnets? ii. What is the number of host address that can be supported per subnet?

Suppose an ISP owns the block of addresses of the form 131.210.16.0/21. Suppose it wants to create four subnets from this block, with each block having the same number of...

Neyoa

3.2k views

Neyoa asked May 19, 2022

3 votes

1 answer

693

GO Classes Weekly Quiz 10 | Discrete Mathematics | Set Theory, Mathematical Logic, Lattice | Question: 15

Suppose $A$ is a finite set of five elements. Then the cardinality of the largest partial order relation possible on $A$ is _______

GO Classes

394 views

GO Classes asked May 12, 2022

5 votes

1 answer

694

GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 2
Let $\text{G}$ be the following set of undirected connected graphs $:$ $\text{G} = \{ g \mid g \;\text{is a complete graph on}\; n\; \text{vertices where}\; 1\leq n \leq 10 \;\text{OR} \;g$ is a cycle graph on ... $a$ is isomorphic to $b.$ How many equivalence classes will be there for $\text{R}?$

Let $\text{G}$ be the following set of undirected connected graphs $:$$\text{G} = \{ g \mid g \;\text{is a complete graph on}\; n\; \text{vertices where}\; 1\leq n \leq 1...

GO Classes

490 views

GO Classes asked May 11, 2022

4 votes

1 answer

695

GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 4
The number of simple undirected graphs with $6$ labeled vertices and exactly $3$ edges is _________

The number of simple undirected graphs with $6$ labeled vertices and exactly $3$ edges is _________

GO Classes

582 views

GO Classes asked May 11, 2022

2 votes

1 answer

696

GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 13
For the following graph, what is the summation of chromatic number and matching number?

For the following graph, what is the summation of chromatic number and matching number?

GO Classes

465 views

GO Classes asked May 11, 2022

4 votes

1 answer

697

GO Classes Test Series 2024 | Discrete Mathematics | Test 4 | Question: 1
Consider the set of $4$-digit positive integers. How many of them are odd and have distinct digits?

Consider the set of $4$-digit positive integers. How many of them are odd and have distinct digits?

GO Classes

311 views

GO Classes asked May 3, 2022

7 votes

2 answers

698

GO Classes Test Series 2024 | Discrete Mathematics | Test 4 | Question: 5
By definition, a poker hand is a set of $5$ cards from a standard French deck of $52$ cards. We shall consider a standard French playing deck, which includes thirteen ranks in each of the four French suits. Thus, each ... instance, three sevens and two Queens, or three Aces and two fives. How many full house we can have ?

By definition, a poker hand is a set of $5$ cards from a standard French deck of $52$ cards. We shall consider a standard French playing deck, which includes thirteen ran...

GO Classes

490 views

GO Classes asked May 3, 2022

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