CS 202 Fundamental Structures of Computer Sciences II
Assignment 1 Algorithm Analysis, Sorting and Searching
Due Date: March 4, 2011 (Friday), 18:00
Question 1 (15 Points)
Trace each of the following sorting
1. FUNCTIONAL DESCRIPTION
The whole process of program is executed in the following code. DISPLAY_INFO is the only
part that provides the execution of other subroutines.
;R0=Minute
;R1=Second
;R2=Current temp
;R3=Target temp 4
;R4=Target min
;*DISPLAY_INF
28-07-2010
BILKENT UNIVERSITY
EEE212 Microprocessors 2010 Summer Semester
Final
Open TextBook Closed Notes, Calculators Allowed
Use the boxes provided for your answers!
Use comments for readability,
otherwise the
programs will be partially graded!
Duratio
30-07-2009
BILKENT UNIVERSITY
Electrical and Electronics Engineering Dept.
2009 Summer Semester
EEE212 Microprocessors Final Exam
Open TextBook Calculators Allowed
Use comments for readability, otherwise the
programs will be partially graded!
Duration: 2
18/05/2010
BILKENT UNIVERSITY
EEE212 Microprocessors
Sections 1 - 5
Final Exam
Open TextBook Closed Noted, No Calculators
Use the boxes provided for your answers!
Use comments for readability,
otherwise the
programs will be partially graded!
Duration: 2 h
21/04/2011
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1-6
Midterm 2
Open TextBook Closed Everything Else including
Lecture Notes, No Calculators
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Otherwise, the program
13/07/2011
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1&2
Midterm 2
Open Textbook Closed Everything Else including
Lecture Notes, No Calculators, No Cellular Phones
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Ot
2011 Spring
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1-6
Midterm 2
Open TextBook Closed Everything Else including
Lecture Notes, No Calculators
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Otherwise, the progra
24/06/2011
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1&2
Midterm 1
Open TextBook Closed Everything Else including
Lecture Notes, No Calculators
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Otherwise, the program
06/03/2011
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1-6
Midterm 1
Open TextBook Closed Everything Else including
Lecture Notes, No Calculators
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Otherwise, the program
1) Consider an 8051 with a machine cycle of 1 microsecond (s). As shown in the figure
below, a square wave is connected to P3.2 (INT0 pin). Complete the following assembly
language program using only the External-0 interrupt (you are NOT allowed to use an
Analysis of Algorithms
Introduction and the Asymptotic Notation
c 2011 Aybar C. Acar & Cidem Gndz Demir
g
uu
Compiled on: February 6, 2011
Analysis of Algorithms
Introduction
Analysis of Algorithms
The theoretical study of the time and resource usage of a
Q1. (b) Assume that there is an unsigned number stored in register A. Write an assembly
language subroutine to test if the number in A is divisible by 4 without using the DIV AB
instruction. If it is divisible, set R1 to 1, otherwise set R1 to 0.
DIVFOUR:
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ 4 - SOLUTIONS
14-05-2010
Section 5
OPEN BOOK, CLOSED NOTES, NO CALCULATORS
Duration: 40 minutes
Surname
:
Name
:
ID Number
:
Section
:
Signature
:
Question
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ 4 - SOLUTIONS
03-05-2010
Section 1
OPEN BOOK, CLOSED NOTES, NO CALCULATORS
Duration: 40 minutes
Surname
:
Name
:
ID Number
:
Section
:
Signature
:
Question
26-12-2007 10:40
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ-4 closed book
Duration: 40 minutes
Surname:_
Q1 ( 100 points)
Name:_
ID-Number:_
SECTION: _1_
Signature:_
Q1) We need to interface several
12-07-2009 Fall Semester
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ-3
open book, closed notes, calculators allowed
Duration: 30 minutes
Surname:_
Q1 (40 points)
Name:_
Q2 (60 points)
ID-Number:_
TOT
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ 3 - SOLUTIONS
21-04-2010
Section 1
OPEN BOOK, CLOSED NOTES, NO CALCULATORS
Duration: 40 minutes
Surname
:
Name
:
ID Number
:
Section
:
Signature
:
Question
04-07-2007
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ-3 open book
Duration: 50 minutes
Surname:_
Name:_
ID-Number:_
SECTION: _2_
Signature:_
Q1) Write an 8051 program using polling to continually tr
7-11-2007
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ-2 open book
Duration: 45 minutes
Surname:_
Q1 ( 80 points)
Name:_
Q2 ( 20 points)
ID-Number:_
TOTAL
SECTION: _1_
Signature:_
1) (80 pts) Write an
16-11-2007
BILKENT UNIVERSITY
Electrical and Electronics Engineering Dept.
EEE212 Microprocessors Midterm
Open TextBook No Calculators
Use the boxes provided for your answers!
Use comments for readability, otherwise the
programs will be partially graded!
25/05/2011
BILKENT UNIVERSITY
EEE212 Microprocessors Sections 1-6
Final Exam
Open TextBook Closed Everything Else including
Lecture Notes, No Calculators
USE THE BOXES ONLY FOR YOUR ANSWERS!
Use comments for readability in your code!
Otherwise, the progra
BILKENT UNIVERSITY
Mathematics Department
Math225
Linear Algebra and Differential equations
Spring Semester 2010-2011
FIFTH HOMEWORK ASSIGNMENT
Due Date: May 4, 2011 (for Sections 1,3 and 4)
May 5, 2011 (for Section 2).
IMPORTANT
Homework must be turned
Tables
Appropriate for problems that must manage data by value.
Some important opera9ons of tables:
An ordinary table of ci2es
Inser9ng a data item containing the value x.
Delete a data item containing the value
CS 202 Fundamental Structures of Computer Sciences II
Assignment 5 Hashing and Graphs
Due Date: 23:59 May 22nd, 2011 (Sunday)
Question 1 (20 Points) Hash Tables
Consider inserting the keys 36, 18, 71, 3, 146
CS 202 Fundamental Structures of Computer Sciences II
Assignment 3 Heap and AVL Trees
Due Date: April 21, 2011 (Thursday)
Question 1 (15 Points) Heaps
a) (5 points) Given an array implementation of a heap,
23 Trees
Deni'on:
A 23 tree is a tree in which each internal
node has either two or three children, and all
leaves are at the same level.
2node: a node with two children
3node: a node with three childr