50.algorithm complexity with m node in Dijkstra's algorithm: سیدگی الگوریتم با گره m در الگوریتم Dijkstra A. m(m+1)/2 comparisons: O(m) complexity B. O(nlogn) C. n(n+1)/2 comparisons: O(n) complexity D. O(mlogm) 51.Distance vector algorithm, which one is wrong? ارتباط با الگوریتم بردار فاصله، کدام گزینه صحیح نیست؟ A. Based on Bellman-Ford (BF) equation B. D.(y): cost of largest-cost path from x to y C. dynamic programming D. D.(y) = min, { Cxv+D.(y)} 52. which one is wrong?i sdi p A. intra-AS (aka "intra-domain"): routing among within same AS ("network") B. inter-AS (aka "inter-domain"): routing among AS'es C. gateways can't perform inter-domain routing (as well as intra-domain routing)
50.algorithm complexity with m node in Dijkstra's algorithm: سیدگی الگوریتم با گره m در الگوریتم Dijkstra A. m(m+1)/2 comparisons: O(m) complexity B. O(nlogn) C. n(n+1)/2 comparisons: O(n) complexity D. O(mlogm) 51.Distance vector algorithm, which one is wrong? ارتباط با الگوریتم بردار فاصله، کدام گزینه صحیح نیست؟ A. Based on Bellman-Ford (BF) equation B. D.(y): cost of largest-cost path from x to y C. dynamic programming D. D.(y) = min, { Cxv+D.(y)} 52. which one is wrong?i sdi p A. intra-AS (aka "intra-domain"): routing among within same AS ("network") B. inter-AS (aka "inter-domain"): routing among AS'es C. gateways can't perform inter-domain routing (as well as intra-domain routing)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![50.algorithm complexity with m node in Dijkstra's algorithm:
پیچیدگی الگوریتم با گره m در الگوریتم Dijkstra
A. m(m+1)/2 comparisons: O(m2) complexity
B. O(nlogn)
C. n(n+1)/2 comparisons: O(n) complexity
D. O(mlogm)
51.Distance vector algorithm, which one is wrong?
در ارتباط با الگوریتم بردار فاصله، کدام گزینه صحیح نیست؟
A. Based on Bellman-Ford (BF) equation
B. D,(y): cost of largest-cost path from x to y
C. dynamic programming
D. D.(y) = min, ( Cx.v+ D.(y)}
52. which one is wrong? o dijŚ pas
A. intra-AS (aka "intra-domain"): routing among within same AS ("network")
B. inter-AS (aka "inter-domain"): routing among AS'es
C. gateways can't perform inter-domain routing (as well as intra-domain routing)
D. routers in different AS can run different intra-domain routing protocols](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb63cac1f-eff3-4bc5-abe5-d6f7cf5802ae%2F5f515b58-dd74-4900-8011-3b1e3ff4a05c%2F0t2mq3s_processed.jpeg&w=3840&q=75)
Transcribed Image Text:50.algorithm complexity with m node in Dijkstra's algorithm:
پیچیدگی الگوریتم با گره m در الگوریتم Dijkstra
A. m(m+1)/2 comparisons: O(m2) complexity
B. O(nlogn)
C. n(n+1)/2 comparisons: O(n) complexity
D. O(mlogm)
51.Distance vector algorithm, which one is wrong?
در ارتباط با الگوریتم بردار فاصله، کدام گزینه صحیح نیست؟
A. Based on Bellman-Ford (BF) equation
B. D,(y): cost of largest-cost path from x to y
C. dynamic programming
D. D.(y) = min, ( Cx.v+ D.(y)}
52. which one is wrong? o dijŚ pas
A. intra-AS (aka "intra-domain"): routing among within same AS ("network")
B. inter-AS (aka "inter-domain"): routing among AS'es
C. gateways can't perform inter-domain routing (as well as intra-domain routing)
D. routers in different AS can run different intra-domain routing protocols
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY