Compiler Design & Construction
/* CS 6413 : Compiler Design & Construction
Term Project : Part 1
Spring 2015
Instructed By : Dr. R. M. Siegfried
TERM PROJECT : PART 1 :
GROUP MEMBERS :-
N#
(1)
SUMITRA KANNAN
N 12952143
(2)
MRUNAL PATEKAR
N 14789187
(3) VI
/* CS 6413 : Compiler Design & Construction
Spring 2015
Instructed By : Dr. R. M. Siegfried
-TERM PROJECT : PART 1 :
*
*
GROUP MEMBERS :*
*
(1)
(2)
(3)
N 12952143
N 14789187
N 10423043
*
SUMITRA KANNAN
MRUNAL PATEKAR
VINAY
N #
AIM OF THE PROJECT :
Write a
COMPUTER NETWORKS
LAB ASSIGNMENT : 3
Aim :- TCP V6.0
Theory :Capturing a bulk TCP transfer from your computer to a remote
server .
Ans 1)(With reference to the given trace ) : The IP address used by the
client computer (source) that is transferring the
PROGRAMMING LANGUAGES
ASSIGNMENT :- 5
Program 1 :
Aim 1 :- What does the following Scheme function do?
(define (y s lis)
(cond
(null? lis) '() )
(equal? s (car lis) lis)
(else (y s (cdr lis)
)
Output :- After running the given Scheme function in mit-schem
N18809983
COMPUTER NETWORKS
SOCKET LAB ASSIGNMENT : 3
Aim :- Web Server :
We will learn the basics of socket programming for TCP connections in
Python, how to create a socket, bind it to a specific address and port, as well
as send and receive a HTTP pack
n Operatin
g
Systems:
Internals
and
Design
Principle
s
Chapter6
Concurrency:
Deadlockand
Starvation
SeventhEdition
ByWilliamStallings
OperatingSystems:
InternalsandDesignPrinciples
Whentwotrainsapproacheachotherata
crossing,bothshallcometoafullstopandneit
Concurrency
Programming for threads
Programmers
indicate a new branch is
needed and the OS creates a TCB for the new
thread.
The programmer then writes the thread as if it
were running as a new process, almost.
Features of accessing common
memory
Allow
"N
_ (Palms Utch Subux ban Quad
Roads 2 5' 3
mm C X G. M0, _ 2 5
3k Ax a 5
RIM o I o to
.3. 22 .
Gas .6; lo 0 2
0 "30! CTx
SE Ax .5 1, me en'mes axe 45a Dumbem (in '(hbnSandc)
X 29 0950 would \Iore C%omgl' (P :L Ismgabe)
Con Srend on \Icmous Polic
Application of Diophantine
to Problems in Chemistry
Roger Crocker
Queen Elizabeth College
London University
London England
T h e mathematical method of diophantine equations is shown to apply to two problems in
chemistry. First, in the balancing of chemic
2/12/2015
ConvexHull~Applications
Applications
Theory comes from practices, and applies to them.
Convexhullalgorithmisafundamentalalgorithmincomputation
geometry,onwhicharemanyalgorithmsincomputationgeometry
based.Alsotherearealotofapplicationsthatuseconv
1
Efcient algorithms for decoding Reed-Solomon
codes with erasures
Todd Mateer
AbstractIn this paper, we present a new algorithm for
decoding Reed-Solomon codes with both errors and erasures.
The algorithm combines an efcient method for solving the
Key Eq
Cours d'Algorithmique Avance (INFO036), Universit de Lige
6th February 2007
Introduction to
Convex Hull Applications
Cyril Briquet
Department of EE & CS
University of Lige, Belgium
Overview
Convex Hull basic notions
Convex Hull application domains
Onion P
I l . LC" 5 53 a W 30535 UH V. I; )lree edges and .til the other L'dgm nut-2 -
5" ' 95'395- ThclUSlicalion for this name is in Lemma 3 4' all thEn-on-trw "lees: I
33 Pm FIRE. emzc 52:5) 7 . . . _
- E "' -' T S H 1 connect a vertex back to one of Its anc
1
MASPECT: A Distributed Opportunistic Channel
Acquisition Mechanism in Dynamic Spectrum
Access Networks
S. Anand, S. Sengupta and R. Chandramouli
of ECE, Stevens Institute of Technology, New Jersey
Department of Math. & Comp. Sc., John Jay College, City
CS 6033: Design and Analysis of Algorithms I
Class Notes: Geometry
1
Denition of some Geometric Terms
Denition 1.1 A set, S, is called a convex set, if, xi , xj S and [0, 1],
xi + (1 )xj S.
What this means is that in a convex set, if you take any two poin
CS 6033: Design and Analysis of Algorithms I
Class Notes: Some Notes on Mathematical Induction
1
Principle of Mathematical Induction
Consider a set of problems which evolves in discrete steps and you need to prove
that something is true at every step. Mat
CS 6033: Design and Analysis of Algorithms I
Class Notes: Some Graph Theoretic Denitions
1
Basic graph Theoretic Terms
Denition 1.1 A graph G(V, E) is a collection of vertices (or nodes or points),
V = cfw_v1 , v2 , , vn joined by edges (or arcs or lines
Decoding BCH Codes Using the Euclidean Algorithm
for Finding Greatest Common Divisors
In 1975 Sugiyama1 , et. al., published an article describing how to use Euclids gcd algorithm to solve the key equations for decoding BCH codes. A matrix formulation of
1
CS6033: Design and Analysis of Algorithms I
Homework #02 Solutions
1)
PA (M1 M2 ) =
(M1 M2 )c mod n
c mod n) (M c mod n)
= (M1
2
=
PA (M1 )PA (M2 )
(1)
2) Consider an RSA cypto system with p = 11, q = 29, n = 319. Hence, (n) = (p 1)(q 1) = 280.
a) Publi
1
CS6033: Design and Analysis of Algorithms I
Homework #01 Solutions
1) Consider a = 847 and b = 231. We already saw in class that the gcd, d = 77 and d = am + bn, where
m = 1 and n = 4. Consider m = 2 and n = 7. We then have am + bn = 847(2) 231(7) = 77.
CS 6033: Design and Analysis of Algorithms I
Class Notes: Notes on Number Theory and Abstract Algebra
1
Basic Number Theory
Denition 1.1 Consider two integers, a, b and let, without loss of generality, a
b. Then a = qb + r, q 1 and 0 r < b are integers.
CS 6003 Foundations of Computer Science
Fall 2014 Syllabus
Basic Information
u
Instructor: Prof. Ozgr Ozkan
Lectures: Thursdays 1:30pm-4pm, or 6pm-8:30pm
Class site: https:/piazza.com/poly/fall2014/cs6003/home (password: 1focs4)
Contact: PM via Piazza
O
M0167270
Foundations of Group Behavior
Q.1 Define group. What are the different types of groups?
Ans Group: Two or more individuals interacting and interdependent, who have come
together to achieve particular objectives.
Different types of groups:
1. Form
M0167270
5.49
What is the meaning of the expected value of a probability distribution?
Ans. The expected value of a random variable X is the weighted average of the values that
can take on, where each possible value is weighted by its respective probabili
Chapter 3: Lexical Analysis
CSE4100
Prof. Steven A. Demurjian
Computer Science & Engineering Department
The University of Connecticut
371 Fairfield Way, Unit 2155
Storrs, CT 06269-3155
steve@engr.uconn.edu
http:/www.engr.uconn.edu/~steve
(860) 486 - 4818
N12952143
Assignment 1 : Installation of Ubuntu : 14.0.4
using Oracle Virtual Box
Instructions
Upload a screen capture of a terminal window open in your Ubuntu VM inside Virtualbox
on your host OS. I want to be able to see the Host OS and the Guest OS.
A
I/O Management and Disk
Scheduling
Slides from Stallings OS 4 th Ed
Categories of I/O Devices
Human readable
Used
to communicate with the user
Printers
Video display terminals
Display
Keyboard
Mouse
Categories of I/O Devices
Machine readable
Used
to commu
Processes and Threads
Overview
Threads
Fundamentals
Solaris Threads in some detail
Process: 2 Characteristics
Resource
Ownership
Virtual address space for process image
May own from time to time main memory, I/O
channels and devices, files. OS protects