Amity B.SC IT 1 Sem Solve Assignment For Basic Mathematics Sem 1
|
|||
|
|||
|
|||
|
|||
|
Case Detail :
Questions
|
|
|
Asection C
Question No. 1 Marks - 10
A graph G is called a .....if it is a connected acyclic graph
Options
- Cyclic graph
- Regular graph
- Tree
- not a graph
Question No. 2 Marks - 10
In an undirected graph the number of nodes with odd degree must be :
Options
- Zero
- Odd
- Prime
- Even
Question No. 3 Marks - 10
A graph is a collection of :
Options
- Row and columns
- Vertices and edges
- Equations
- degrees
Question No. 4 Marks - 10
A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are :
Options
- greater than n–1
- less than n(n–1)
- greater than n(n–1)/2
- less than n2/2
Question No. 5 Marks - 10
A graph with one vertex and no edges is :
Options
- multigraph
- digraph
- isolated graph
- trivial graph
Question No. 6 Marks - 10
The maximum degree of any vertex in a simple graph with n vertices is :
Options
- n–1
- n+1
- 2n–1
- n
Question No. 7 Marks - 10
The complete graph with four vertices has k edges where k is
Options
- 3
- 4
- 5
- 6
Question No. 8 Marks - 10
For two sets A, B
A ∩ (B U C) = (A ∩ B) U(A∩ C) is called :
Options
- Distributivity of intersection over union
- Distributivity of union over intersection
- De Morgan's law
- Distributivity Law
Question No. 9 Marks - 10
The total number of elements in a set is called :
Options
- Strength
- Cardinality
- Finite`
- Infinite
Question No. 10 Marks - 10
Let A,B,C be the subsets of a universal set U.
Then (AUB) U C is equal to :
Options
- A ∩ ( B U C)
- A U (B ∩ C)
- ?
- A U ( B U C)
Question No. 11 Marks - 10
The set in set builder form of vowels of English alphabet is :
Options
- {a, e, i, o, u}
- A = {x | x is a vowel in English alphabet)
- ?
- {a, b, c, d, e, f, g}
Question No. 12 Marks - 10
The study of the methods of organization, summarization, and presentation of statistical data is referred to as :
Options
- inferential statistics
- descriptive statistics
- sampling
- frequency
Question No. 13 Marks - 10
The entities on which data are collected are :
Options
- variables
- data sets
- elements
- functions
Question No. 14 Marks - 10
Graphs which present the values on the horizontal axis and the number of times this occurs on the vertical axis are known as what?
Options
- Line graph
- cluster graph
- box-plot
- Frequency distribution
Question No. 15 Marks - 10
What would you use to compare the frequency distributions of more than one set of data?
Options
- Frequency polygon
- Line graph
- Bar chart
- Scatter graph
Question No. 16 Marks - 10
A frequency distribution is a tabular summary of data showing the :
Options
- fraction of items in several classes
- percentage of items in several classes
- relative percentage of items in several classes
- number of items in several classes
Question No. 17 Marks - 10
A frequency distribution is :
Options
a tabular summary of a set of data showing the relative frequency.
- a graphical form of representing data.
- a tabular summary of a set of data showing the frequency of items in each of several nonoverlapping classes.
- a graphical device for presenting qualitative data.
Question No. 18 Marks - 10
Data that provide labels or names for categories of like items are known as :
Options
- qualitative data
- quantitative data
- label data
- category data
Question No. 19 Marks - 10
A tabular method that can be used to summarize the data on two variables simultaneously is called :
Options
- simultaneous equations
- crosstabulation
- a histogram
- an ogive
Question No. 20 Marks - 10
A graphical presentation of the relationship between two variables is :
Options
- an ogive
- a histogram
- either an ogive or a histogram, depending on the type of data
- a scatter diagram
Question No. 21 Marks - 10
A graph is a tree if and only if it :
Options
- Is completely connected
- Is minimally connected
- Contains a circuit
- Is planar
Question No. 22 Marks - 10
Which of the following statement is true :
Options
- Every graph is not its own subgraph
- The terminal vertex of a graph are of degree two.
- A tree with n vertices has n edges.
- A single vertex in graph G is a subgraph of G.
Question No. 23 Marks - 10
Determine the number of Hamilton circuits in a complete graph with 5 vertices :
Options
- 6
- 5
- 120
- 24
Question No. 24 Marks - 10
If A = {2, 4} and B = {1, 2, 3, 4}, the set A is ________set B.
Options
- an element of
- equal to
- a proper subsets of
- equivalent to
Question No. 25 Marks - 10
Set A contains 35 elements, set B contains 15 elements, and 10 elements are common to both sets A and B. How many elements are in A U B ?
Options
- 60
- 40
- 20
- 50
Question No. 26 Marks - 10
If selling price is doubled, the profit triples. Find the profit percent.
Options
- 100
- 120
- 200/3
- 316/3
Question No. 27 Marks - 10
A.(B + C) = A.B + A.C is the expression of _________________
Options
- Demorgan's Law
- Commutative Law
- Distributive Law
- Associative Law
Question No. 28 Marks - 10
If a statement is always true, then the statement is called ……………………..
Options
- Tautology
- Contigency
- Contracdiction
- converse
Question No. 29 Marks - 10
The number of vertices of odd degree in a graph is
Options
- always even
- always odd
- either even or odd
- always zero
Question No. 30 Marks - 10
A vertex of degree one is called as
Options
- Rendant
- isolated vertex
- null vertex
- colored vertex
Question No. 31 Marks - 10
A circuit in a connected graph, which includes every vertex of the graph is known as
Options
- Euler
- Universal
- Hamilton
- None of these
Question No. 32 Marks - 10
A given connected graphic is a Euler graph if and only if all vertices of G are of
Options
- same degree
- even degree
- odd degree
- different degrees
Question No. 33 Marks - 10
The length of Hamilton path (if exists) in a connected graph of n vertices is
Options
- n-1
- n
- n+1
- n/2
Question No. 34 Marks - 10
A graph with n vertices and n+1 edges that is not a tree, is
Options
- connected
- disconnected
- eculer
- a circuit
Question No. 35 Marks - 10
A graph is a tree if and only if
Options
- is completely connected
- is minimum connected
- contains a circuit
- is planer
Question No. 36 Marks - 10
The minimum number of spanning trees in a connected graph with n nodes is
Options
- 1
- 2
- n-1
- n/2
Question No. 37 Marks - 10
The number of different rooted labeled trees with n vertices
Options
- 2n-1
- 2n
- nn-1
- nn
Question No. 38 Marks - 10
Which of the following is false ?
Options
- The set of all bijective functions on a finite set forms a group under function composition
- The set {1,2,…p-1} forms a group under function composition.
- The set of all strings over a finite alphabet forms a group under concatenation
Question No. 39 Marks - 10
Let (Z, *) be an algebraic structure where Z is the set of integers and the operation * is defined by n * m = maximum (n, m), which of the following statements is true for (z,*).
Options
- (z,*) is a monoid
- (z,*) is an Abelian group
- (z,*) is a group
- None of the above
Question No. 40 Marks - 10
The number of circuit in a tree with n nodes
Options
- zero
- 1
- n-1
- n/2
