Q6: which of the following data structure is Linear a) Single Linked List b) Double linked list c) Array d) All of them Q7: The efficiency of an algorithm is measured by a) Number of steps in an algorithm b) Time and space consumed by the algorithm c) Number of loops in the algorithm d) The kind of data structures used in the algorithm

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...
icon
Related questions
Question
Q6: which of the following data structure is Linear
a) Single Linked List
b) Double linked list
c) Array
d) All of them
Q7: The efficiency of an algorithm is measured by
a) Number of steps in an algorithm
b) Time and space consumed by the algorithm
c) Number of loops in the algorithm
d) The kind of data structures used in the algorithm
Q8: In the context of algorithms time complexity, select the best time:
a) O(n)
b) O(n(log(n)))
c) O(log(n))
d) O(n°)
Q9: Consider the code fragment:
integer n = 128; while (n2 1) {do something; n=n/2; }
a) The code runs in O(n) time
b) The code runs in O(n?) time
c) The code runs in O(log(n)) time
d) The code runs in O(n(log(n))) time
Q10: for an array of size 10 which sorting algorithm would you choose?
a) Quick sort
b) Merge sort
c) Insertion sort
d) None of the above
Transcribed Image Text:Q6: which of the following data structure is Linear a) Single Linked List b) Double linked list c) Array d) All of them Q7: The efficiency of an algorithm is measured by a) Number of steps in an algorithm b) Time and space consumed by the algorithm c) Number of loops in the algorithm d) The kind of data structures used in the algorithm Q8: In the context of algorithms time complexity, select the best time: a) O(n) b) O(n(log(n))) c) O(log(n)) d) O(n°) Q9: Consider the code fragment: integer n = 128; while (n2 1) {do something; n=n/2; } a) The code runs in O(n) time b) The code runs in O(n?) time c) The code runs in O(log(n)) time d) The code runs in O(n(log(n))) time Q10: for an array of size 10 which sorting algorithm would you choose? a) Quick sort b) Merge sort c) Insertion sort d) None of the above
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY