80 views

Uploaded by Gobara Dhan

Problem Set

- hw1-salarystatistics
- Lecturer Computer Science Mcqs Paper 2011
- 26 Final Lec
- Bubble Sort
- da1
- Join
- Computer Practicals File
- Notes
- 13Sorting_0
- Session 9- Sorting - 2015 (2)
- 01. Introduction
- Gating by Sorting Fusion Jul 2013
- Brief Complexity
- Master's Theorem(2)
- Solutions 4
- 28 Schmidt
- Test 1 Spring 99
- quickSort-abhishekShukla
- Sorting
- Tips for Manipulating Data in SAS

You are on page 1of 2

he entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom. Some of the entries of a Young tableau may be , which we treat as nonexistent elements. Thus a Young tableau can be used to hold r mn numbers. Heres an example of a 4x4 Young tableau containing the elements {9, 16, 3, 2, 4, 8, 5, 14, 12}. Note that this is not unique.

2 3 5 12 4 8 14 9 16

(a) (5 points) Argue that an m n Young tableau Y is empty if Y [1, 1] = . Argue that Y is full (contains mn elements) if Y [m, n] < . (b) (5 points) Argue that the minimum element of a Young tableau Y is always in Y [1, 1]. (c) (10 points) Give an algorithm to implement EXTRACT-MIN on a nonempty m n Young tableau that runs in O(m + n) time. Your algorithm should use a recursive subroutine that solves an m n problem by recursively solving either an (m 1) n or an m (n 1) subproblem. Dene T (p), where p = m + n, to be the maximum running time of EXTRACT-MIN on any m n Young tableau. Give and solve a recurrence for T (p) that yields the O(m + n) time bound. (d) (10 points) Show how to insert a new element into a nonfull m n Young tableau in O(m + n) time. (d) (10 points) Using no other sorting method as subroutine, show how to use an n n Young tableau to sort n2 numbers in O(n3 ) time. Based on this, describe a sorting algorithm that has an O(n1.5 ) worst-case running time. (e) (0 points) I will not ask: given n distinct elements, how many Young tableaus can you make?

Problem 2: Sometimes you just have to count (10 points) Describe an algorithm that, given n integers in the rangle 0 to k , preprocesses its input and then answers any query about how many of the n integers fall into a rangle [a..b] in O(1) time. Your algorithm should use (n + k ) prepreocessing time. For full credit you should Describe your algorithm in english Provide a pseudocode Provide arguments for the correctness of your algorithm Provide arguments for the running times of the preprocessing and the query operations Problem 3: S0rt1ing revisited Suppose that we have an array of n data records to sort and that the key of each record has the value 0 or 1. An algorithm for sorting such a set of records might possess some subset of the following three desirable properties: 1. The algorithm runs in O(n) time 2. The algorithm is stable 3. The algorithm sorts in place, using no more than a constant amount of storate space in addition to the original array (a) (5 points) Describe an algorithm that possesses properties (1) and (2). (b) (5 points) Describe an algorithm that possesses properties (2) and (3). (c) (10 points) Describe an algorithm that possesses properties (1) and (3). For full credit you should in each case: Describe your algorithm in english Provide a pseudocode, unless you are describing an algorithm for which we have seen the pseudocode in class Provide arguments that your algorithm possesses the desired properties

- hw1-salarystatisticsUploaded bySoumya Das
- Lecturer Computer Science Mcqs Paper 2011Uploaded bySami Ullah
- 26 Final LecUploaded byphani
- Bubble SortUploaded byDivyaPatel
- da1Uploaded byகோபிநாத் நித்தியானந்தம்
- JoinUploaded bykevinazhu
- Computer Practicals FileUploaded byPunit Kumar
- NotesUploaded byJose_Colella_1708
- 13Sorting_0Uploaded byAnonymous FLuLOrA
- Session 9- Sorting - 2015 (2)Uploaded byPickle Rick
- 01. IntroductionUploaded byrudra_mazumdar
- Gating by Sorting Fusion Jul 2013Uploaded byducpiano
- Brief ComplexityUploaded bySridhar Chandrasekar
- Master's Theorem(2)Uploaded byyashdhingra
- Solutions 4Uploaded byamit
- 28 SchmidtUploaded byLiridon Sulejmani
- Test 1 Spring 99Uploaded byGobara Dhan
- quickSort-abhishekShuklaUploaded byapi-19981779
- SortingUploaded byAishwarya
- Tips for Manipulating Data in SASUploaded byim keh
- Pranav A. sriram (2) (OlympCombinatorics)Uploaded bymathh97
- Final Test IinUploaded byLuci Ionica
- _Computer Application-BCA Fifth Sem (1)_2.pdfUploaded byfrank ansari
- Towards the Visualization of CoursewareUploaded byAuthor
- Java Midterm examUploaded bySrdjanVuksan
- Secure, Stable MethodologiesUploaded byTimothy Parks
- kMeansPlusPlusUploaded byaitzgorri
- li-littman-walsh-2008.pdfUploaded byKitana Masuri
- 10.1.1.67Uploaded byFeng Bill Shi
- Containment Algorithms for Objects in Rectangular BoxesUploaded byBruno Sousa

