/Calculate diameter, area and circumference
import java.util.Scanner;
public class circle cfw_
public static void main( String args[])cfw_
Scanner input = new Scanner ( System. in ) ;
double radius; /radius
System.out.print( Enter a radius: ) ; /prompt fo
COSC 3331 Data Structures and Algorithms
Homework 2
Due Date 2/26/2017 11:59pm
1. Use the formal definitions of Big O (not the Limit Rule) to
establish the following statements. In each case you need to
specific values of the constants (e.g., c1, c2, n0)
COSC 3331 DS & Algorithms
hw3
Homework 3
Due Date 4/9/17 11:59pm
1. Assume the following declarations (which are used to process singly-linked lists)
static class Node
cfw_
public int data;
public Node next;
;
And the following statemens have been execute
Questions: Part 1
Q1: For multiple appearing value, could the 2nd same value (in my case, it is 107) being found?
- It states that an additional item has been found and it gives the index number
Q2: What is the operation process for that, describe the who
COSC 3331
Lab 2
Part 1:
Q1: What are the meanings of the blue arrow and the red arrow, corresponding to the bubble
algorithm shown on page 86?
The blue arrows signify the inner & inner +1, it shows how it sorts and swaps the columns in
the array, similar
COSC 3331 Data Structures and Algorithms I
Danielle Hughes 1
Lab 2 Simple Sorting Algorithms
Due Date: 2/21/16 11:59pm
Submission: Include all the answers and screen shots into a single WORD document.
Part I: Answer the questions:
Q1: What are the meaning
COSC 3331 Data Structures and Algorithms I
Danielle Hughes 1
Lab 1 Array Applets
2/7/2016 11:59pm
Submission: Include all the answers and screen shots into a single WORD document.
Part I: Answer the questions:
Q1: For multiple appearing value, could the 2
Danielle Hughes
Homework 1
Due: February 1, 2016 @ 11:59 PM
Part a Lab 1 (points 40)
CLIENT HARDWARE
Our personal computer hardware works as a Client computer. Computer hardware
is the collection of physical parts of a computer system. This includes the m
Danielle Hughes
COSC3325 / Monday / 7pm-9:45pm
Assignment 1: Chapter 1
Questions:
Bank of
America
Wells
Fargo
Brazos Valley
Schools
Credit Union
Capitol One
USAA
E-Banking
Tools:
Deposits,
Transfers, Check
Balances, Make
Payments/Bill
Pay, Mobile
Banking/
Danielle Hughes
Homework 2
5October2015
1.
a. xyz + xyz + xyz + xyz
b. xyz + xyz + xyz + xyz
2.
a.
i. abef + cef + deff ; distributive
ii. abef + cef + def ; idempotent
iii. abe + ce + def ; idempotent
iv. ab +cd + ef
b.
i. x ; absorption law
c.
i. xy + w
Name:_
COSC 3331
Data Structures and Algorithms
Midterm Exam: Covers Chapters 5 7
University of Houston Victoria
Due Date, 12/09/2015, 11:59pm
Instructor: Ying Qiao
Q1(30 points)
Here are two linked lists, list a and list b. Each node has the students nam
COSC3331 DS & Algorithms
Dr. Zhu
Homework 1 solution
1.
a) 25 e0.7t-1 * e0.3t+2 = 50, what value is t approximately (show the steps)?
Answer:
a)
We first isolate the exponential part by dividing both sides of the equation by 25.
e0.7t-1+(0.3t+2) = 2,
et+1
COSC 3331 Data Structures and Algorithms I
Lab3
Lab 3 Stacks and Queues
Submission: Include all the answers and screen shots into a single WORD document.
Part I: Answer the questions:
Q1: What is the initial value of Top?
Answer:
Top = -1
Q2: What is the
COSC 3331 Data Structures and Algorithms
Dr. Zhu
Homework 2 Solution
1. Use the formal definitions (not the Limit Rule) to establish
the following. In each case state specific values of the
constants (e.g., c1, c2, n0) you used to satisfy the conditions,
COSC 3331 Data Structures and Algorithms I
Dr. Zhu 1
Lab 1 Array Applets (Answers)
Submission: Include all the answers and screen shots into a single WORD document.
Part I: Answer the questions:
Q1: For multiple appearing value, could the 2nd same value (
COSC 3331 Data Structures and Algorithms
Homework 4
Due: 4/30/17 11:59pm
1. Show the steps in order to sort cfw_11,5,6,3,8,1,9,2 using
Mergesort algorithm.
First we split cfw_11, 5, 6, 3, 8, 1, 9, 2
Then we split cfw_11, 5, 6, 3
Then we split cfw_11, 5
Th
COSC3331 DS & Algorithms
Dr. Zhu
Homework 1
Due Date 1/29/17 11:59pm
1.
a) 25 e0.7t-1 * e0.3t+2 = 50, what value is t approximately (show the steps)?
25e^(0.7t-1+0.3t+2)/25 = 50/25
e^0.7t-1+0.3t+2 = 2
ln (e^0.7t -1+0.3t+2) = ln (2)
= 1 (t+1)
t +1 = ln (2)
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Review
Algorithm Analysis
Time and space
Model
General Rules
Asymptotic Notation
Comparisons of Functions
2
Chapter3: Simple Sorting
How would you do it?
Bubble sort
Selec
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Prerequisites
The formal prerequisite is COSC 3317, primarily a
course in Java
If you did not take COSC 3317
You must be a reasonably good Java programmer,
including progr
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Review: Arrays
Data Types
Primitive Data Types in Java
Operators and Methods
Abstract Data Types
Class in Java
Arrays in Java
The Basic of Arrays in Java
Sorted Array
2
Ov
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Review: Overview
What are data structures and algorithms good for?
Data structures
array, stack, queue, tree, list
Algorithms
Real-World Data Storage
Programmers Tools
Rea
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Review: Java
Problems with Procedural Languages
Poor modeling of the real world
Crude organizational units
Objects in a Nutshell
Object is a solution to the problem with p
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying
Qiao
Review: Simple Sorting
How would you do it?
Bubble sort
Selection sort
Insertion sort
Sorting objects
Comparing the simple sorts
2
Stacks and Queues
A Different Kind of St
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Review: Stacks and
Queues
A Different Kind of Structure
Stacks
Queues
Priority Queues
Parsing Arithmetic Expressions
2
Overview
Postfix Notation (Reverse Polish
Notation)
COSC 3331 Data Structures
and Algorithms I
Department of Computer
Science
Ying Qiao
Midterm Test
Time
10/15 12:01am, 2015 on blackboard
10/21 11:59pm, 2015 due date
Format
Take home test
Content
Chapters 1 to 4
2
Midterm Test
Exam Content
Q1: Algorith
Kenneth Baxter
COSC 3331 Data Structures And Algorithms
Professor Qiao
11/10/2015
Homework 3
Due Date 11/09/15 11:59pm
1. Assume the following declarations (which are used to process singly-linked lists)
static class Node
cfw_
public int data;
public Node
Kenneth Baxter
COSC 3331 Data Structures and Algorithms
December 1, 2015
Homework #4
Due 11/30/2015 11:59 PM
1) Show the order of the steps to sort cfw_11, 5, 6, 3, 8, 1, 9, 2 using MergeSort Algorithm.
Kenneth Baxter
COSC 3331 Data Structures and Algorit
COSC 3331 Data Structures and Algorithms I
Dr. Zhu 1
Lab 5 Recursion Solution
Submission: Include all the answers and screen shots into a single WORD document.
(Due at the end of the class)
Part I: Answer the questions:
Q1: How many moves you need for 3 d
COSC 3331 Data Structures and Algorithms I
Dr. Zhu 1
Lab 4 Linked List - Solution
Submission: Include all the answers and screen shots into a single WORD document.
(Due at the end of the class)
Part I: Answer the questions:
Q1: Which end it uses to insert
COSC 3331 DS & Algorithms
hw3
Homework 3 Solution
1. Assume the following declarations (which are used to process singly-linked lists)
static class Node
cfw_
public int data;
public Node next;
;
And the following statemens have been executed,
Node p1, p2,
COSC 3331 Data Structures and Algorithms I
Dr. Zhu 1
Lab 2 Simple Sorting Algorithms
Submission: Include all the answers and screen shots into a single WORD document.
Part I: Answer the questions:
Q1: What are the meanings of the blue arrow and the red ar