(1) The following diagram is an example of (a) A fraction (b) A fractal (c) Sierpinski's cat (d) Sierpinski's puppy (e) None of the above (2) Iteration is (a) A process that is (b) An algorithm |(e) None of the Sierpinski invented above (c) Something Pascal (d) Something invented done over and over again (3) The fourth term of the sequence defined by the recursive formula t; = 4, t2 = 6 t= tai+ tezis (a) 10 (b) 8 |(c) 16 (d) 30 (e) None of the above (4) Graph theory: (a) deals with learning (b) was invented by (c) has nothing to do (d) deals with networks (e) None of the how to plot x's before Descartes with Euler and their use in solving above y's problems (5) A Network is: (a) a collection of line (b) always a fractal (c) always traceable (d) complete but not (e) None of the above segments and nodes connected (6) Nodes are usually called: (a) foci (b) vertices (c) centrifuges (d) points of nodal (e) None of the intersection above (7) The line segments in a network are: (a) like a road that takes (b) not supposed to (c) always straight (d) Called edges (e) None of the above you to each edge cross The following refers to questions 8, 9, and 10. Consider the following map: A (8) The maximum number of colours needed for this map is (a) 1 (b) 2 (c) 3 (d) 4 (e) None of the above (9) The minimum number of colours needed for this map are:

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
icon
Concept explainers
Question
I need number 1, 2 ,3 ,4,5 ,6 ,7,8 only the option
(1) The following diagram
is an example of
(a) A fraction
(b) A fractal
(c) Sierpinski's cat
(d) Sierpinski's puppy (e) None of the above
(2) Iteration is
(a) A process that is
(b) An algorithm
(c) Something Pascal (d) Something
(e) None of the
done over and over
invented
Sierpinski invented above
again
(3) The fourth term of the sequence defined by the recursive formula ti= 4, tz = 6 tn= tn-1+ tn-2 is
(a) 10
(b) 8
(c) 16
(d) 30
(e) None of the above
(4) Graph theory:
(a) deals with learning (b) was invented by (c) has nothing to do (d) deals with networks (e) None of the
how to plot x's before
Descartes
with Euler
and their use in solving
above
y's
problems
(5) A Network is:
(a) a collection of line
segments and nodes
(b) always a fractal (c) always traceable (d) complete but not (e) None of the above
connected
(6) Nodes are usually called:
(a) foci
|(b) vertices
(c) centrifuges
(d) points of nodal
(e) None of the
intersection
above
(7) The line segments in a network are:
(a) like a road that takes
(b) not supposed to
(c) always straight (d) Called edges
(e) None of the above
you to each edge
cross
The following refers to questions 8, 9, and 10. Consider the following map:
A
B
(8) The maximum number of colours needed for this map is
(a) 1
(b) 2
| (c) 3
(d) 4
(e) None of the above
(9) The minimum number of colours needed for this map are:
|(a) 1
(b) 2
| (c) 3
(d) 4
(e) None of the above
(10) The map can be represented as a network that is:
(d) both (b) and (c) (e) both (a) and (c)
|(b) connected
The following refers to questions 11, 12, and 13.
(a) complete
(c) planar
A.
B
Consider the following network.
E
(11) The odd degree vertices are:
(а) А, В, с, D
(b) А, В, D, E
(c) B, D, E, F
(d) E, D, B, C
(e) None of the above
Transcribed Image Text:(1) The following diagram is an example of (a) A fraction (b) A fractal (c) Sierpinski's cat (d) Sierpinski's puppy (e) None of the above (2) Iteration is (a) A process that is (b) An algorithm (c) Something Pascal (d) Something (e) None of the done over and over invented Sierpinski invented above again (3) The fourth term of the sequence defined by the recursive formula ti= 4, tz = 6 tn= tn-1+ tn-2 is (a) 10 (b) 8 (c) 16 (d) 30 (e) None of the above (4) Graph theory: (a) deals with learning (b) was invented by (c) has nothing to do (d) deals with networks (e) None of the how to plot x's before Descartes with Euler and their use in solving above y's problems (5) A Network is: (a) a collection of line segments and nodes (b) always a fractal (c) always traceable (d) complete but not (e) None of the above connected (6) Nodes are usually called: (a) foci |(b) vertices (c) centrifuges (d) points of nodal (e) None of the intersection above (7) The line segments in a network are: (a) like a road that takes (b) not supposed to (c) always straight (d) Called edges (e) None of the above you to each edge cross The following refers to questions 8, 9, and 10. Consider the following map: A B (8) The maximum number of colours needed for this map is (a) 1 (b) 2 | (c) 3 (d) 4 (e) None of the above (9) The minimum number of colours needed for this map are: |(a) 1 (b) 2 | (c) 3 (d) 4 (e) None of the above (10) The map can be represented as a network that is: (d) both (b) and (c) (e) both (a) and (c) |(b) connected The following refers to questions 11, 12, and 13. (a) complete (c) planar A. B Consider the following network. E (11) The odd degree vertices are: (а) А, В, с, D (b) А, В, D, E (c) B, D, E, F (d) E, D, B, C (e) None of the above
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Points, Lines and Planes
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,