Quiz 2
CS 261
Summer 2014
Name:_
1) Write down the worst-case computational complexity for adding to the back of a queue using a linked
list with only a first-link pointer, assuming the first link is
Practice Midterm Exam Solutions
Note:
These
practice questions are of the style that you
will see on the exam.
Big-(O):
1. What is the big O notation for:
2n4+4n3- 6n logn + 100
- O(n4)
2.
The followi
Chapter 8: Bags and Sets
In the stack and the queue abstractions, the order that elements are placed into the
container is important, because the order elements are removed is related to the order in
CS261: Main/Programming Assignment 1
View Edit History Attach Print Logout
Main
Programming Assignment 1
C Programming Practice
CS261 Home
Schedule
Assignments
Resources
The purpose of this assignment
CS 261: Data Structures
Midterm
Last:_ First:_
This midterm consists of 12 pages and a total of 70 points. It is
closed book and closed notes. You have 50 minutes to complete
this midterm. If you are
Worksheet 20: Dynamic Array Deque and Queue Name:
Worksheet 20: Dynamic Array Deque and Queue
In Preparation: Read Chapter 7 to learn more about the Queue and Deque data types. If
you have not done it
Assignment 5: Heap and to-do list
There are two parts to this assignment. In the rst part, you will complete the implementation of heapbased Priority Queue and implement the Heapsort algorithm. In the
CS 556: HOMEWORK 4 due March 15, 2010
This homework is about object recognition using the bag-of-words model, on the Graz-02 images of bikes, cars, and people, which can be downloaded from:
http:/lear
Worksheet 17: Linked List Introduction List Stack Name:
Worksheet 17: Linked List Introduction, List Stack
In Preparation: Read Chapter 6 to learn more about the Stack data type.
In Worksheet 14, you
Assignment 5
Assignment #5: Heap Implementation of a ToDo List
In this assignment, you will implement a To-Do List application with a Heap-based Priority Queue.
The application allows its users to man
Quiz 1
CS 261
Summer 2014
Name:_
1) Write down the worst-case computational complexity of pushing a stack using a fixed-size array
implementation in O() notation.
O(1), because can never resize. You a
CS 261: Data Structures in CS : Assignment 1
C Programming Practice
The purpose of this assignment is to help you get started with programming in C and give you practice with pointer manipulation.
The
Worksheet 24: Linked List Iterator Name:
Worksheet 24: LinkedList Iterator
In preparation: Read Chapter 8 to learn more about the concept of Iterators. If you have
not done it already, you should comp
CS261: Midterm Exam 1
NAME:
INSTRUCTIONS
This is a 45 minute, closed-book exam containing TWO problems
Consistent, repeating errors in C syntax will each be penalized by 1% of the total score
Cheat
Worksheet 0: Building an ADT Using an Array Name:
Worksheet 0: Building a Simple ADT Using an Array
In Preparation: Read about basic ADTs.
In this worksheet we will construct a simple BAG and STACK ab
Exam review
CS 261 Lab #10
The exam will be comprehensive
(so dont forget to review the midterm slides!)
Similar style as midterm
(multiple choice, matching, true/false, code)
This review will focus o
Quiz 1
CS 261
Summer 2014
Alternate version
Name:_
1) Write down the average-case computational complexity of adding to a bag using a dynamic array
implementation in O() notation.
O(1) or O(1+), becau
CS 556: HOMEWORK 2 due Feb 15, 2010
Problem 1 (40pts)
This problem is about camera calibration. Given a set of images, and correspondences between points in the images and points in the 3D scenes, cal
Note: These practice questions are of the style that you will see on
the exam. This set of practice problems is longer than what you will
see on the actual midter
Worksheet 36: Dynamic Array Dictionary Name:
Worksheet 36: Dynamic Array Dictionary
In Preparation: Read Chapter 12 to learn more about the Dictionary data structure. If you
have not done so already,
Worksheet 0: Building an ADT Using an Array Name:
Worksheet 0 (Solution): Building a Simple ADT Using
an Array
In Preparation: Read about basic ADTs.
In this worksheet we will construct a simple BAG a
HW4 Report
Zhongzang Lin Mar 15, 2010
1 Introduction
This homework is about object recognition using the bag-of-words model, testing on the Graz-02 images of bikes, cars, and people. Images of each cl
worksheet: Heaps
Name:
Worksheet: Heap Practice
In Preparation: Read Chapter 11 on the Priority Queue ADT and Heaps
Insert the following values, in the order that they are given into a Min Heap. Show
Worksheet 26: Ordered Bag using a Sorted Array Name:
Worksheet 26: Solution: Ordered Bag using a Sorted Array
In Preparation: Read Chapter 8 to learn more about the Bag data type and Chapter 9 to
lear
worksheet 34: BuildHeap and Heap Sort
Name:
Worksheet 34: BuildHeap and Heap Sort
In preparation: If you have not done so already, you should complete Worksheet 33 to
learn more about the heap data st
Worksheet 33: Heaps and Priority Queues Name:
Worksheet 33: Heaps and Priority Queues
In preparation: Read Chapter 10 to learn more about trees, and chapter 11 to learn more
about the Priority Queue d