2.1K views

Uploaded by Amandeep Gupta

Test

- Problem 4
- Crypto_Week 2 HW
- Week4 Quiz Feedback
- coursera2
- Coursera Quiz Week2 Fall 2012
- Coursera Quiz Week1 Spring 2014 Heterogeneous Programming
- Cryptography Quiz -1
- Coursera Week 3 cryptographie
- Coursera Quiz Week3 Fall 2012
- Software Myths (Software Project Management)
- Week3 Feedback
- Week 1 Quiz _ Coursera_answ
- Minimizing DFA C Program
- Character Stuffing
- cryptography
- Final Exam_Crypto 1_Attempt1.pdf
- Maggi Noodles history
- UserGuideVitaminC.pdf
- Quiz2
- Coursera Quiz 4

You are on page 1of 3

You submitted this quiz on Thu 28 Feb 2013 10:59 AM CET. You got a score of

5.00 out of 5.00.

Question 1

Consider a directed graph with distinct and nonnegative edge lengths and a source vertex s.

Fix a destination vertex t, and assume that the graph contains at least one s-t path. Which of

the following statements are true? [Check all that apply.]

Your Answer

Score

"simple" or "loopless" such path).

0.25

many as n 1 edges, where n is the number of vertices.

0.25

edge of G.

0.25

edge of G.

0.25

Total

Explanation

1.00 /

1.00

Question 2

Consider a directed graph

G = (V , E)

edges that leave the source vertex s have arbitrary (possibly negative) lengths; all other edge

lengths are nonnegative; and there are no edges from any other vertex to the source s. Does

Dijkstra's shortest-path algorithm correctly compute shortest-path distances (from s) in this

graph?

Your

Score

Explanation

1.00

videos still works. A slicker solution is to notice that adding a

Answer

Always

of every s-v path by exactly M , and thus preserves the shortest

path.

Total

1.00 /

1.00

Question 3

Suppose you implement the functionality of a priority queue using a sorted array (e.g., from

biggest to smallest). What is the worst-case running time of Insert and Extract-Min,

respectively? (Assume that you have a large enough array to accommodate the Insertions that

you face.)

Your Answer

(n)

and

(1)

Score

Total

Explanation

1.00

1.00 / 1.00

Question 4

Suppose you implement the functionality of a priority queue using an unsorted array. What is

the worst-case running time of Insert and Extract-Min, respectively? (Assume that you have a

large enough array to accommodate the Insertions that you face.)

Your Answer

(1)

Total

and

(n)

Score

1.00

1.00 / 1.00

Explanation

Question 5

You are given a heap with

O(log n)

time?

Your Answer

Find the fifth-smallest element stored in the heap.

Total

Score

1.00

1.00 / 1.00

Explanation

- Problem 4Uploaded byshivam_mittal_3
- Crypto_Week 2 HWUploaded byParamesh King
- Week4 Quiz FeedbackUploaded bymehtav23
- coursera2Uploaded byVlad Doru
- Coursera Quiz Week2 Fall 2012Uploaded bySoumyajit Das
- Coursera Quiz Week1 Spring 2014 Heterogeneous ProgrammingUploaded bymrclueless
- Cryptography Quiz -1Uploaded byCristin Baciu
- Coursera Week 3 cryptographieUploaded byshahidoxx
- Coursera Quiz Week3 Fall 2012Uploaded bySoumyajit Das
- Software Myths (Software Project Management)Uploaded byGeshan Manandhar
- Week3 FeedbackUploaded byAbhishek Das
- Week 1 Quiz _ Coursera_answUploaded byMarco Ermini
- Minimizing DFA C ProgramUploaded byrnspace
- Character StuffingUploaded byubaid_saudagar
- cryptographyUploaded byfast_furious_devil
- Final Exam_Crypto 1_Attempt1.pdfUploaded byParamesh King
- Maggi Noodles historyUploaded byMarivic Cheng Ejercito
- UserGuideVitaminC.pdfUploaded bybinosp2
- Quiz2Uploaded byPramod Srinivasan
- Coursera Quiz 4Uploaded bySubodh Mayekar
- Spatial ConvolutionUploaded bydeysanz
- Quiz 2Uploaded byManuel Humberto Marquez Gutierrez
- Quiz Feedback _ CourseraUploaded byVictoriaLukyanova
- SPOJ ClassicalUploaded byazharh_36
- nfa to dfa c codeUploaded byMaz Har Ul
- Using UML Library Handout DiagramsUploaded bylitpengu
- Computer Organization Hamacher Instructor Manual solution - chapter 5.pdfUploaded bytheachid
- Higher Engineering Mathematics-BS GrewalUploaded byAvinash Atre
- gephi-tutorial-visualization.pdfUploaded bytonitt
- Fortran 90 - ReferenceUploaded byBoud Elhassan

- ADA 2 Mansol ch24- 367-378Uploaded bySabrina Devintasari
- Final ReportUploaded byNeha Chaudhari
- dijkstraUploaded byAsha Seghu
- Graph Theory for DummiesUploaded byBharvi Dixit
- Cable Trench ProblemUploaded byRurouni Kenshin
- CombinatorialOptimizationUploaded byHenne Popenne
- Clrs Sol Chap 1517Uploaded bypseudoworkoholic
- 2 MarksUploaded bysiswariya
- 74LS181Uploaded byGerson Suarez Chiclin
- p135-malewiczUploaded byJJ EB
- Heuristic Design Support Methodology Based on Graph Theory for District Metering of Water Supply NetworksUploaded byRoger Utrilla
- mod02Uploaded byWolf's Rain
- GUITAR FINGERING FOR MUSIC PERFORMANCE.pdfUploaded bydevonchild
- CS502QuizSolvedForFinalTermPreparation (1)Uploaded byMaaz Bin Rizwan
- Dijkstra’s Algorithm Shortest PathUploaded byhanhnd_54
- Inf3380 FloydUploaded byLuis Tena
- cnlabmanualUploaded byprasad457
- GATE QuestionsUploaded byDebayan Biswas
- Algorithm Design By Jon Kleinberg and Eva TardosUploaded byKiran Nanjundaswamy
- Chap24 SolutionsUploaded byForm 4B
- GPS Navigation system using neural networksUploaded bySundeep Chopra
- Operations Research Network Problems 23848Uploaded byPramit Dash
- Bellman FordUploaded byacharya_s2005
- Transportation Engineering ManagementUploaded byvenugopag
- Bebber, D. P. Et Al (2007) Biological Solutions to Transport Network DesignUploaded byNúria Espinet
- 05565545Uploaded bySrivalli Murthy
- 5153 DESIGN and ANALYSIS of ALGORITHMS Anna University Previous Year Question PaperUploaded byarumugam1984293269
- Ilinth2 AllUploaded byStephen Hartanto
- undirected lect10-15Uploaded byWondimu Kassahun
- Network Routing Problem in MultigraphUploaded byIRJCS-INTERNATIONAL RESEARCH JOURNAL OF COMPUTER SCIENCE