CS-6105 - Discrete Mathematics oed answer key

Showing 301 to 320 of 326 total answers.

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

Let ‘G’ be a connected planar graph with 20 vertices and the degree of each vertex is 3. Find the number of regions in the graph.

Answer

12

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

If we have two sets, Set A = {a, b} and Set B = {2, 7},the Cartesian product of A and B is:A × B = {(a, 2), (a, 7), (b, 2), (b, 7)}

Answer

True

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

This is an application of discrete mathematics that use linear algebra in order to transform (move, scale, change perspective) objects

Answer

video games

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

If we have two sets, Set A = {a, b} and Set B = {3, 5}, the Cartesian product of A and B (A × B) is:A × B = {(3, a), (3, b), (5, a), (5, b)}

Answer

False

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

Rule that states that every function can be described in four ways: algebraically (a formula), numerically (a table), graphically, or in words.

Answer

Rule of four

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

If the right angled triangle t, with sides of length a and b and hypotenuse of length c, has area equal to c 2/4, what kind of triangle is this?

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

A graph is an ordered pair G (V, E) consisting of a nonempty set V (called the vertices) and a set E (called the edges) of two-element subsets of V.

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

Facial Coding too employments this to gauge how locked in the client is when looking at motion pictures, online shopping locales, and advertisements

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

A graph for which it is possible to divide the vertices into two disjoint sets such that there are no edges between any two vertices in the same set.

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

How many 3-letter words with or without meaning, can be formed out of the letters of the word, 'LOGARITHMS', if repetition of letters is not allowed?

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

At a breakfast buffet, 93 people ordered regular coffee and 47 people ordered iced coffeeIf 25 people chose both How many people visited in the buffet?

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

As soon as one vertex of a tree is designated as the ____, then every other vertex on the tree can be characterized by its position relative to the root.

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

In a dorm room of 15 people, 7 of them knows how to play guitar while 5 of them plays the piano If 2 people can play both, how many can play the guitar ONLY?

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

is a function which is both an injection and surjection. In other words, if every element of the codomain is the image of exactly one element from the domain

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

The ________________________ states that if event A can occur in m ways, and event B can occur in n disjoint ways, then the event “A or B” can occur in m + n ways

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

Shneiderman's rules for mistake messages alludes to the detecting advances utilized to degree galvanic skin reaction (GSR), facial expressions, motions, body development

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

A Bipartite graph is a graph for which it is possible to divide the vertices into two disjoint sets such that there are no edges between any two vertices in the same set.

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

In a dorm room of 15 people, 7 of them knows how to play guitar while 5 of them plays the piano 2 people can play both How many people in the room does not play any instrument?

#CS-6105
Awesome StudentQuestion • Discrete Mathematics

A ___ connected graph with no cycles. (If we remove the requirement that the graph is connected, the graph is called a forest.) The vertices in a tree with degree 1 are called __

Page 16 of 17