CSCI 4168 Assignment
Objectives: To develop basic skills in using Unity3D.
Due Date: October 12th, 11:59pm
Hand in: Electronic submission of Unity Project folder. Please zip up your entire project folder and
submit using dal.ca/brightspace. Include a read
CSCI 4126 Ubiquitous Computing
Report Grading Sheet
Total /20
Student:
Topic:
Use of references: /5
ACM citation style used for references, multiple (minimum 3) academic references
taken from relevant sources (e.g. from the textbook citations, Appendix A
Chapter 3
Transport Layer
A note on the use of these ppt slides:
Were making these slides freely available to all (faculty, students, readers).
Theyre in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one
Chapter 3
Transport Layer
A note on the use of these ppt slides:
Were making these slides freely available to all (faculty, students, readers).
Theyre in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one
Chapter 3
Transport Layer
A note on the use of these ppt slides:
Were making these slides freely available to all (faculty, students, readers).
Theyre in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one
Chapter 3
Transport Layer
A note on the use of these ppt slides:
Were making these slides freely available to all (faculty, students, readers).
Theyre in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one
CSCI 1108
Introduction to
Experimental Robotics
Robotics Overview
Aseba Intro
What is a Robotics
"Robotics is the science of perceiving and
manipulating the physical world through
computer-controlled devices"
Probabilistic Robotics
S. Thrun, W. Burg
Building Your
IMAGE: JEFMENGUIN.COM
A TUTORIAL GUIDE FOR CSCI1108 PROJECT TEAMS
PREPA RED BY SUSA N HOLMES, PROFESSOR
DA LHOUSIE UNIVERSITY
JANUARY 2016
UPDATED BY ALEX BRODSKY, AUGUST 2016
Dalhousie President, Richard Florizone:
Nobody achieves much of
CSCI 1108
Introduction to
Experimental Robotics
Software environments for robotics
and
Simulator
Aseba Studio
https:/aseba.wikidot.com/en:thymioapi
Android Based Robotics
Nicolas Oros, Jeffrey Kritchmar
https:/youtu.be/2czndpV6pWw
Robotics Software Envi
The robotics competition is an obstacle course that consists of one black tape line
path and stacked duplex walls placed on that path. The course takes place on a
1.8m x 0.9 meter table.
The challenges were making the robot follow the line, avoid hurdles
CSCI 1108
Introduction to
Experimental Robotics
Intro to the course format
Robotics Examples
My video collection:
Asimo https:/www.youtube.com/watch?v=OvgLJTpoVc0
Boston Dynamic Big Dog: https:/www.youtube.com/watch?v=QDl6_V697mk
Starfish https:/www.yout
CSCI 3171 ASSIGNMENT-4
Q1:
Problem-10:
a)
Prefix Match
11100000 00
11100000 01000000
1110000
11100001 1
otherwise
b)
Link Interface
0
1
2
3
3
Prefix match for first address is 5th entry: link interface 3
Prefix match for second address is 3nd entry
CSCI 3171 A1 2016 Winter
1. Questions from the problem section of the book for Chapter-1:
Problem 9
a) 10,000
M
M
b) p n (1 p )M n
n = N +1 n
Problem 10
The first end system requires L/R1 to transmit the packet onto the firs
3171 WINTER 2016
SOLUTIONS FOR ASSIGNMENT -2
QUESTION-1:
Problem 9
a) The time to transmit an object of size L over a link or rate R is L/R. The average time
is the average size of the object divided by R:
= (850,000 bits)/(15,000,000 bits/sec) = .0567 s
CSCI 3110 Algorithms I
Summer 2016, Dalhousie University
Course website: http:/web.cs.dal.ca/~mhe/csci3110/
Students are responsible for checking announcements posted on the course web page for
assignment clarifications, course updates and other informati
Lecture 5, CSCI 3110
Solution 2: Sort the n numbers, and then we walk through the sorted array, comparing each element with
the one immediately to its right. If we find any element that is equal to the element immediately to its
right, then we have found
Lecture 1, CSCI 3110
Today I first handed out a course information sheet, and gave an introduction to this course.
RAM, Algorithm Analysis and Order Notation
At the beginning of this course, let us learn some basic stuff about algorithm analysis.
Pseudoco
Lecture 9, CSCI 3110
Some experimental studies showed that Karatsuba's algorithm outperforms the pencil-and-paper
algorithm when n exceeds a certain threshold between 320 and 640. Thus it is good for very large
integers, which are often used in math, stat
Lecture 10, CSCI 3110
To design a better solution, we use divide and conquer.
DIVIDE: We split P into two subsets PL and PR of approximately equal size. That is, |PL| = |P|/2, and |
PR| = |P|/2. This can be done by sorting points by x-coordinate, and spli
Lecture 17, CSCI 3110
So far we have shown that the above randomized algorithm uses O(n) expected time, which is efficient.
There are however some issues with this solution. First, this solution is not robust: If there is no majority
element, then it will
Lecture 4, CSCI 3110
Solution 2
To improve the running time, we observe that in the previous solution, we perform a lot of recomputation
in the innermost loop. For the example given before, to computer the sum of the subarray x[3.5], we do a
loop to get t
Lecture 2, CSCI 3110
Analysis of Insertion Sort
To analyze algorithms in RAM, we first need understand that the running time of an algorithm is
expressed as a function of its input size. This is because the running time of an algorithm normally grows
when
Lecture 15, CSCI 3110
Making Change
In this problem, we are given an amount in cents. We are to make change using a system of
denominations, using the smallest number of coins possible to make change.
Canadian Coinage System (including pennies) and Greedy
Lecture 14, CSCI 3110
Our previous algorithm computes the optimal cost of multiplying the given matrix chain. How do we
multiply the matrices optimally? This can be done using recursion.
Say, we wish to multiply MiMi+1.Mj optimally, if we know k, then we
Lecture 16, CSCI 3110
Finck analyzed this algorithm in 1841. He proved the following theorem: Euclid's algorithm uses O(lg v)
steps on input (u, v), where u > v > 0.
Proof. Consider replacing (u, v) by (u, r), where r = u mod v. There are three cases.
Cas
Lecture 12, CSCI 3110
Pseudocode of the greedy algorithm:
Activity_Selection(s, f, n)
sort both s and f by f[i] in increasing order
A cfw_1
k 1
for i 2 to n do
if s[i] >= f[k] then
A A cfw_i
k i
return A
The time complexity is O(n lg n).
Knapsack Problem
Lecture 13, CSCI 3110
Dynamic Programming
Dynamic programming was popularized by Richard Bellman, who started to describe it in 1940s. It
typically applies to optimization problems. It typically reduces the complexity from exponential, e.g. 2n to
polynomi