0 Up votes0 Down votes

80 views2 pagesProblem Set

Jan 29, 2014

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Problem Set

Attribution Non-Commercial (BY-NC)

80 views

Problem Set

Attribution Non-Commercial (BY-NC)

- Introduction To Information Rertrieval Answer
- 140 Google Interview Questions
- BIG-O
- Course Out Line Data Structure and Algorithm
- BSc Thesis - An Enhanced Communication Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman Problem
- Decoupling the Ethernet from Agents in Vacuum Tubes
- Principle Behind Algorithm Analysis in Terms of Execution Time and Big
- Ajwani
- Big-Oh
- Mca 3
- 10.1.1.134.203
- DS Algorithms Analysis
- recurrence relations
- Google Software Engineering Prep Document
- lec37-nov03
- sol1
- Scheduling
- Convex Hull
- 37163662 Nestlle Project HRM Project
- Analysis of Algorithms I

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

- Introduction To Information Rertrieval AnswerUploaded byHafidz Jazuli Luthfi
- 140 Google Interview QuestionsUploaded bystephanehaddad
- BIG-OUploaded byarunkumarsh
- Course Out Line Data Structure and AlgorithmUploaded byAbdiaziz Qabile
- BSc Thesis - An Enhanced Communication Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman ProblemUploaded byPeter Popoola
- Decoupling the Ethernet from Agents in Vacuum TubesUploaded bybarunbasak
- Principle Behind Algorithm Analysis in Terms of Execution Time and BigUploaded byమెవీణ Koolgurl
- AjwaniUploaded bysuperman9468
- Big-OhUploaded byhuyeb
- Mca 3Uploaded bygaggi
- 10.1.1.134.203Uploaded byDiponegoro Muhammad Khan
- DS Algorithms AnalysisUploaded bySahil Khan
- recurrence relationsUploaded bydcvashist
- Google Software Engineering Prep DocumentUploaded bySubham Singh
- lec37-nov03Uploaded byMukesh Kumar Dewra
- sol1Uploaded byharsh peswani
- SchedulingUploaded byZhichaoWang
- Convex HullUploaded byশুভ্রা দেবনাথ
- 37163662 Nestlle Project HRM ProjectUploaded byMuddasir Khan
- Analysis of Algorithms IUploaded byFahri Firdausillah
- 1d arrayUploaded bySouradeep Ghosh
- DS Best Practices CollectionUploaded byJan Tan
- sszg519Uploaded bySangam Jindal
- 10.1.1.56.8465.psUploaded byvanaj123
- Mathematical-model of All AssignmentsUploaded byRinkesh Kalani
- 03AlgUploaded bykamberaj
- Analysis of Heap OperationsUploaded bySohaib Azam
- 02 Intel VTune Session 02Uploaded byajaihlb
- A Randomized Polynomial-time Simplex Algorithm for Linear ProgrammingUploaded byChan Yu Hin
- 9_2Uploaded byShashank S Kudlur

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

- Percept RomUploaded byAnil
- ExperimentUploaded byAbhishek Kumar Maurya
- Final Project ReportUploaded byHarpreet Singh
- Frequency transformation with Pascal matrix equationsUploaded byNguyen Si Phuoc
- Signals and Systems Lab Manual PrintUploaded byhimanshub43
- SCL DRNURAZAK.pdfUploaded byAzizah Mohd Hazedi
- link pdfsUploaded bykajsdka
- FEA REPORT ON 1D ANALYSIS OF STEPBARUploaded byKaran Pannu
- Design of RLC-Band Pass Filters.pdfUploaded byjgalindes
- Champagne 04Uploaded byNazi Sweet
- Ly Thuyet TCM+TCM EncoderUploaded byTran Hung
- Genetic Algorithm and Direct SearchToolbox With MatlabUploaded bySubrat Kumar Sahoo
- Adler32 Rolling Checksum EquationUploaded byatulindore2
- Wolf AlgorithmUploaded byvarshi
- A New Algorithm for Data Hiding Using Opap and Multiple KeysUploaded byIJMTER
- Kuliah Anum-2Uploaded byJesse gio
- LP Background on Constrained Optimization and LPUploaded byanon_610513462
- Complex FiltersUploaded bywrite2arshad_m
- ijdps040309Uploaded byijdps
- Keshab K Parhi VLSI Digital Signal ProcessingUploaded byPranjal Rastogi
- Skip ListsUploaded bysonal
- CL7101-Control System DesignUploaded bydhineshp
- greedy AlgorithmsUploaded byNishu Ranjan Kumar
- CTPS_suUploaded byGauravSabhahit
- Lab3 (1)Uploaded byKai Jie
- DSP Project 2016Uploaded byMohamed Ossama
- Sampling theroemUploaded byLiyana Nasarudin
- Perceptual Video Hashing Based on the Achlioptas’s Random ProjectionsUploaded byR Sandeep Nazre
- Course Learning Plan July 2017Uploaded byNoor Fatihah
- SM 56Numerical AnalysisUploaded bypavan kumar kvs

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.