Assignment/Homework #1
COP3530, 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 assignment/homework will be submitted by email to abajuelo
Assignment/Homework #2
COP3530, 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 assignment/homework will be submitted by email to abajuelo@
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 cellphones.
3. If you need to use the bathroom, do it be
Algorithm Analysis
Examples Notes
Instructor: Dr. Antonio L. Bajuelos
Fibonnaci Numbers: Recursion vs Iteration?
Recursive Approach:
public static long fib( int n )
cfw_
if( n <= 2 )
return 1;
else
return fib( n  1 ) + fib( n  2 );
But while Elegant,
Algorithm Analysis
Examples
Instructor: Dr. Antonio L. Bajuelos
Algorithm Analysis. Example #1
1
Algorithm Analysis. Example #2
Algorithm Analysis. Example #3
The first line is O(1).
The for loop is repeated n times.
The third line takes O(1).
The tot
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 provided for COP3530 students only. Not to be
published
Algorithm Analysis (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 are provided for COP3530 students only. Not to be
published
The List 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 for COP3530 students only. Not to be
published or publicl
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 for COP3530 students only. Not to be
published or public
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 for COP3530 students only. Not to be
published or public
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 COP3530 students only. Not to be
published or publicly d
BTrees
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 COP3530 students only. Not to be
published or publicly dis
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 provided for COP3530 students only. Not to be
published
AVL Trees
(AdelsonVelskii 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 Java". They are provided for COP3530 students only. Not
Assignment/Homework #1
COP3530, 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 assignment/homework will be submitted by email to abaj
STACKS  DEFINITION
A stack is a LIFO list i.e.
Addition and removal takes place only at one end,
called the top
STACK  MAIN OPERATIONS
push(x): add an item on the top
pop: remove the item at the top
peek: return the item at the top (without removin
Sorting (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 are provided for COP3530 students only. Not to be
published or publicl
a+b*c+(d*e+f)*g
Next a * is read. The top entry on the operator stack has lower precedence than *, so
nothing is output and * is put on the stack.
a+b*c+(d*e+f)*g
a+b*c+(d*e+f)*g
a+b*c+(d*e+f)*g
a+b*c+(d*e+f)*g
The next symbol is a +. Checking the stack,
COP3530, Spring 2016, Section: U01
Data Structures, Midterm Exam #2
(proposed solutions)
1. Insert the following keys to a Btree of order 5:
cfw_3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35, 56
Solution:
2.
(a) Fill in the contents of the
Assignment/Homework #4
COP 3530, Fall 2015
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
Due date: Monday, Nov/23/2015 at 10 p.m. (Eastern Time)
This assignment has 2 problems.
The assignment/homework will be submitted by email to abajuelo@fiu
DataDefinition
Th
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
CREATETABLE:
Newbaserelationbygivingitaname,andspecifyingeachofitsattributesandtheirdata
types.
NOTNULLisaconstraint.
Example:
CREATE TABLE DEPARTMENT
( DNAME
VARCHAR(10)
NO
Assignment/Homework #1
COP3530, 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 assignment/homework will be submitted by email to
Your sub
COP3530, 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 order.
public void reverseList( List original, List rever
Assignment/Homework #2
COP3530, Summer 2015
Instructor: Dr. Antonio L. Bajuelos
Rules & Instructions:
This assignment has 3 problems.
Due date: Wednesday, June 10th, 2015 at 8 pm (Eastern Time)
The assignment/homework will be submitted by email to abajue
README
What Is This?

This is a program on C language that simulates a card game. It generates a deck of 52 card, display it to the players. After that, it shuffles the cards and display then again. Then it deals the desired cards to players and show th
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools  Templates
* and open the template in the editor.
*/
/*
* File:
main.c
* Author: lazaroalvarez
*
* Created on February 6, 2016,
/*Homework # 2
Description:
constant e.
Program to compute and print the value of the mathematical
Author: Pedro Ramos
PI # 5727447
Due Date: 02/09/2016
Certification:
I hereby certify that this work is my own and none of it is work of any other
person.
P
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 COP3530 students only. Not to be
published or publicly
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 COP3530 students only. Not to be
published or publicly dis