We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Quiz No. 2

CS502 Fundamentals of Algorithms Spring 2014

Due Date 29 May 2014

Lecture 9 to 17

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 6671

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

  • In Heap Sort algorithm, Heapify procedure is ____________ in nature

  • Recursive

  • Non-Recursive




Recursive

  • Which one is not passed as parameter in Quick sort algorithm?

  • End of the array

  • Middle of the array

  • Array (containing input elements)

  • Start of the array





Middle of the array

  • _______ is a linear time sorting algorithm.

  • Merge sort

  • Radix sort

  • Quick sort

  • Bubble sort




Radix sort

  • In Sorting the key value or attribute __________ from an ordered domain.

  • Must be

  • Not always





Not always

  • A sorting algorithm is called as ________ if duplicate elements remain in the same relative position after sorting.

  • Parallel

  • O(n) algorithm

  • Stable

  • Complex




stable

  • We do not need to mathematically prove that for comparison-based sorting algorithms always takes Omega nlog(n) time.

  • True

  • False




true

RSS

Latest Activity

+ ! zεε liked zohaib iftikhar's discussion ...*...*...* AISA KABHI NA KRNA ...*...*...*
1 minute ago
+ ! zεε liked Maham Raza.'s discussion Jo Meri Mano,,Hisaab Choro..!!!!
1 minute ago
+ ! zεε liked Maham Raza.'s discussion VIP Kon.......???
1 minute ago
+ ! zεε liked Maham Raza.'s discussion Kuch Log..
1 minute ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MCM501 Advertising for Print and Electronic Media Assignment No 01 Spring 2020 Solution & Discussion in the group MCM501 Advertising for Print and Electronic Media
3 minutes ago
+M.Tariq Malik liked +M.Tariq Malik's discussion MCM501 Advertising for Print and Electronic Media Assignment No 01 Spring 2020 Solution & Discussion
3 minutes ago
+M.Tariq Malik added a discussion to the group MCM501 Advertising for Print and Electronic Media
4 minutes ago
+M.Tariq Malik posted a discussion
8 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion EDU501 School, Community and Teacher Assignment No 01 Spring 2020 Solution & Discussion Due Date: 13-06-2020 in the group EDU501 School, Community and Teacher
16 minutes ago
+M.Tariq Malik liked +M.Tariq Malik's discussion EDU501 School, Community and Teacher Assignment No 01 Spring 2020 Solution & Discussion Due Date: 13-06-2020
16 minutes ago
+M.Tariq Malik added a discussion to the group EDU501 School, Community and Teacher
17 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MGT101 Financial Accounting GDB Spring 2020 Solution & Discussion in the group MGT101 Financial Accounting
21 minutes ago

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.