- Test2fall2001 SolUploaded byGobara Dhan
- BDC Program for Open Sales Order - SD (VA01)Uploaded byalronu
- WD A complete+Example+with+ScreenshotsUploaded byGobara Dhan
- test2SUploaded byGobara Dhan
- Abap ObjectsUploaded byGobara Dhan
- test2fall08Uploaded byGobara Dhan
- Step by Step Smart FormsUploaded bycyberabad
- test2fall96Uploaded byGobara Dhan
- test2fall09Uploaded byGobara Dhan
- Test 2 Spring 01Uploaded byGobara Dhan
- Python Basic1Uploaded byGobara Dhan
- test2fall98Uploaded byGobara Dhan
- Most Frequently Asked Interview DIFFERENCES AbapUploaded byRıdvan Yiğit
- Function Module in SAPUploaded byGobara Dhan
- test2fall99.pdfUploaded byGobara Dhan
- Test 1 Spring 99Uploaded byGobara Dhan
- Test 1 Spring 2010Uploaded byGobara Dhan
- Test 2 Fall 03 AnswersUploaded byGobara Dhan
- test2fall02Uploaded byGobara Dhan
- test2fall03Uploaded byGobara Dhan
- Test 1 Spring 96Uploaded byGobara Dhan
- test2efall07Uploaded byGobara Dhan
- Test 1 Spring 97Uploaded byGobara Dhan
- Test 1 Spring 98Uploaded byGobara Dhan
- test2fall04Uploaded byGobara Dhan
- Call Adobe Form Through ABAP Web DynproUploaded byGobara Dhan
- test2fall00Uploaded byGobara Dhan
- Test 1 Spring 95Uploaded byGobara Dhan
- Test 2 e Fall 07 SolutionUploaded byGobara Dhan
- test2fall06Uploaded byGobara Dhan

- Regression AnalysisUploaded byRHA
- 2010-Lecture-1Uploaded bytomekzawistowski
- Linear Algebra & Matrices.pptUploaded bykamayani_pr
- Bits f312_comp Nn&FlUploaded byshaima
- LAO-CR-QPUploaded byRohit Kumar
- E&P FDP Random 450 Values 20 Histograms_G10Uploaded byMangar Mawut
- Basic Queuing TheoryUploaded byStefan Ristevski
- uguyUploaded byramy86
- Fu Ch11 Linear RegressionUploaded byjong
- 2-3 treeUploaded bymanishbhardwaj8131
- 06Jun-D1Uploaded byJonathan Foster
- text_classification.pdfUploaded byAsma Mushtaq
- Feedback and Control Systems Lab Manual-Uploaded bymamaw231
- DRM Chapter 10Uploaded bybhaduariya
- Chapter 10 - Eigenvalues and EigenvectorsUploaded byEnos Lolang
- Fall 2017_CS205_2_BC140400374Uploaded bybrainofpc
- Python Programming PracticeUploaded byKim Dauber
- Different Types of Kalman FiltersUploaded byankit bansal
- podcUploaded bybhlkumar
- Numerical Methods ReviewUploaded byDr. Madhukar Vable
- Quick sort AlgorithmUploaded byksb9790
- sm ch (17).pdfUploaded byHector Naranjo
- Final SolUploaded byRaghu Vamsi Potukuchi
- Rumour Detection PosterUploaded byPradyumna Majumder
- Filetype PDF Optimization Problems in the Theory of Continuous TradingUploaded byNina
- Availability and MaintainabilityUploaded bySumanta Das
- 02 ESI4523 Simulation NotesUploaded bySamuel Smith
- Digital Signal Processing Lab ManualUploaded byNiranjan Hegde
- DFA & NFAUploaded byAnam Qureshi
- REVIEW OF FACE DETECTION SYSTEMS BASED ARTIFICIAL NEURAL NETWORKS ALGORITHMSUploaded byIJMAJournal