Problem 1
The design team for a simple, single-issue processor is choosing between a pipelined or
non-pipelined implementation. Here are some design parameters for the two possibilities:
Parameter
Clock Rate
CPI for ALU Instructions
CPI for Control Instru
Problem 1:
Use the register and memory values in the table below for the next questions. Assume a 32-bit machine.
Assume each of the following questions starts from the table values; that is, DO NOT use value changes
from one question as propagating into
1 Addition of two number Its performed n2 times which means once for each of
n2 elements in the matrix being computed .Since the total number of
elements in two given matrices is N = 2n2, the total number of additions
Can also be expressed as n2 = N/2.
2.
Backtracking and branch-and-bound are two algorithm design techniques for solving
problems in which the number of choices grows at least exponentially with their instance
size.
- Both techniques construct a solution one component at a time, trying to
term
Given a class of algorithms for solving a particular problem, a lower bound indicates the
best possible efficiency any algorithm from this class can have.
- A trivial lower bound is based on counting the number of items in the
problems input that must be
UPDATED! 172 Sample Questions
1. When must you signal before making a turn?
At least 100 feet before the intersection
2. How close may you park to a stop sign?
50 feet
3. How close may you park to a corner?
25 feet
4. How close may you park to a fire hydr
CSCI-651 Algorithm Concepts
Graphs
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Graphs
1
Graphs
A graph is a data structure for representing the
many-to-many relationship among the data.
It is a pair (V, E) where
V is
CSCI-651 Algorithm Concepts
Topic: Asymptotic Notations
Sandra Kopecky
Department of Computer Science New York Institute of Technology
1
Asymptotic Notations
Computational Complexity Analysis
of Algorithms
2
Asymptotic Notations
Analysis of Algorithms
The
Binary Searching Complexity
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
1
Sequential Search
2
Binary Search
3
Binary Search
4
CSCI-651 Algorithm Concepts
Priority Queue Tree, Heap (Tree), Splay Tree
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
1
Priority Queues
A priority (queue) tree is a completed
binary tree with the following
properties:
1.
CSCI-651 Algorithm Concepts
Lecture Topic: Queues
Sandra Kopecky
Department of Computer Science New York Institute of Technology
1
Lecture Topic: Queues
Introduction
Queue: a first-in-first-out (FIFO) data structure
The first item into the queue is the fi
CSCI-651: Algorithm Concepts
Final - Review
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Linked List
Adding
Inserting
Deleting
Linked List (continued)
Understand the step by step process:
Adding:
Adds an element aft
CSCI-651 : Algorithm Concepts
Lecture #2 : Stacks
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Lecture #2
1
What is a Stack?
Stack is a special type of linked list data structure
in which data is added and removed at one
CSCI-651 Algorithm Concepts
Sorting
Sandra Kopecky
Department of Computer Science - New York Institute of Technology
1
Sorting
What is Sorting?
Sorting is an operation that segregates items into
groups according to specified criteria
Before sorted:
A = cf
New York Institute of Technology
School of Engineering and Technology
Department of Computer Science
Manhattan Campus
CSCI-651-M02 Algorithm Concepts
Course Catalog Description :
Abstract Data Structures are reviewed. The course covers the study of both t
CSCI-651 ALGORITHM CONCEPTS
HASHING
1
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
HASHING
Definition:
Hashing is a technique that provides faster search
results.
Balanced search trees guarantee (log2 n) search
path by co
1
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Lecture #1
CSCI-651 : ALGORITHM CONCEPTS
LECTURE #1
INTRODUCTION
LISTS
INTRODUCTION
About me
Syllabus
Course Definition
Objectives
Outcomes
Classes
Grading
Contact Inf
1
CSCI-651 Algorithm Concepts
Topic: Trees
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Topic: Trees
2
Topic: Trees
Definitions
A tree is a non-linear structure with a unique
starting node (root), in which each node is
c
Decrease-and-conquer is a general algorithm design technique, based on exploiting a
relationship between a solution to a given instance of a problem and a solution to a
smaller instance of the same problem.
- Once such a relationship is established, it ca
Divide-and-conquer is a general algorithm design technique that solves a problem by
dividing it into several smaller subproblems of the same type (ideally, of about equal
size), solving each of them recursively, and then combining their solutions to get a
There are two kinds of algorithm efficiency: time efficiency and space efficiency.
- Time efficiency indicates how fast the algorithm runs; space efficiency deals
with the extra space it requires.
An algorithms time efficiency is principally measured as a
Assignment 3
Submit the assignment as the attachment to the blackboard by 10/9/2012 2:20pm
The file name must be hw2_lastName_firstLetterOfFirstName (e.g., hw2_gu_h is my
file name for the assignment 2.)
Grade: 2% of the final grade
o On time submission a
Assignment 2
Submit the assignment as the attachment to the blackboard by 10/4/2012 2:20pm
The file name must be hw2_lastName_firstLetterOfFirstName (e.g., hw2_gu_h is my
file name for the assignment 2.)
Grade: 3% of the final grade
o On time submission
CSCI335 Assignment 1
Submit the assignment as the attachment to the blackboard by 9/25/2012 2:20pm
The file name must be hw1_lastName_firstLetterOfFirstName (e.g., hw1_gu_h is my
file name for the assignment 1.)
Grade: 3% of the final grade
o On time subm
Problem 1
Consider two different implementations, M1 and M2, of the same instruction set. There are three
classes of instructions (A, B, and C) in the instruction set. M1 has a clock rate of 80 MHz and
M2 has a clock rate of 100 MHz. The average number of
Convert -1313.3125 to IEEE 32-bit floating point format.
a. The integral part is 131310 = 101001000012. The fractional:
0.3125 2 = 0.625 0 Generate 0 and continue.
0.625 2 = 1.25 1 Generate 1 and continue with the rest.
0.25 2 = 0.5
0 Generate 0 and conti
Introduction
VHDL stands for VHSIC (Very High Speed Integrated Circuits) Hardware
Description Language.
In the mid-1980s the U.S. Department of Defense and the IEEE
sponsored the development of this hardware description language with the
goal to develop
Numbers
The default number representation is the decimal system. VHDL allows integer
literals and real literals. Integer literals consist of whole numbers without a
decimal point, while real literals always include a decimal point. Exponential
notation i
Problem 1:
Assume a 32-bit machine. What is the content of each register and which memory locations are changed
as the code below is executed. Use the register and memory values in the table below as initial values.
Register
R1
R2
R3
R4
Value
8
4
12
24
Me
Problem 1
Consider two different implementations, M1 and M2, of the same instruction set. There are three classes
of instructions (A, B, and C) in the instruction set. M1 has a clock rate of 80 MHz and M2 has a clock rate
of 100 MHz. The average number of
CSCI-651 Algorithm Concepts
Topic: Huffman Coding
Sandra Kopecky
Department of Computer Science
New York Institute of Technology
Huffman Coding
Proposed by Dr. David A. Huffman in 1952
A Method for the Construction of Minimum
Redundancy Codes
It is a d