A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2
by

1 Answer

Answer :

(B) n-3, n-2
by

Related questions

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Description : Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg( ... edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Description : A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Last Answer : B) Strongly Connected

A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Description : A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Last Answer : (D) 11

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is (A) 726 (B) 796 (C) 506 (D) 616

Description : Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is (A) 726 (B) 796 (C) 506 (D) 616

Last Answer : (D) 616

The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Description : The relation "divides" on a set of positive integers is .................. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only

Last Answer : (B) Anti symmetric and transitive Explanation: The ‘divide’ operation is antisymmetric because if a divides b does not necessarily implies that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.

Scaling of a polygon is done by computing a.The product of (x, y) of each vertex b.(x, y) of end points c.Center coordinates d.Only a

Description : Scaling of a polygon is done by computing a.The product of (x, y) of each vertex b.(x, y) of end points c.Center coordinates d.Only a

Last Answer : d.Only a

What is a polyhedron having a polygon for a base and triangular sides with a common vertex?

Description : What is a polyhedron having a polygon for a base and triangular sides with a common vertex?

Last Answer : A pyramid fits the given description

Prove that the diagonal divides a parallelogram into two congruent triangles. -Maths 9th

Description : Prove that the diagonal divides a parallelogram into two congruent triangles. -Maths 9th

Last Answer : Solution :-

Prove that median of a triangle divides it into two triangles of equal area. -Maths 9th

Description : Prove that median of a triangle divides it into two triangles of equal area. -Maths 9th

Last Answer : Solution :-

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

If you put together two right triangles such that their union will have four right angles what polygon will it form?

Description : If you put together two right triangles such that their union will have four right angles what polygon will it form?

Last Answer : The will form a rectangle.

In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex. A) Depth First B) Breadth First C) With First D) Depth Limited

Description : In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex. A) Depth First B) Breadth First C) With First D) Depth Limited

Last Answer : A) Depth First

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Last Answer : (D) maximal, minimal 

Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Description : Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Last Answer : (B) Black-box testing

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36

Description : Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36

Last Answer : (C) 14 / 36 

Prove that a diagonal of a parallelogram divide it into two congruent triangles. -Maths 9th

Description : Prove that a diagonal of a parallelogram divide it into two congruent triangles. -Maths 9th

Last Answer : Given: A parallelogram ABCD and AC is its diagonal . To prove : △ABC ≅ △CDA Proof : In △ABC and △CDA, we have ∠DAC = ∠BCA [alt. int. angles, since AD | | BC] AC = AC [common side] and ∠BAC = ∠DAC [alt. int. angles, since AB | | DC] ∴ By ASA congruence axiom, we have △ABC ≅ △CDA

Prove that a diagonal of a parallelogram divide it into two congruent triangles. -Maths 9th

Description : Prove that a diagonal of a parallelogram divide it into two congruent triangles. -Maths 9th

Last Answer : Given: A parallelogram ABCD and AC is its diagonal . To prove : △ABC ≅ △CDA Proof : In △ABC and △CDA, we have ∠DAC = ∠BCA [alt. int. angles, since AD | | BC] AC = AC [common side] and ∠BAC = ∠DAC [alt. int. angles, since AB | | DC] ∴ By ASA congruence axiom, we have △ABC ≅ △CDA

If there are two canals taking off from each flank of a river, then there will be (A) One divides wall and one under-sluice (B) One divides wall and two under-sluices (C) Two divide walls and one under-sluice (D) Two divide walls and two under-sluices

Description : If there are two canals taking off from each flank of a river, then there will be (A) One divides wall and one under-sluice (B) One divides wall and two under-sluices (C) Two divide walls and one under-sluice (D) Two divide walls and two under-sluices

Last Answer : Answer: Option D

Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curves lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points. (A) I, II and IV only (B) II and III only (C) I and II only (D) I, II and III only

Description : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only

Last Answer : (D) I, II and III only

What Difference between disjoint and overlapping constraints?

Description : What Difference between disjoint and overlapping constraints?

Last Answer : Need answer

What is a disjoint events mean?

Description : What is a disjoint events mean?

Last Answer : In probability theory, disjoint events are two (or more) events where more than one cannot occur in the same trial. It is possible that none of them occur in a particular trial.

Mutual exclusion problem occurs between:a) processes that share resourcesb) processes that do not use the same resourcesc) two disjoint processes that do not interactd) None of The Above

Description : Mutual exclusion problem occurs between: a) processes that share resources b) processes that do not use the same resources c) two disjoint processes that do not interact d) None of The Above

Last Answer : a) processes that share resources

What is a disjoint pattern database?

Description : What is a disjoint pattern database?

