Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.
1 Page
review_lect14
Course: COP 4020, Spring 2011School: FSU
Rating:
Document Preview
14 Lecture review What does abstraction mean when we say high level languages support abstraction? What is a name? What is the binding time? Potential binding times for names programs? What in are the major events in the lifetime of an objects? Why do we need to be mindful about the lifetime of objects and bindings? 02/20/12 COP4020 Spring 2011 1
Unformatted Document Excerpt
Coursehero >> Florida >> FSU >> COP 4020Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
14 Lecture review
What does abstraction mean when we say high level
languages support abstraction?
What is a name?
What is the binding time?
Potential binding times for names programs?
What in are the major events in the lifetime of an objects?
Why do we need to be mindful about the lifetime of
objects and bindings?
02/20/12
COP4020 Spring 2011
1
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
Below is a small sample set of documents:
FSU - COP - 4020
COP4020ProgrammingLanguagesNames, Scopes, and BindingsProf. Xin YuanOverviewScope rulesStatic versus dynamic scopingOverloading02/20/12COP4020 Spring 20112ScopeScope is the textual region of a program in which aname-to-object binding is acti
FSU - COP - 4020
COP4020ProgrammingLanguagesSemanticsProf. Xin YuanOverviewStatic semanticsDynamic semanticsAttribute grammarsAbstract syntax trees02/20/12COP4020 Spring 20112Static SemanticsSyntax concerns the form of a valid program, whilesemantics concer
FSU - COP - 4020
COP4020ProgrammingLanguagesNames, Scopes, and BindingsProf. Xin YuanOverviewObject storage management02/20/12Static allocationStack allocationHeap allocationCOP4020 Spring 20112Object Lifetime and StorageObjects (program data and code) have
FSU - COP - 4020
COP4020/CGS5426Programming languagesSyllabusInstructorXin Yuan (xyuan@cs.fsu.edu)Office: 168 LOVOffice hours: M, W, F 9:10am 10:00am, or by appointmentClass website:http:/www.cs.fsu.edu/~xyuan/cop4020Teaching AssistantJames Mcclain (mcclain@cs.
FSU - COP - 4020
COP4020ProgrammingLanguagesSyntax analysisProf. Xin YuanOverviewSyntax analysis overviewGrammar and context-free grammarGrammar derivationsParse trees02/20/12COP4020 Spring 20112Syntax analysisSyntax analysis is done by the parser.Detects w
FSU - CNT - 5412
Lecture 1Introduction and OverviewCNT 5412Network Security1Course Overview Introduction to network security Secure network services Security mechanisms Threats, attacks, countermeasures Networking & Secure channels Introduction to cryptography,
FSU - CNT - 5412
Lecture 2Confidential Channels, Encryptionand CiphersCNT 5412Network Security1Cryptography Greek for hidden writing The art and science of keeping messagessecure A field of study relating to the above Note: Cryptology is often defined to includ
FSU - CNT - 5412
Lecture 3Block Ciphers and Modes of OperationCNT 5412Network Security1Block Cipher A block cipher E() is a (parametrized) deterministicfunction mapping n-bit plaintext blocks to n-bit ciphertextblocks. The value n is called the blocklength. It is
FSU - CNT - 5412
Lecture 4More on Stream CiphersCNT 5412Network Security1Binary One-Time PadK[0]K[1]K[2]K[n-2]K[n-1]M[0]M[1]M[2]M[n-2] M[n-1]C[0]C[1]C[2]C[n-2]C[n-1]K[0]K[1]K[2]K[n-2]K[n-1]M[0]M[1]M[2]M[n-2] M[n-1]2Idea behind stream ciphers
FSU - CNT - 5412
Lecture 5Applications of Secret Key CryptographyMessage Authentication CodesandCryptographic Hash FunctionsCNT 5412Network Security1Cryptographic hash functionsAlso called message digestsMap a large space of values to a small spaceCannot be eas
FSU - CNT - 5412
Lecture 6AuthenticationCNT 5412Network Security1Authentication: who and how User (human) can be authenticated logging into a workstation using resources of a system issues: humans find it difficult to remember arbitrary strings Computer can be a
FSU - CNT - 5412
Lecture 7Authentication / Authorization Systemsand KerberosCNT 5412Network Security1Needham and Schroeder Paper1978 Seminal paper on Cryptographic Protocols Identified several "canonical" protocolsincluding for authenticationAccidentally illust
FSU - CNT - 5412
Lecture 8Public Key CryptographyIntroduction to Number TheoryCNT 5412Network Security1Public Key Cryptography Also called asymmetric key systems Unlike symmetric key, there is no need for Aliceand Bob to share a common secret Alice and Bob can c
FSU - CNT - 5412
Lecture 9Public Key CryptographyPublic Key AlgorithmsCNT 5412Network Security1Eulers Totient function (n) - again (n) is the number of positive integers less than n andrelatively prime to n.Let p be a prime. Then (p) = p 1Let n = pq for p and q
FSU - CNT - 5412
CNT 5412Network Security(Partial) Midterm 1 Sample QuestionsFebruary 2012NAME_Instructions:Put your name on your exam.Do all problems. Points are indicated next to the problem.1. 16 pts2. 16 pts3. 12 pts4. 28 pts1. (16 pts) You know that the f
UGA - MATH - 2250
SYLLABUS FOR MATH 2250Text: Hass, Weir, and Thomas,University Calculus, Early Transcendentals , Second EditionFall, 2011Section Topics and Recommended Exercises2.12.22.42.52.63.13.23.33.43.53.63.73.83.93.103.11Chapter 2: Limits and Co
UGA - MATH - 2250
Calculus I for Science and Engineering (Math 2250)Fall 20111TechnicalitiesInstructor: Clay Shonkwiler (clayton@math.uga.edu)Oce: Boyd 436Course web page: http:/www.math.uga.edu/~clayton/teaching/m2250f11/Text: University Calculus: Early Transcenden
UGA - MATH - 4000
Anatomy of a ProofTask: Prove that S = for every set S.Anatomy of a ProofTask: Prove that S = for every set S.Claim: Let S be a set. Then S = .Proof: Let S be a set.() Suppose x S . Then x S and x ,so in particular x . Therefore S .() Because has
UGA - MATH - 4000
Elements of StyleModern Algebra, Fall 2011Anders O.F. HendricksonYears of elementary school math taught us incorrectly that the answer to a math problemis just a single number, the right answer. It is time to unlearn those lessons: those days areover
UGA - MATH - 4000
Glossary of Proof TermsModern Algebra, Fall 2011The language of mathematical proofs can sometimes be confusing, since some words andphrases have peculiar meanings dierent from their meanings in ordinary English. Here is alist of some phrases and the m
UGA - MATH - 4000
Individual homework solutions will be assigned scores between 0 and 5 based on the following guide:5: The solution is completely correct and well-written.4: There is a minor oversight or the solution is not well-written.3: Most of the correct ideas are
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework 1 Due Wednesday, January 111. Read the syllabus and the list of student learning outcomes posted on the course web page.http:/www.math.uga.edu/~cdrup/teaching/math4000sp2012/index.htmlWe wi
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 2A and 2B Due Friday, January 13Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted.
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 3A and 3B Due Friday, January 20Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted.
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 4A and 4B Due Friday, January 27Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted.
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 5A and 5B Due Friday, February 3Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted.
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 6A and 6B Due Friday, February 10Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignment 7A Due Monday, February 20Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted. Write
UGA - MATH - 4000
Modern Algebra and Geometry IMath 4000/6000 (92-321)Homework Assignments 8A and 8B Due Friday, February 24Homework is due at the start of class. Work that is not turned in at the beginning of class isconsidered late, and will not generally be accepted
UGA - MATH - 4000
AA quick guide to LTEXAWhat is L TEX?Text decorationsListsAL TEX(usually pronounced LAY teck, sometimes LAHteck, and never LAY tex) is a mathematics typesettingprogram that is the standard for most professionalmathematics writing. It is based on
UGA - MATH - 4000
Finding the Next StepModern Algebra, Fall 2011It is bound to happen in this class. You understood everything in class and in the textbook, you can follow along when the professor shows a proof on the board, but youre staringat a homework exercise that
USF - COP - 4600
OperatingSystemsCOP4600Lecture1Instructor:Anda Iamnitchianda@cse.usf.edu1WhatisanOperatingSystem?2TheRoleofanOS Exploitthehardwareresourcesofoneormoreprocessors Providesasetofservicestosystemusers ManagessecondarymemoryandI/Odevices3ThisCour
USF - COP - 4600
Operating SystemsOperatingCOP 4600Lecture 1Instructor: Anda Iamnitchianda@cse.usf.edu1What is an Operating System?2The Role of an OSThe Exploit the hardware resources of one ormore processors Provides a set of services to system users Manage
USF - COP - 4600
OperatingSystemsLecture02:ComputerSystemOverviewAnda Iamnitchianda@cse.usf.eduToday Announcements: Exam2timeconflictwithAlgorithms FirstHWposted:duemidnightbeforenextTh lecture Finishchapter1:InterruptionsMemoryHierarchyCacheSymmetricMultipro
USF - COP - 4600
Operating SystemsOperatingLecture 02:LectureComputer System OverviewAnda Iamnitchianda@cse.usf.eduTodayToday Announcements: Exam 2 time conflict with Algorithms First HW posted: due midnight before next Th lecture Finish chapter 1:Interruptio
USF - COP - 4600
OperatingSystemsLecture03:OperatingSystemOverviewAnda Iamnitchianda@cse.usf.edu1Today Announcements: Proposal:changeinTAsschedule Piazza Slidespostedbeforeclassoncoursepage: http:/www.csee.usf.edu/~anda/cop4600/ OperatingSystemsOverview: Defi
USF - COP - 4600
Operating SystemsOperatingLecture 03:LectureOperating System OverviewAnda Iamnitchianda@cse.usf.edu1TodayToday Announcements: Proposal: change in TAs schedule Piazza Slides posted before class on course page: http:/www.csee.usf.edu/~anda/cop
USF - COP - 4600
OperatingSystemsLecture04:OperatingSystemOverviewAnda Iamnitchianda@cse.usf.edu1Today Announcements: OperatingSystemsOverview: MainconceptsinOS OSstructure VirtualMachines Windowsvs.Unixvs.Linux:studycases2MainAdvancesinOS Process MemoryMa
USF - COP - 4600
Operating SystemsOperatingLecture 04:LectureOperating System OverviewAnda Iamnitchianda@cse.usf.edu1TodayToday Announcements: Operating Systems Overview: Main concepts in OS OS structure Virtual Machines Windows vs. Unix vs. Linux: study ca
USF - COP - 4600
OperatingSystemsLecture05:VMs,OSexamples,ProcessesAnda Iamnitchianda@cse.usf.edu1Today Announcements: OperatingSystemsOverview: VirtualMachines Windowsvs.Unixvs.Linux:studycases Processes(Chapter3)2VirtualMachinesandVirtualization Virtualiz
USF - COP - 4600
Operating SystemsOperatingLecture 05:LectureVMs, OS examples, ProcessesAnda Iamnitchianda@cse.usf.edu1TodayToday Announcements: Operating Systems Overview: Virtual Machines Windows vs. Unix vs. Linux: study cases Processes (Chapter 3)2Virt
USF - COP - 4600
OperatingSystemsLecture06:Processes(cont)Anda Iamnitchianda@cse.usf.edu1Today Announcements: Project1finallyposted.DueOct20atmidnight. Processes(Chapter3): Processstates Usingfork2FiveStateProcessModelTwoStateProcessModel4Queueforthe5stat
USF - COP - 4600
Operating SystemsOperatingLecture 06:LectureProcesses (cont)Anda Iamnitchianda@cse.usf.edu1TodayToday Announcements: Project 1 finally posted. Due Oct 20 atmidnight. Processes (Chapter 3): Process states Using fork2Five-StateProcess Mode
USF - COP - 4600
OperatingSystemsLecture07:Processes(cont)&Threads(Chapter4)Anda Iamnitchianda@cse.usf.edu1ForkExample(fromlastclass)Thefollowingprogramwillcreateoneormoreprocesses.Showhowprocessesarecreatedandwhatisprintedtothescreenwhenthisprogramexecutes.2#
USF - COP - 4600
Operating SystemsOperatingLecture 07:LectureProcesses (cont) & Threads(Chapter 4)Anda Iamnitchianda@cse.usf.edu1Fork Example (from lastclass)The following program will create one ormore processes. Show how processes arecreated and what is pri
USF - COP - 4600
OperatingSystemsLecture08:ThreadsAnda Iamnitchianda@cse.usf.edu1Processesvs.Threads Aprocessviewedsofarasunitsof: Resourceownership Scheduling/execution Inmultithreading OS: Processstaystheunitofresourceownership Thread (orlightweightprocess)i
USF - COP - 4600
Operating SystemsOperatingLecture 08:LectureThreadsThreadsAnda Iamnitchianda@cse.usf.edu1Processes vs. ThreadsProcesses A process viewed so far as units of: Resource ownership Scheduling/execution In multithreading OS: Process stays the uni
USF - COP - 4600
OperatingSystemsLecture09:ConcurrencyAnda Iamnitchianda@cse.usf.edu1#include<pthread.h>#include<stdio.h>int sum;/*thisdataissharedbythethread(s)*/QODpart1void*runner(void*param);/*thethread*/main(int argc,char*argv[])cfw_pthread_t tidl,tid;/*
USF - COP - 4600
Operating SystemsOperatingLecture 09:LectureConcurrencyConcurrencyAnda Iamnitchianda@cse.usf.edu1#include <pthread.h>#include <stdio.h>int sum; /* this data is shared by the thread(s) */QOD-part 1QOD-partvoid *runner(void *param); /* the thr
USF - COP - 4600
OperatingSystemsLecture10:SemaphoresAnda Iamnitchianda@cse.usf.edu1MutualExclusionIdea#3:SemaphoresAvariablethathasanintegervalueuponwhichonlythreeoperationsaredefined:Thereisnowaytoinspectormanipulatesemaphoresotherthanthesethreeoperations
USF - COP - 4600
Operating SystemsOperatingLecture 10:LectureSemaphoresSemaphoresAnda Iamnitchianda@cse.usf.edu1Mutual ExclusionMutualIdea #3: Semaphores1) May be initialized to a nonnegative integer value2) The semWait operation decrements the value3) The s
USF - COP - 4600
OperatingSystemsLecture11:BarberShop.Readers/WritersAnda Iamnitchianda@cse.usf.edu1SleepingBarberProblem There is one barber, and n chairsfor waiting customersIf there are no customers, then thebarber sits in his chair and sleepsWhen a new cust
USF - COP - 4600
Operating SystemsOperatingLecture 11:LectureBarber Shop. Readers/WritersBarberAnda Iamnitchianda@cse.usf.edu1Sleeping Barber Problem There is one barber, and n chairsfor waiting customersIf there are no customers, then thebarber sits in his c
USF - COP - 4600
OperatingSystemsLecture12:Monitors.MessagePassing.Readers/Writers.Anda Iamnitchianda@cse.usf.edu1RoadmapConcurrencyMutualExclusion:HardwareSupportSemaphoresMonitorsMessagePassingReaders/WritersProblemMonitors Themonitorisaprogramminglanguag
USF - COP - 4600
Operating SystemsOperatingLecture 13:LectureMonitors. Message Passing.Readers/Writers.Readers/Writers.Anda Iamnitchianda@cse.usf.edu1RoadmapRoadmapConcurrencyMutual Exclusion: Hardware SupportSemaphoresMonitorsMessage PassingReaders/Write
USF - COP - 4600
OperatingSystemsLecture14:DeadlockandStarvationAnda Iamnitchianda@cse.usf.edu1PotentialDeadlockIneedquadCandBIneedquadDandAIneedquadBandCIneedquadAandBActualDeadlockHALT untilDisfreeHALT untilAisfreeHALT untilCisfreeHALT untilBisfre
USF - COP - 4600
Operating SystemsOperatingLecture 14:LectureDeadlock and StarvationDeadlockAnda Iamnitchianda@cse.usf.edu1Potential DeadlockI needquad Cand BI needquad Dand AI needquad B andCI needquad A andBActual DeadlockActualHALT untilD is fr
USF - COP - 4600
OperatingSystemsLecture15:DeadlockandStarvationAnda Iamnitchianda@cse.usf.edu1FourConditionsforDeadlock1. Mutualexclusioncondition Onlyoneprocessmayusearesourceatatime2. Holdandwaitcondition Aprocessmayholdallocatedresourceswhileawaitingassignm
USF - COP - 4600
Operating SystemsOperatingLecture 15:LectureDeadlock and StarvationDeadlockAnda Iamnitchianda@cse.usf.edu1Four Conditions forFourDeadlockDeadlock1. Mutual exclusion condition Only one process may use a resource at a time1. Hold-and-wait con
USF - COP - 4600
OperatingSystemsLecture16:DiningPhilosophersandUniprocessorScheduling(Chapter9)Anda Iamnitchianda@cse.usf.edu1Problem Considerthefollowingwaysofhandlingdeadlock:(1)banker'salgorithm,(2)detectdeadlockandkillthread,releasingallresources,(3)reserve
USF - COP - 4600
Operating SystemsOperatingLecture 16:LectureDining Philosophers andUniprocessor Scheduling(Chapter 9)(ChapterAnda Iamnitchianda@cse.usf.edu1ProblemProblem Consider the following ways of handling deadlock: (1)banker's algorithm, (2) detect de