Homework 1
ITCS-2215: Design and Analysis of Algorithms
Due: Thursday, August 29, 2013
Homeworks are due at the beginning of lecture on Thursday, August 29. Late homeworks
will receive no credit. Homeworks are to be done individually and will be graded on

Week 1 Topic Outline - Analysis Framework and Asymptotic notation
1. The Analysis Framework how we analyze the efficiency of algorithms.
a. There are two kinds of efficiency
i. Time Efficiency (Complexity) How fast an algorithm runs
ii. Space Efficiency (

Design and Analysis of Algorithms ITCS 2215
Program Assignment #1
Instructions
The Towers of Hanoi puzzle has n disks of different sizes that can slide onto any of three pegs. Initially, all the disks are
on the first peg in order of size, the largest on

ITCS 2215 Design and Analysis of Algorithms
Homework #2
Chuc Huynh
Answer the four questions below:
ALGORITHM Mystery(n)
/Input: A nonnegative integer n
S0
for i 1 to n do
SS+i*i
return S
1. What does this algorithm compute?
The summation of i^2 from i=1

ITCS 2215 Design and Analysis of Algorithms
Homework #6
1. Write out the algorithm for Stage 2 of the heapsort algorithm using the pseudo code syntax
weve covered in class.
Stage 2(maximum deletions): Apply the root-deletion operation n 1 times to the rem

ITCS-2215 (2015 Fall) Course Project Description
A group project will require students to apply the skills developed in the earlier sessions of the course to
the development of a proposal. Teams will be made up of 1-3 students. Each team will be required

Design and Analysis of Algorithms ITCS 2215
Recursion Practice Problems
Instructions
For the following questions, determine the value returned as a result of the given method call.
1. public static int quest (int x, int y)
cfw_
if (x < y)
return x;
else
r

ITCS 2215 Design and Analysis of Algorithms
Homework #1
Lena Vawter
1. Answer the two questions below. Show you work where applicable:
a. Imagine that after washing 5 distinct pairs of socks, you discover that two socks are
missing! Of course, you would l

Midterm Study Guide
ITCS 2215 Design and Analysis of Algorithms
Your midterm is essentially divided into three (3) sections. Each section tests your knowledge of the material in a
different and increasingly difficult way. The first section is basic knowle

A-Star Notes
Open List- Available moves. Nodes weve discovered but not yet visited. Min Heap.
Closed List- Nodes weve visited and wont return to. Hash Table/dictionary.
For each node, maintain the following pieces of information:
F- The total score for a

Homework 4 Due 11:55PM 05/05/2016
Submit to moodle
Question (1) Use Binary Search to find 5 in a list: 1, 3, 5, 7, 9, 11, 13, 20, 70, 140,290
A list of numbers: 6, 2, 4, 5, 3, 1, 7 will be used in the follow questions (2-7).
Question (2) Bubble Sort
Quest

Chuc Huynh
ITCS 2215 Design and Analysis of Algorithms
Homework #5
Use Breadth-First Search (BFS) to traverse the graph below. Write out each step of your
algorithm including the contents of your queue, adding and removing vertices, and marking
vertices a

Midterm Study Guide
ITCS 2215 Design and Analysis of Algorithms
Your midterm is essentially divided into three (3) sections. Each section tests your knowledge of the material in a
different and increasingly difficult way. The first section is basic knowle

Homework 2
ITCS-2215: Design and Analysis of Algorithms
Due: Tuesday, September 17, 2013
Answers to the rst three questions are due by the beginning of class on Tuesday, September
17. Answers to the last two questions are due by the beginning of class on

Homework 1 Solutions
ITCS-2215: Design and Analysis of Algorithms
Due: Thursday, August 29, 2013
Homeworks are due at the beginning of lecture on Thursday, August 29. Late homeworks
will receive no credit. Homeworks are to be done individually and will be

ITCS-2215: Design and Analysis of Algorithms
Quiz 1
Name:
Student ID:
n
n
(2k 1), given that
1. Evaluate the summation
k=1
k=
k=1
n(n + 1)
.
2
2. Identify whether each statement below is True or False.
(a) Insertion and deletion of items on a Stack follow

ITCS-2215: Design and Analysis
of Algorithms
Fall 2013
Srinivas Akella
Department of Computer Science
University of North Carolina, Charlotte
Acknowledgments: Richard Souvenir
Design and Analysis of Algorithms
ITCS 2215
Instructor: Srinivas Akella
Offic

Chuc Huynh
800785107
ITCS 2215 Design and Analysis of Algorithms
Homework #1
1. Answer the two questions below. Show you work where applicable:
a. Imagine that after washing 5 distinct pairs of socks, you discover that two socks are
missing! Of course, yo

Week 4 Topic Outline - Sorting Algorithms
1
Problem given a list of n orderable items, rearrange them in ascending order.
a Forget everything that you know about sorting algorithms and think for a moment about the most
straightforward method for solving t

Design and Analysis of Algorithms ITCS 2215
Program Assignment #2
Instructions
Write a program that correctly implements both the Quicksort and Mergesort algorithms. The program
should generate an array of 500 random numbers in the 1-100 range. The progra

Final Exam Study Guide
ITCS 2215 Design and Analysis of Algorithms
Your final is essentially divided into three (3) sections. Each section tests your knowledge of the material in a different
and increasingly difficult way. The first section is basic knowl

Week 5 Topic Outline - Searching Algorithms
1
Homework #4 Solution:
2
Exhaustive Search
a Many problems require finding an element with a special property in a given domain which grows
exponentially with each increase in size.
b These problems typically a

Week 3 Topic Outline - Analysis of Recursive Algorithms
Overview of Recursion
What is recursion and when is it used?
Repeat a process until you get it right
Recursion vs. Iteration whatever makes the code more simple or easier to
understand
Traversing

Week 2 Topic Outline - Analysis of Non-recursive Algorithms
Goal to apply the general framework we learned about algorithm efficiency to analyze
the time efficiency of non-recursive algorithms.
Consider the problem of finding the value of the largest elem