MidtermSu98 - EEL 4851 Midterm Tuesdays and Thursdays 8:30 to 10:20 NAME 1 Summer 1998 SS Short questions For each question you must explain your

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
EEL 4851 Midterm Summer 1998 Tuesdays and Thursdays 8:30 to 10:20 NAME_____________________________ SS#_____________________________ 1. Short questions. For each question you must explain your answer. Write neatly. I can not give you credit if I can not read your answer. a. What is the best sorting algorithm to use if the elements to sort are very large and swapping them takes a relatively long time. b. What is the best sorting algorithm to use if the elements to sort are already almost sorted. c. What is the best searching algorithm to use if the list of data is sorted. d. Why do we use the big-O notation instead of the actual number of comparisons to analyze algorithms.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
e. Why are we not concerned about the constants in the big-O notation. f. Why would one use the array implementation of linked list. g. When implementing a stack, what is the advantage of using linked list over arrays. h. When implementing a stack, when will it be preferable to use arrays instead of linked lists.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 01/14/2012.

Page1 / 5

MidtermSu98 - EEL 4851 Midterm Tuesdays and Thursdays 8:30 to 10:20 NAME 1 Summer 1998 SS Short questions For each question you must explain your

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online