1. Which of the following cannot be solved by using the greedy algorithm? ( ) A. Exchange problem B. 4-Queen problem 2. Which of the following is the best in average? ( ) A. Bubble sort B. Selection sort C. Insertion sort D. Quick sort 3. Which is the time complexity of binary search under the best case? ( ) A. O(1) B. O(n) C. O(logn) D. O(nlogn) 4. The complexity of the formula T(n)=3nlogn+6n+1 is ( ) A. O(3nlogn) B. O(6n) C. O(nlogn) C. Huffman coding D. Overload problem D. O(1)
1. Which of the following cannot be solved by using the greedy algorithm? ( ) A. Exchange problem B. 4-Queen problem 2. Which of the following is the best in average? ( ) A. Bubble sort B. Selection sort C. Insertion sort D. Quick sort 3. Which is the time complexity of binary search under the best case? ( ) A. O(1) B. O(n) C. O(logn) D. O(nlogn) 4. The complexity of the formula T(n)=3nlogn+6n+1 is ( ) A. O(3nlogn) B. O(6n) C. O(nlogn) C. Huffman coding D. Overload problem D. O(1)
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
Subject:
Major : Software Engineering
Hi Sir, this is only MCQ part. Just write answer (A/B/C/D).
1.
2.
3.
4.
5.
thanks for help.... take Love
Transcribed Image Text:1. Which of the following cannot be solved by using the greedy algorithm? (___)
A. Exchange problem
B. 4-Queen problem
C. Huffman coding
-2. Which of the following is the best in average? ( )
A. Bubble sort B. Selection sort C. Insertion sort D. Quick sort
-3. Which is the time complexity of binary search under the best case? ( )
A. O(1) B. O(n) C. O(logn) D. O(nlogn)
-4. The complexity of the formula T(n)=3nlogn+6n+1 is (___)
A. O(3nlogn)
B. O(6n)
C. O(nlogn)
-5. Matrix multiplication can be implemented by using? (
)
A. Dynamic Programming B. Greedy C. Backtracking
D. O(1)
D. Overload problem
D. Bound and Boundary
Expert Solution
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
Recommended textbooks for you
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…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
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)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY