Course Hero - We put you ahead of the curve!
You have requested the below document.
Sign up now to view this document for free!
- Title: photo1_08_hw3_sol
- Type: Notes
- School: Purdue
- Course: COM 590d
- Term: Fall
Coursehero >> Indiana >> Purdue >> COM 590d
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> COM >> 590d Fall, 2008
Path: Purdue >> GRAD >> 590d Fall, 2008
Path: Purdue >> NUCL >> 310 Fall, 2008
Path: Purdue >> CS >> 250 Spring, 2008
Path: Purdue >> C S >> 250 Spring, 2008
Path: Purdue >> CS >> 250 Spring, 2008
Path: Purdue >> C S >> 250 Spring, 2008
Path: Purdue >> CS >> 250 Spring, 2008
Path: Purdue >> C S >> 250 Spring, 2008
Path: Purdue >> CS >> 250 Spring, 2008
Path: Purdue >> C S >> 250 Spring, 2008
Path: Purdue >> CS >> 250 Spring, 2008
Path: Purdue >> C S >> 250 Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 251 Spring, 2008
Path: Purdue >> CS >> 251s Spring, 2008
Path: Purdue >> C S >> 251 Spring, 2008
Path: Purdue >> C S >> 251s Spring, 2008
Path: Purdue >> CS >> 355 Fall, 2008
Path: Purdue >> C S >> 355 Fall, 2008
Path: Purdue >> CS >> 355 Fall, 2008
Path: Purdue >> C S >> 355 Fall, 2008
Path: Purdue >> CS >> 355 Fall, 2008
Path: Purdue >> C S >> 355 Fall, 2008
Path: Purdue >> CS >> 355 Fall, 2008
Path: Purdue >> C S >> 355 Fall, 2008
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, and exam answer keys.
neighbor Nearest interpolation Bilinear interpolation p 2.5 0 0 2.5 25 729500.0 5026300.0 5026300 0 ESRI world file par8_ls.lst par8_ls del = -12.421 295.17 276.46 93.121 -82.718 82.543 -0.30455 0.31061 residuals: x y note: these are in image space !!! 1.000000 2.41 -0.19 2.000000 0.95 1.07 3.000000 0.15 1.07 4.000000 -0.09 -0.54 5.000000 -3.39 -0.71 6.000000 0.83 0.53 7.000000 -1.34 -1.36 8.000000 0.48 0.13 image x,y rms ans = 1.6179 0.81306 a0 a1 a2 b0 b1 b2 c1 c2 ans = -12.421 295.17 276.46 ans = 93.121 -82.718 82.543 ans = -0.30455 0.31061 offsets used to reduce coord magnitude Xref = 733.01 Yref = 5022.1 crd1_ref = 447 crd2_ref = 340 format long g par8_ls del = -12.4214409629976 295.171791718904 276.455776688616 93.1212276106465 -82.7175574839763 82.5430904885927 -0.304547917683162 0.310606496419191 residuals: x y note: these are in image space !!! 1.000000 2.41 -0.19 2.000000 0.95 1.07 3.000000 0.15 1.07 4.000000 -0.09 -0.54 5.000000 -3.39 -0.71 6.000000 0.83 0.53 7.000000 -1.34 -1.36 8.000000 0.48 0.13 image x,y rms ans = 1.61794554021788 0.813063179892285 Page 1 par8_ls.lst a0 a1 a2 b0 b1 b2 c1 c2 ans = -12.4214409629976 295.171791718904 ans = 93.1212276106465 -82.7175574839763 ans = -0.304547917683162 0.310606496419191 offsets used to reduce coord magnitude Xref = 733.007 Yref = 5022.107 crd1_ref = 447 crd2_ref = 340 diary off 276.455776688616 82.5430904885927 Page 2 % % % % % % % % % % % % % % % % % % % % % % % % % % par8_ls.m par8_ls.m 16-nov-08 solve 8-parameter problem by least squares modify to allow pflag=1: x,y conventional pflag=2: x,y photoshop pflag=3 l,s data in con2d.dat (control) and mea2d.dat (measurements) transformation from to ground image with residuals in the image system a0 + a1*X + a2*Y x = --------------------1 + c1*X + c2*Y b0 + b1*X + b2*Y y = -------------------1 + c1*X + c2*Y x=[1 X Y 0 0 0 -xX -xY] [ y=[0 0 0 1 X Y -yX -yY] [ [ [ [ [ [ [ a0 a1 a2 b0 b1 b2 c1 c2 ] ] ] ] ] ] ] ] pflag=2; degrad=180/pi; load con2d.dat load mea2d.dat % shift in X&Y only for now % Xref=con2d(1,2); % Yref=con2d(1,3); % let's try ground coords in km Xref=733007/1000; Yref=5022107/1000; crd1_ref=447; crd2_ref=340; [npts,ndum]=size(con2d); xpho=zeros(npts,1); ypho=zeros(npts,1); B=zeros(2*npts,8); f=zeros(2*npts,1); % we fiddle with measurement system coordinates so that the final % image coordinates used in the 8-par have x to the right and y up FY=0; for i=1:npts X=con2d(i,2)/1000 Y=con2d(i,3)/1000 % coordinate 1,2 crd1=mea2d(i,2) crd2=mea2d(i,3) switch pflag case 1 x=crd1; - Xref; - Yref; crd1_ref; crd2_ref; Page 1 par8_ls.m y=crd2; case 2 x=crd1; y= -crd2 case 3 x=crd2; y= -crd1 otherwise end ii=(2*i)-1; B(ii ,:)=[1 B(ii+1,:)=[0 f(ii )=x; f(ii+1)=y; end + FY; + FY; X Y 0 0 0 -x*X -x*Y]; 0 0 1 X Y -y*X -y*Y]; del=inv(B'*B)*B'*f; del a0=del(1); a1=del(2); a2=del(3); b0=del(4); b1=del(5); b2=del(6); c1=del(7); c2=del(8); resid=f - B*del; disp('residuals: x y'); disp('note: these are in image space !!!'); rmsx=0; rmsy=0; for i=1:npts xidx=(i*2)-1; yidx=xidx+1; vx=resid(xidx); vy=resid(yidx); rmsx=rmsx + vx*vx; rmsy=rmsy + vy*vy; fprintf(1,'%5f %10.2f %10.2f\n',i,vx,vy); end rmsx=sqrt(rmsx/npts); rmsy=sqrt(rmsy/npts); disp('image x,y rms'); [rmsx rmsy] disp('a0 a1 a2 b0 b1 b2 c1 c2'); [a0 a1 a2] [b0 b1 b2] [c1 c2] disp('offsets used to reduce coord magnitude'); Xref Yref crd1_ref crd2_ref Page 2
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:
photo1_08_hw3_sol.pdf
Path: Purdue >> GRAD >> 590d Fall, 2008
Description: Nearestneighbor interpolation Bilinearinterpolation p 2.5 0 0 2.5 25 729500.0 5026300.0 5026300 0 ESRIworldfile par8_ls.lst par8_ls del = -12.421 295.17 276.46 93.121 -82.718 82.543 -0.30455 0.31061 residuals: x y note: these are in image space !...
603hw5.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: Homework 5 (Revised 14-April) Select a minimum of 3, from the 6, close-range terrestrial photos of the north end of the chemical engineering building. Select pass-points and control points Measure all image coordinate data Determine initial approxima...
603hw5.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: Homework 5 (Revised 14-April) Select a minimum of 3, from the 6, close-range terrestrial photos of the north end of the chemical engineering building. Select pass-points and control points Measure all image coordinate data Determine initial approxima...
grad590d_07_hw1_sol.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: ...
grad590d_07_hw1_sol.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: ...
writing.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: Latitude by Carter & Carter Write a 2-3 page essay in which you Summarize the book and your reaction to it Address one of the following 3 questions/issues o In data adjustment we attempt to (a) discover and account for systematic errors in our obse...
writing.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: Latitude by Carter & Carter Write a 2-3 page essay in which you Summarize the book and your reaction to it Address one of the following 3 questions/issues o In data adjustment we attempt to (a) discover and account for systematic errors in our obse...
ip.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: Examples of how image intensity statistics lead to an interest point or corner detector Developments attributed to Forstner & Harris The Harris corner detector and the Forstner interest operator both utilize the covariance matrix of the shift terms...
ip.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: Examples of how image intensity statistics lead to an interest point or corner detector Developments attributed to Forstner & Harris The Harris corner detector and the Forstner interest operator both utilize the covariance matrix of the shift terms...
ortho_hw.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: Orthorectification Homework Find the file rpc_80.txt on geomatics drive, offsets, scales, and RPC coefficients for Indianapolis Quickbird scene see QB product guide / NITF spec for order of data, lat, lon decimal degrees, h meters, line, sample pi...
ortho_hw.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: Orthorectification Homework Find the file rpc_80.txt on geomatics drive, offsets, scales, and RPC coefficients for Indianapolis Quickbird scene see QB product guide / NITF spec for order of data, lat, lon decimal degrees, h meters, line, sample pi...
grad590f_08_notes22.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: See annotations along with code, made a few revision to actually make it work! recommend also putting semicolons after most statement to prevent their cluttering up the screen with unneeded numeric output puse = [1;4;7]; I found this worked better ...
grad590f_08_notes22.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: See annotations along with code, made a few revision to actually make it work! recommend also putting semicolons after most statement to prevent their cluttering up the screen with unneeded numeric output puse = [1;4;7]; I found this worked better ...
603_06hw2.pdfPath: Purdue >> COM >> 590d Fall, 2008
Description: CE 603 Homework 2 Control Point Inventory Assigned Monday, 6-February-2006, due Monday 13th, 1 week Locate two images (81.tif, and 82.tif) on the geomatics drive in the folder bethel\\ce603\\eros_a. Note these are full spatial resolution, but radiomet...
603_06hw2.pdfPath: Purdue >> GRAD >> 590d Fall, 2008
Description: CE 603 Homework 2 Control Point Inventory Assigned Monday, 6-February-2006, due Monday 13th, 1 week Locate two images (81.tif, and 82.tif) on the geomatics drive in the folder bethel\\ce603\\eros_a. Note these are full spatial resolution, but radiomet...
NUCL310_diffusion.pdfPath: Purdue >> NUCL >> 310 Fall, 2008
Description: Online Diffusion Tool Shanjie Xiao Xue Yang Nader Satvat 2008-2-22 1 Outline Diffusion numerical methodology Code usage of Diffusion2D Web Interface 2008-2-22 2 METHODOLOGY Diffusion Equation: D(x, y)(x, y) +R (x, y)(x, y) = S(x, y) Integral ...
FinReview.pdfPath: Purdue >> CS >> 250 Spring, 2008
Description: CS250: Computer Architecture Review Prof. Chris Clifton April 23-27, 2007 Grading 10%: Written assignments (equally weighted, lowest score dropped) 33%: Labs (equally weighted, lowest score dropped) 16%: Midterm Exam 5%: Project 1 12%: Project...
FinReview.pdfPath: Purdue >> C S >> 250 Spring, 2008
Description: CS250: Computer Architecture Review Prof. Chris Clifton April 23-27, 2007 Grading 10%: Written assignments (equally weighted, lowest score dropped) 33%: Labs (equally weighted, lowest score dropped) 16%: Midterm Exam 5%: Project 1 12%: Project...
Review.pptPath: Purdue >> CS >> 250 Spring, 2008
Description: CS250: Computer Architecture Midterm Review Prof. Chris Clifton February 28, 2007 Grading 10%: Written assignments (equally weighted, lowest score dropped) 33%: Labs (equally weighted, lowest score dropped) 16%: Midterm Exam 5%: Project 1 12%:...
Review.pptPath: Purdue >> C S >> 250 Spring, 2008
Description: CS250: Computer Architecture Midterm Review Prof. Chris Clifton February 28, 2007 Grading 10%: Written assignments (equally weighted, lowest score dropped) 33%: Labs (equally weighted, lowest score dropped) 16%: Midterm Exam 5%: Project 1 12%:...
Interrupts.pdfPath: Purdue >> CS >> 250 Spring, 2008
Description: CS 250: Computer Architecture Prof. Chris Clifton March 30, 2007 Interrupts 1 Purpose Events happen outside control of program Need to respond to those events Interrupt provides notice of event Two types: Hardware external event Software p...
Interrupts.pdfPath: Purdue >> C S >> 250 Spring, 2008
Description: CS 250: Computer Architecture Prof. Chris Clifton March 30, 2007 Interrupts 1 Purpose Events happen outside control of program Need to respond to those events Interrupt provides notice of event Two types: Hardware external event Software p...
Assign5sol.pdfPath: Purdue >> CS >> 250 Spring, 2008
Description: CS250 Spring 2007 Solution1 for Assignment 5 1: Assembly (30%) 1. The rst instruction (subu) addresses an immediate value through a register, while the second instruction (sw) uses a register oset addressing mode. 2. We cannot move the rst two instru...
Assign5sol.pdfPath: Purdue >> C S >> 250 Spring, 2008
Description: CS250 Spring 2007 Solution1 for Assignment 5 1: Assembly (30%) 1. The rst instruction (subu) addresses an immediate value through a register, while the second instruction (sw) uses a register oset addressing mode. 2. We cannot move the rst two instru...
finsol.pdfPath: Purdue >> CS >> 250 Spring, 2008
Description: CS250 Spring 2007 Final Exam Solutions, May 5, 2007 Prof. Chris Clifton Time will be tight. If you spend more than the recommended time on any question, go on to the next one. If you cant answer it in the recommended time, you are either going in to ...
finsol.pdfPath: Purdue >> C S >> 250 Spring, 2008
Description: CS250 Spring 2007 Final Exam Solutions, May 5, 2007 Prof. Chris Clifton Time will be tight. If you spend more than the recommended time on any question, go on to the next one. If you cant answer it in the recommended time, you are either going in to ...
A7.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 7 Due Monday October 22, 11:59PM Hash Tables 1. Implement a C+ hash table class HashTable in files HashTable.cc and HashTable.h a. The items stored are integers which serve both as keys and as elements. b. ...
A7.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 7 Due Monday October 22, 11:59PM Hash Tables 1. Implement a C+ hash table class HashTable in files HashTable.cc and HashTable.h a. The items stored are integers which serve both as keys and as elements. b. ...
A7.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 7 Due Monday October 22, 11:59PM Hash Tables 1. Implement a C+ hash table class HashTable in files HashTable.cc and HashTable.h a. The items stored are integers which serve both as keys and as elements. b. ...
A7.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 7 Due Monday October 22, 11:59PM Hash Tables 1. Implement a C+ hash table class HashTable in files HashTable.cc and HashTable.h a. The items stored are integers which serve both as keys and as elements. b. ...
A5.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 5 Due Monday October 1, 11:59PM Binary trees 1. Implement a C+ binary tree class BinaryTree that models arithmetic expressions. An internal node stores an operator represented with a character (i.e. +, -, *,...
A5.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 5 Due Monday October 1, 11:59PM Binary trees 1. Implement a C+ binary tree class BinaryTree that models arithmetic expressions. An internal node stores an operator represented with a character (i.e. +, -, *,...
A5.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 5 Due Monday October 1, 11:59PM Binary trees 1. Implement a C+ binary tree class BinaryTree that models arithmetic expressions. An internal node stores an operator represented with a character (i.e. +, -, *,...
A5.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 5 Due Monday October 1, 11:59PM Binary trees 1. Implement a C+ binary tree class BinaryTree that models arithmetic expressions. An internal node stores an operator represented with a character (i.e. +, -, *,...
A8.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 8 Due Monday October 29, 11:59PM AVL Tree 1. Implement a C+ AVL Tree class AVLTree in files AVLTree.cpp and AVLTree.h a. The items stored are positive integers which serve both as keys and as elements. b. T...
A8.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 8 Due Monday October 29, 11:59PM AVL Tree 1. Implement a C+ AVL Tree class AVLTree in files AVLTree.cpp and AVLTree.h a. The items stored are positive integers which serve both as keys and as elements. b. T...
A8.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 8 Due Monday October 29, 11:59PM AVL Tree 1. Implement a C+ AVL Tree class AVLTree in files AVLTree.cpp and AVLTree.h a. The items stored are positive integers which serve both as keys and as elements. b. T...
A8.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 8 Due Monday October 29, 11:59PM AVL Tree 1. Implement a C+ AVL Tree class AVLTree in files AVLTree.cpp and AVLTree.h a. The items stored are positive integers which serve both as keys and as elements. b. T...
10.23-SortingSetsSelection.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: Merge Sort 7 29 4 2 4 7 9 72 2 7 77 22 94 4 9 99 44 Sets 1 Outline and Reading Divide-and-conquer paradigm (10.1.1) Merge-sort (10.1) Algorithm Merging two sorted sequences Merge-sort tree Execution example Analysis Generic merging and set ope...
10.23-SortingSetsSelection.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: Merge Sort 7 29 4 2 4 7 9 72 2 7 77 22 94 4 9 99 44 Sets 1 Outline and Reading Divide-and-conquer paradigm (10.1.1) Merge-sort (10.1) Algorithm Merging two sorted sequences Merge-sort tree Execution example Analysis Generic merging and set ope...
10.23-SortingSetsSelection.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: Merge Sort 7 29 4 2 4 7 9 72 2 7 77 22 94 4 9 99 44 Sets 1 Outline and Reading Divide-and-conquer paradigm (10.1.1) Merge-sort (10.1) Algorithm Merging two sorted sequences Merge-sort tree Execution example Analysis Generic merging and set ope...
10.23-SortingSetsSelection.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: Merge Sort 7 29 4 2 4 7 9 72 2 7 77 22 94 4 9 99 44 Sets 1 Outline and Reading Divide-and-conquer paradigm (10.1.1) Merge-sort (10.1) Algorithm Merging two sorted sequences Merge-sort tree Execution example Analysis Generic merging and set ope...
08.20-2DGraphics.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: C+ By Example A Simple App: 2D Graphics 1 Graphics pipeline overview Scene description Geometry Animation Material properties Lights 2D array of pixels Image Transformation Find what is seen in the requested view, and how. Rasterization Fill in ...
08.20-2DGraphics.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: C+ By Example A Simple App: 2D Graphics 1 Graphics pipeline overview Scene description Geometry Animation Material properties Lights 2D array of pixels Image Transformation Find what is seen in the requested view, and how. Rasterization Fill in ...
08.20-2DGraphics.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: C+ By Example A Simple App: 2D Graphics 1 Graphics pipeline overview Scene description Geometry Animation Material properties Lights 2D array of pixels Image Transformation Find what is seen in the requested view, and how. Rasterization Fill in ...
08.20-2DGraphics.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: C+ By Example A Simple App: 2D Graphics 1 Graphics pipeline overview Scene description Geometry Animation Material properties Lights 2D array of pixels Image Transformation Find what is seen in the requested view, and how. Rasterization Fill in ...
A9.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 9 Due Friday November 9, 11:59PM Sorting 1. Implement void quicksort(unsigned int *a, int n) as a C style function in the file quicksort.cc a. The function sorts the array a of n positive integers. b. The ma...
A9.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 9 Due Friday November 9, 11:59PM Sorting 1. Implement void quicksort(unsigned int *a, int n) as a C style function in the file quicksort.cc a. The function sorts the array a of n positive integers. b. The ma...
A9.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 9 Due Friday November 9, 11:59PM Sorting 1. Implement void quicksort(unsigned int *a, int n) as a C style function in the file quicksort.cc a. The function sorts the array a of n positive integers. b. The ma...
A9.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 9 Due Friday November 9, 11:59PM Sorting 1. Implement void quicksort(unsigned int *a, int n) as a C style function in the file quicksort.cc a. The function sorts the array a of n positive integers. b. The ma...
A1.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 1 Due Friday August 31st, 11:59PM A simple C+ application: 2D graphics 1. Take the simple 2D graphics application developed in class and get it to work in your favorite C+ environment a. Use 08.24 code archi...
A1.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 1 Due Friday August 31st, 11:59PM A simple C+ application: 2D graphics 1. Take the simple 2D graphics application developed in class and get it to work in your favorite C+ environment a. Use 08.24 code archi...
A1.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 1 Due Friday August 31st, 11:59PM A simple C+ application: 2D graphics 1. Take the simple 2D graphics application developed in class and get it to work in your favorite C+ environment a. Use 08.24 code archi...
A1.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251 Fall 2007 Voicu Popescu Assignment 1 Due Friday August 31st, 11:59PM A simple C+ application: 2D graphics 1. Take the simple 2D graphics application developed in class and get it to work in your favorite C+ environment a. Use 08.24 code archi...
10.05-Heap.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: Heaps and Priority Queues 2 5 9 7 6 Heaps and Priority Queues 1 Priority Queue ADT (7.1) A priority queue stores a collection of items An item is a pair (key, element) Main methods of the Priority Queue ADT insertItem(k, o) inserts an item with ke...
10.05-Heap.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: Heaps and Priority Queues 2 5 9 7 6 Heaps and Priority Queues 1 Priority Queue ADT (7.1) A priority queue stores a collection of items An item is a pair (key, element) Main methods of the Priority Queue ADT insertItem(k, o) inserts an item with ke...
10.05-Heap.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: Heaps and Priority Queues 2 5 9 7 6 Heaps and Priority Queues 1 Priority Queue ADT (7.1) A priority queue stores a collection of items An item is a pair (key, element) Main methods of the Priority Queue ADT insertItem(k, o) inserts an item with ke...
10.05-Heap.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: Heaps and Priority Queues 2 5 9 7 6 Heaps and Priority Queues 1 Priority Queue ADT (7.1) A priority queue stores a collection of items An item is a pair (key, element) Main methods of the Priority Queue ADT insertItem(k, o) inserts an item with ke...
A10.pdfPath: Purdue >> CS >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 10 Due Monday December 3rd, 11:59PM Graphs & more 1. Implement an undirected graph data structure using adjacency lists, as a C+ class UGraph in UGraph.cpp. A skeleton of UGraph.cpp is provided. The class sh...
A10.pdfPath: Purdue >> CS >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 10 Due Monday December 3rd, 11:59PM Graphs & more 1. Implement an undirected graph data structure using adjacency lists, as a C+ class UGraph in UGraph.cpp. A skeleton of UGraph.cpp is provided. The class sh...
A10.pdfPath: Purdue >> C S >> 251 Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 10 Due Monday December 3rd, 11:59PM Graphs & more 1. Implement an undirected graph data structure using adjacency lists, as a C+ class UGraph in UGraph.cpp. A skeleton of UGraph.cpp is provided. The class sh...
A10.pdfPath: Purdue >> C S >> 251s Spring, 2008
Description: CS 251, Fall 2007 Voicu Popescu Assignment 10 Due Monday December 3rd, 11:59PM Graphs & more 1. Implement an undirected graph data structure using adjacency lists, as a C+ class UGraph in UGraph.cpp. A skeleton of UGraph.cpp is provided. The class sh...
lect27.pdfPath: Purdue >> CS >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 37: SSL. CS355 Lecture 27/ Fall 2008 1 OSI/ISO Model Application Presentation Session Transport Network Data Link Physical Layer CS355 Lecture 27/ Fall 2008 Application Presentation Session Transport Network Data Lin...
lect27.pdfPath: Purdue >> C S >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 37: SSL. CS355 Lecture 27/ Fall 2008 1 OSI/ISO Model Application Presentation Session Transport Network Data Link Physical Layer CS355 Lecture 27/ Fall 2008 Application Presentation Session Transport Network Data Lin...
lect23.pdfPath: Purdue >> CS >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 31: X509. PGP. Authentication protocols. Key establishment. CS355 Lecture 23/ Fall 2008 1 Public Keys and Trust Public Key:PA Secret key: SA Public Key:PB Secret key: SB How are public keys stored How to obtain th...
lect23.pdfPath: Purdue >> C S >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 31: X509. PGP. Authentication protocols. Key establishment. CS355 Lecture 23/ Fall 2008 1 Public Keys and Trust Public Key:PA Secret key: SA Public Key:PB Secret key: SB How are public keys stored How to obtain th...
lect3.pdfPath: Purdue >> CS >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 3: Cryptanalysis of Vigenere cipher. CS355 Lecture 3/ Fall 2008 1 Hw1 due Thursday Sept. 11 in class 1:30 PM Prj 1 due by email to the TA, Sept. 12, midnight, 11:59PM CS355 Lecture 3/ Fall 2008 2 The Vigenre C...
lect3.pdfPath: Purdue >> C S >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 3: Cryptanalysis of Vigenere cipher. CS355 Lecture 3/ Fall 2008 1 Hw1 due Thursday Sept. 11 in class 1:30 PM Prj 1 due by email to the TA, Sept. 12, midnight, 11:59PM CS355 Lecture 3/ Fall 2008 2 The Vigenre C...
lect24.pdfPath: Purdue >> CS >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 24: Kerberos CS355 Lecture 24/ Fall 2008 What is Kerberos? Kerberos is a network authentication protocol Provides authentication for clientserver applications, and data integrity and confidentiality Relies entir...
lect24.pdfPath: Purdue >> C S >> 355 Fall, 2008
Description: CS355: Cryptography Lecture 24: Kerberos CS355 Lecture 24/ Fall 2008 What is Kerberos? Kerberos is a network authentication protocol Provides authentication for clientserver applications, and data integrity and confidentiality Relies entir...