Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources
Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study
Go to the blog

COSC 350 Quiz 2: Hashing, Sorting, and Linked Lists - Prof. Joseph D. Sloan, Quizzes of Data Structures and Algorithms

Wofford CollegeData Structures and Algorithms
Prof. Joseph D. Sloan

A quiz from a computer science course at wofford education, covering topics such as hashing, sorting algorithms, and linked lists. Students are required to answer questions related to hash table implementation using linear probing, sorting algorithms comparison, and linked list implementation using node and list classes in python.

Typology: Quizzes

Pre 2010

Uploaded on 08/19/2009

koofers-user-m07-1
koofers-user-m07-1 🇺🇸

10 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
SWELL…A Wofford Educa tion Page 1 of 5 2/2/2009
COSC 350: Quiz 2
Fall 2008: Sections 2.7, 4.3, & 4.4
Be sure to answer each question carefully and completely.
1. (1 pts) Enter your name: ____________________________________________
2. (12 pts.) Using the hash function h(n) = n % 10 with collision resolution by linear
probing, insert the following numbers into the given hash table:
277, 63, 500, 127, 89, 958.
3. (3 pts.) What is the loading factor for the previous problem?
4.(3 pts.) What is the ideal complexity for hashing?
5. (3 pts.) What problem with linear probing is avoided with chaining?
6. (4 pts.) What are the ideal characteristics of a “perfect” hash function?
pf3
pf4
pf5

Partial preview of the text

Download COSC 350 Quiz 2: Hashing, Sorting, and Linked Lists - Prof. Joseph D. Sloan and more Quizzes Data Structures and Algorithms in PDF only on Docsity!

COSC 350: Quiz 2

Fall 2008: Sections 2.7, 4.3, & 4.

Be sure to answer each question carefully and completely.

  1. (1 pts) Enter your name: ____________________________________________
  2. (12 pts.) Using the hash function h(n) = n % 10 with collision resolution by linear probing , insert the following numbers into the given hash table: 277, 63, 500, 127, 89, 958.
  3. (3 pts.) What is the loading factor for the previous problem? 4.(3 pts.) What is the ideal complexity for hashing?
  4. (3 pts.) What problem with linear probing is avoided with chaining?
  5. (4 pts.) What are the ideal characteristics of a “perfect” hash function?

7.(10 pts.) Which would you prefer to use? Both? Neither? Conditions Choices Answer The algorithm must be stable Insertion vs. selection sort The system does not support recursion Quick vs. merge sort The data is almost completely sorted Bubble vs. insertion sort Data must be sorted in place Merge vs. bubble sort You need the lowest possible average complexity Insertion vs. shell sort

  1. (6 pts.) Complete the table: Algorithm Best Case Complexity Average Complexity Worst Case Complexity Binary Search Linear Search
  1. (8 pts.) Give Python code to define a node class that might be used in a linked list implementation similar to the one in Section 7.2 of your text.
  2. (12 pts.) Give Python code for a partial class definition of a linked list similar to the one in Section 7.2 of your text. Use the node definition given in the preceding problem. Your definition should include members to a) initialize a linked list b) find the size of a linked list c) create and add a new node to the front of the linked list
  1. This is a continuation of the previous problems. Assume you have a non-empty linked list mylist and a reference (or pointer) to a node current. You want to add a new node with the stored value datum so that the new node follows current , i.e., the new node is spliced into the list after the current node. a) (4 pts.) What two cases must you consider when designing the code? b) (4 pts.) Use box-pointer notation to sketch each case both before and after the addition. c) (12 pts.) Give Python code that will work for both cases.