Assignment/Homework #1
COP-3530, Summer C 2016
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
Due date: Tuesday, May/31/2016 at 5 p.m. (Eastern Time)
This assignment has 2 problems.
The ass
Assignment/Homework #1
COP-3530, Spring 2016
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
Due date: Wednesday, Jan/27/2016 at 5 p.m. (Eastern Time)
This assignment has 3 problems.
The ass
Assignment/Homework #2
COP-3530, Fall 2015
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
This assignment has 3 problems.
Due date: Saturday, October 3, 2015 at 5 pm (Eastern Time)
The assi
#include <stdlib.h>
#include "bmplib.h"
/*
* This method enlarges a 24-bit, uncompressed .bmp file
* that has been read in using readFile()
*
* original - an array containing the original PIXELs, 3 by
COP 3530
Section U01
Fall 2011
Midterm Exam
INSTRUCTIONS
1. This test is open book, open notebook. You can also use the practice
exams and your programs.
2. You cannot use computers, calculators, or c
COP-3530, Spring 2016, Section: U01
Data Structures, Midterm Exam #1
(proposed solutions)
1. reverseList, shown below, places items in the first list (of the size N) into the second list
in reverse or
Some Problems
on Graphs
(IV)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They
Some Problems
on Graphs
(III)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". The
Some Problems
on Graphs
(II)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They
Problem #1: (15 points)
You have two sorted lists, L1 and L2. You know the lengths of each list, L1 has length N1 and L2 has
length N2.
(a) Design an efficient algorithm (only pseudocode) to output a
Some Problems
on Graphs
(I)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They
Some Problems
on Graphs
(V)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They
Data Structures
and
Problem Solving
Using Java
(Third Edition)
Instructors Resouce Manual
Mark Allen Weiss
3rd ed IRM revised by Tim Herman
Contents
CHAPTER 1
Primitive Java 1
1.1
1.2
1.3
CHAPTER 2
Ke
Assignment/Homework #2
COP-3530, Fall 2017
Rules & Instructions:
Due date: Monday, October 9, 2017 at 1 pm (Eastern Time)
This assignment has 4 problems.
The assignment/homework will be submitted by e
Assignment/Homework #3
COP-3530, Fall 2017
Rules & Instructions:
Due date: Monday, November 6, 2017 at 2:00 pm (Eastern Time)
This assignment has 4 problems.
The assignment/homework will be submitted
Hashing
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for COP
Shortest Paths
&
Dijkstras Algorithm
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Jav
Sorting
(V)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for
Sorting (I)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for
Assignment/Homework #1
COP-3530, Fall 2015
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
This assignment has 3 problems.
Due date: Thursday, September 10th, 2015 at 4 pm (Eastern Time)
The
AVL Trees
(Adelson-Velskii and Landis)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in J
Priority Queues
(Heaps)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are
B-Trees
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for COP
Trees (I)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for C
The Queue ADT
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided f
The Stack ADT
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided f
Algorithm Analysis
(I)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are p
Trees,
Binary Trees and
Binary Search Trees
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis
AVL-Trees
(Adelson-Velskii and Landis)
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in J
Union-Find
Data Structure
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They ar
B-Trees
Dr. Antonio L. Bajuelos
Note: The most of the information of these slides was extracted and adapted from Weisss book, Data
Structures and Algorithm Analysis in Java". They are provided for COP