×

### Let's log you in.

or

Don't have a StudySoup account? Create one here!

×

or

## Analysis of Algorithms

by: Mireya Heidenreich

16

0

3

# Analysis of Algorithms CS 5633

Mireya Heidenreich
UTSA
GPA 3.55

Staff

These notes were just uploaded, and will be ready to view shortly.

Either way, we'll remind you when they're ready :)

Get a free preview of these Notes, just enter your email below.

×
Unlock Preview

COURSE
PROF.
Staff
TYPE
Class Notes
PAGES
3
WORDS
KARMA
25 ?

## Popular in ComputerScienence

This 3 page Class Notes was uploaded by Mireya Heidenreich on Thursday October 29, 2015. The Class Notes belongs to CS 5633 at University of Texas at San Antonio taught by Staff in Fall. Since its upload, it has received 16 views. For similar materials see /class/231391/cs-5633-university-of-texas-at-san-antonio in ComputerScienence at University of Texas at San Antonio.

×

## Reviews for Analysis of Algorithms

×

×

### What is Karma?

#### You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/29/15
Dynamic Sets Dynamic sets are data structures that support some or all of the following operations SEARCHS 16 Return 1 with keg51 k INSERTS 51 Insert 1 into S DELETES 1 Delete 1 from S MINIMUMS Return 1 with minimum keg51 MAXIMUMS Return 1 with maximum keg51 SUCCESSORS L Return 3 with next highest key PREDECESSORS L Return 3 with next lowest key S is a set 1 and y are elements 16 is a key NIL is returned if operation can t be performed Simple Dynamic Set Data Structures Dynamic Set Stack Queue Linked List SEARCH LIST SEARCH INSERT PUSH ENQUEUE LIST INSERT DELETE POP DEQUEUE LIST DELETE All stack and queue operations are 91 LIST INSERT is 91 for unsorted lists 0n for sorted lists LIST DELETE is 91 for doubly linked lists 0n for singly linked lists Average Case Analysis of LIST SEARCH LISTSEARCHL k x H headL while x y NIL and kegM y k do x H nex x return x LIST SEARCH is n on average Suppose there are n elements Each element is equally likely to be searched Search for the ith element uses 239 comparisons The expected value is the following summation 21 There are n elements to search for ln Prob for 2th element is 171 2 239 comparisons needed to nd ith element mi 1n n1 z z i E n z i 2 The result is Allocating and Freeing Objects ALLOCATE OBJECTO if free NIL then return NIL x 9 free free 9 next T66 return x FREE OBJECTJC nex x 9 free free 9 x Binary Tree Representation parent key data left right root

×

×

### BOOM! Enjoy Your Free Notes!

×

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

## Why people love StudySoup

Jim McGreen Ohio University

#### "Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Jennifer McGill UCSF Med School

#### "Selling my MCAT study guides and notes has been a great source of side revenue while I'm in school. Some months I'm making over \$500! Plus, it makes me happy knowing that I'm helping future med students with their MCAT."

Jim McGreen Ohio University

Forbes

#### "Their 'Elite Notetakers' are making over \$1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!
×

### Refund Policy

#### STUDYSOUP CANCELLATION POLICY

All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email support@studysoup.com

#### STUDYSOUP REFUND POLICY

StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here: support@studysoup.com

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to support@studysoup.com