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 the front.
O(n), because you have to update the next po
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 already, complete worksheets 14 and 16 to learn more a
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 taking too much time on one question,
please move on to
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 is to help you get started with programming in C and g
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 complete Worksheets 17 and 23 to learn more about the
basic
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.inrialpes.fr/people/marszalek/data/ig02/
Images of the
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+), because of the amortized cost of expanding a dynamic array.
Worksheet 20: Dynamic Array Queue and Deque
Name:
Worksheet 20: Solution: Dynamic Array Deque and
Queue
In an earlier lesson you explored why one cannot use a dynamic array as the basis for an
efficient queue (which adds to the back and removes from the f
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 always write at the index given by the size variable.
2)
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, complete worksheets 14 and 16 to learn more about the
d
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 the
tree after each insertion.
1)
2)
3)
4)
30,20,50,10,
Quiz 2
CS 261
Summer 2014
Alternate version
Name:_
1) Write down the worst-case computational complexity for removing from the back of a deque using a
linked list with only next pointers, assuming the next pointers point towards the back.
O(n), because yo
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, complete worksheets 14 and 16 to learn more about the
d
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 classs are divided into training set and test set. Use th
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 midterm.
Big-(O):
1. What is the big O notation
CS 261 : Data Structures
Programming Assignment summary:
Programming Assignment 0:
The purpose of this assignment is to get yourself introduced and set up you Integrated
Development Environment (IDE) for C programming and running your first C program usin
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, calibration is aimed at estimating the camera intrinsic an
CS261 Programming Assignment 3
Edited with the trial version of
Foxit Advanced PDF Editor
To remove this notice, visit:
www.foxitsoftware.com/shopping
College of Engineering
CS261
Programming Assignment 3
Linked List Variations
Problem 1: Deque and bag im
Edited with the trial version of
Foxit Advanced PDF Editor
To remove this notice, visit:
www.foxitsoftware.com/shopping
Weekly Schedule Winter 2015
Course: CS261- Data Structures
Credits: 4
Weekly Schedule:
To summarize, the weekly worksheets are due by e
worksheet 28: Binary Search Trees
Name:
Worksheet 28: Binary Search Trees
In Preparation: Read Chapter 8 to learn more about the Bag data type, and chapter 10 to
learn more about the basic features of trees. If you have not done so already, read
Worksheet
Worksheet 26: Ordered Bag using a Sorted Array Name:
Worksheet 26: Ordered Bag using a Sorted Array
In Preparation: Read Chapter 8 to learn more about the Bag data type and Chapter 9 to
learn more about the advantages of ordered collections. If you have n
CS261 Main/Programming Assignment 2
This assignment is comprised of 3 parts:
Part 1: Implementation of Dynamic Array, Stack, and Bag
First, complete the Worksheets 14 (Dynamic Array), 15 (Dynamic Array Amortized Execution Time Analysis), 16
(Dynamic Array
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 structure.
In some applications it is useful to
initializ
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 midterm.
Big-(O):
1. What is the big O notation
worksheet 29: Binary Search Trees
Name:
Worksheet 29: Binary Search Trees
In Preparation: Read Chapter 8 to learn more about the Bag data type, and chapter 10 to
learn more about the basic features of trees. If you have not done so already, read
Worksheet
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 data type. In you have not done so already, complete
Wor
CS556: Final Exam Questions
1. What are the main steps in David Marrs framework of computational vision? What are the key differences between Marrs paradigm and Intrinsic images? 2. Specify the criterion for identifying brightness changes in a pixel neigh
CS 161
C/C+ Programming Style Guideline
Comments
The comments should describe what is happening, what parameters and variables mean, any
restrictions or bugs, etc. Avoid comments that are clear from the code. Dont write comments
that disagree with the cod
Programming Assignment 4
Binary Search Trees
PROGRAMMING
For this assignment, you will implement a binary search tree that can store any arbitrary struct in its nodes.
You will start by completing the recursive implementation of the binary search tree (BS
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 second part, you will use the Priority
Queue to implem
Oregon State University
School of Electrical Engineering and Computer
Science
CS 261 Visual Sudio
Summer 2013
Programming C using Visual Studio
First time you start MSVS
The first time you start
visual studio it will ask
what environment settings
to use