Last Answer : The sum of the two costs is still a lower bound on the cost of solving the entire problem is called a disjoint pattern database.

For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Description : The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Last Answer : (D) O(logn log logn)

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

A t-error correcting q-nary linear code must satisfy: Image Where M is the number of code words and X is (1) qn (2) qt (3) q-n (4) q-t

Description : A t-error correcting q-nary linear code must satisfy:  Where M is the number of code words and X is (1) qn (2) qt (3) q-n (4) q-t

Last Answer : (1) qn 

The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach

Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach

Last Answer : a) Divide-and-conquer

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family of recursively enumerable languages is closed under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Description : Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family ... under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Last Answer : The set of all languages that are not recursively enumerable is countable.

Which one of the following is correct for overloaded functions in C++? (1) Compiler sets up a separate function for every definition of function. (2) Compiler does not set up a separate function for every definition of function. (3) Overloaded functions cannot handle different types of objects. (4) Overloaded functions cannot have same number of arguments.

Description : Which one of the following is correct for overloaded functions in C++? (1) Compiler sets up a separate function for every definition of function. (2) Compiler does not set up a ... functions cannot handle different types of objects. (4) Overloaded functions cannot have same number of arguments.

Last Answer : Answer: 1

Two angles that have a common vertex and a common side are called supplementary angles. T or F?

Description : Two angles that have a common vertex and a common side are called supplementary angles. T or F?

Last Answer : FALSE

Two angles that have a common vertex and a common side are called supplementary angles. T or F?

Description : Two angles that have a common vertex and a common side are called supplementary angles. T or F?

Last Answer : FALSE

If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Description : If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Last Answer : (D) O(d(n+k))

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

After how much time every bacterium divides into two?

Description : After how much time every bacterium divides into two?

Last Answer : After twenty minutes.  

In the given figure, equal chords AB and CD of a circle with centre O cut at right angles at E. If M and N are the mid-points of AB and CD respectively, prove that OMEN is a square. -Maths 9th

Description : In the given figure, equal chords AB and CD of a circle with centre O cut at right angles at E. If M and N are the mid-points of AB and CD respectively, prove that OMEN is a square. -Maths 9th

Last Answer : Join OE. In ΔOME and ΔONE, OM =ON [equal chords are equidistant from the centre] ∠OME = ∠ONE = 90° OE =OE [common sides] ∠OME ≅ ∠ONE [by SAS congruency] ⇒ ME = NE [by CPCT] In quadrilateral OMEN, ... =ON , ME = NE and ∠OME = ∠ONE = ∠MEN = ∠MON = 90° Hence, OMEN is a square. Hence proved.

In the given figure, equal chords AB and CD of a circle with centre O cut at right angles at E. If M and N are the mid-points of AB and CD respectively, prove that OMEN is a square. -Maths 9th

Description : In the given figure, equal chords AB and CD of a circle with centre O cut at right angles at E. If M and N are the mid-points of AB and CD respectively, prove that OMEN is a square. -Maths 9th

Last Answer : Join OE. In ΔOME and ΔONE, OM =ON [equal chords are equidistant from the centre] ∠OME = ∠ONE = 90° OE =OE [common sides] ∠OME ≅ ∠ONE [by SAS congruency] ⇒ ME = NE [by CPCT] In quadrilateral OMEN, ... =ON , ME = NE and ∠OME = ∠ONE = ∠MEN = ∠MON = 90° Hence, OMEN is a square. Hence proved.

Radio device communication and triangulation?

Description : Radio device communication and triangulation?

Last Answer : Yes, you set-up receiver and listen to the transmission. I worked at a college radio station, we would have on our headphones and listen to the station on radio not on the “board out”

what- Fill in the blank in the statement below._____ Congruence is used in triangulation?

Description : what- Fill in the blank in the statement below._____ Congruence is used in triangulation?

Last Answer : angle- side angle

What is triangulation ? How to do it ?

Description : What is triangulation ? How to do it ?

Last Answer : Triangulation is a yoga practice. How to do: Stand with two legs apart. Rotate the right leg to the right and extend the angle of both the hands and keep them in a straight line. Bend the body ... left hand. Then return to the very first position and repeat the same process from the opposite side.

The distances AC and BC are measured from two fixed points A and B whose distance AB is known. The point C is plotted by intersection. This method is generally adopted in (A) Chain surveying (B) Traverse method of surveys (C) Triangulation (D) None of these

Description : The distances AC and BC are measured from two fixed points A and B whose distance AB is known. The point C is plotted by intersection. This method is generally adopted in (A) Chain surveying (B) Traverse method of surveys (C) Triangulation (D) None of these

Last Answer : (A) Chain surveying