CSE240 Spring 2010, HW 3 Solutions!
Due Date: March 22
Problems 1, 2, and 3 are worth 15 points each (5 points per subproblem). Problems 4 and 5 are worth
30 points each (10 points per subproblem), for a total of 105 points possible.
1. The following are
CSE 480/CIS 700
OS Overview Real-Time Scheduling
Insup Lee
Department of Computer and Information Science
University of Pennsylvania
Fall 2006
Real-Time Systems
Definition
Systems whose correctness depends on their temporal
aspects as well as their func
An overview of soft real-time wireless
communication for Sensor Networks
Marco Caccamo
1
Outline
2
Wireless LANs background
Enforce priorities with CSMA/CA access
Speed routing protocol
Real-time chains
Motivations
New generations of wireless technologie
RT-QoS for Wireless ad-hoc Networks of
Embedded Systems
Marco Caccamo
University of Illinois
Urbana-Champaign
1
Outline
Wireless RT-QoS: important MAC attributes and faced challenges
Some new ideas and results for embedded systems:
Implicit contention & R
Real-Time Operating Systems
With Example PICOS18
Sebastian Fischmeister
1
What is an Operating System?
A program that acts as an intermediary between a user
of a computer and the computer hardware
Operating system goals:
o Execute user programs and make
MAC
A Run Time monitoring
and checking tool
Gursharan Singh
Mohd. Salman Mehmood
Agenda
Motivation
Software Development
Steps
Methods
New Paradigm (Runtime Verification)
Materializing Runtime Verification (MAC)
Real Time Java
Extending MAC
The road ahead
Computer Engineering
Introduction to
Field
Programmable
Gate
Arrays
Robert Trausmuth
Wiener Neustadt University of Applied Sciences
Summer 2006
Wiener Neustadt University of Applied Sciences, Austria
Computer Engineering
Robert Trausmuth
email: robert.tr
Brief tour of Real-Time Embedded Networks
Luis Almeida
Brief tour of
Real-Time Embedded Networks
Lus Almeida
lda@det.ua.pt
Electronic Systems Lab-IEETA / DET
Universidade de Aveiro
Aveiro, Portugal
Brief tour of Real-Time Embedded Networks
Luis Almeida
System and Language Support
for Timing Constraints
Sebastian Fischmeister
sfischme@seas.upenn.edu
Department of Computer and Information Science
University of Pennsylvania
1
Goals
Understand different concepts about temporal
constraints.
Understand how
AADL
Louise Avila
Marcus Chou
Taehyun Kim
11/9/2006
AADL Overview
Architecture Analysis and Design
Language
Models software and execution platform
architectures of performance critical,
embedded, real-time systems
Standard way to describe systems
compon
Resource-bound process algebras for
Schedulability and Performance Analysis of
Real-Time and Embedded Systems
Insup Lee1, Oleg Sokolsky1, Anna Philippou2
1 SDRL
(Systems Design Research Lab)
RTG (Real-Time Systems Group)
Department of Computer and Informa
Introduction to Programming
Embedded Systems
Sebastian Fischmeister
sfischme@seas.upenn.edu
Department of Computer and Information Science
University of Pennsylvania
1
Goals
Rough understanding of the underlying hardware.
Understand how to develop softw
D P F 3Q V D 3 3Q
%aaaEi4~1y1&VGF8Xa"52" `t g
3Q 3 f5q D w 5 Y FQA V H SA 5 3 V 39Tx D1 pFQ S5 D P H5 3A D1A P
G&9E4&1`4aU32W&H4Qau@&9Fyy@4&Qt3f4Gvi48XSEcfw_4~1HE@&FCE&5&D4Cu41
P1 Dw 5 3 V HQ F 3Axf V T H D5 D 5 3
4e&1G@&9uxFu4uyU1&VCGGF@F&VsW4g" egtaa
Homework 11 Solutions
Problem 1 Solution: Both algorithms work if some edges have negative
weight edges. Their correctness is not aected by the negative weight edges.
In Kruskal's algorithm the safe edge added to A (subset of a MST) is always
a least weig
Homework 7
row mny its do you need to store the size nd height of the trees in the nion
pind dt struturec qive your nswer for dierent implementtions @eFgFD ritrry unionsD unions
y sizeD union y heightD pth ompression etFAF
he size for every implementtion
Solutions for Homework 2
ou hve seen the implementtion of stk using n rryF sn
the implementtion shown in lssD you dd the rst element t position HD next element t position
ID etF ou lwys dd nd delete elements from the end of the listF gonsider n rry of siz
Solutions for Homework 6
qive n
@ A lgorithmF
Solution: gonsider the representtion of integers in seE F en integer
requires logn CI digits in seE representtionF sn se tht a 2D
the ove formul gives logn 2 C I a Q digitsF
e n use rdixEsort on this represent
Solutions for Homework 5
Consider a generalization of the binary heap structure. Every
node has children. It is an almost complete,d-ary tre, and a node must be
less than or equal to all its children. Design an array representation of the
heap. Design a D
Homework 3 Solutions
enlyze the reorder rverslF ou hve list of n rel numersD nd you wnt to
form inry serh tree with themF ht is the tree formtion omplexityc ould your nswer
hngeD if s tell you tht when your tree hs k nodes then its depth vries from tht of
Solutions for Homework 4
Problem 1: 8 pts Design an algorithm for deletion in an AVL tree (lazy
deletion not allowed). You have to maintain the AVL property after deletion.
Deletion in AVL trees while maintaining the AVL property is somewhat
more complica
CSE399 Spring 2008 PRACTICE Exam
Name:
By signing below I swear or arm that all answers I give on this exam represent my own
individual knowledge and eort. I will neither receive nor give any improper help to other
students during the adminsitration of th
CSE399 Spring 2008 PRACTICE Exam
SOLUTIONS
Name:
By signing below I swear or arm that all answers I give on this exam represent my own
individual knowledge and eort. I will neither receive nor give any improper help to other
students during the adminsitra
Homework Assignment 2
CSE 399 C+, Spring 2008
SOLUTIONS
Name:
Due: Wednesday, Jan 30th at noon.
Assumptions: For all of these problems you may assume the following
sizeof(int) = 4; sizeof(short) = 2; sizeof(char) = 1; all pointers require 4 bytes
The st
Solutions for Midterm Practice Questions
sn the rst stepD the list is prtitioned with element
Q s the pivot elementF he result is one list e with I P H S nd nother
list f with W S R S T PI QF he two sulists re sorted y reursive lls to
quiksortF vist e giv
CSE220: Midterm Exam Solution
Instuctor: Saswati Sarkar
Problem 1 (6pts)
There can be many heaps from the given inputs.
2 = O(n3 pn) is True
Problem 2 (4pts)
n
1 = O(log n) is True
3
2
n = o(n + nlog n) is False
n
p log = ( ) is True
n
n
on
Problem 3 (10p
CSE220: Midterm Exam
Instructor: Saswati Sarkar
Friday, March 9 2001
Your answers should be brief and to the point. If you think you are
having diculty, don't panic. Move to another problem and do your best.
Good luck!
Problem 1: 6 pts Construct a binary
CSE220: Midterm Practice Questions
Instructor: Saswati Sarkar
Exam Rules: You can bring an A4 page of formulas, algorithms, or
whatever else you would like to remember with you. Everything there should
be in your own hand-writing.
Problem 1 Consider the l
Homework 11 Solutions
Problem 1 Solution: Both algorithms work if some edges have negative
weight edges. Their correctness is not aected by the negative weight edges.
In Kruskal's algorithm the safe edge added to A (subset of a MST) is always
a least weig