Sponsored Links


Results 1 to 2 of 2

Thread: cs502 fundamentals of algorithms quiz mcq, fall 2010 november 12

  1. #1
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,251

    Icon14 cs502 fundamentals of algorithms quiz mcq, fall 2010 november 12

    Sponsored Links




    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 73
    sec(s)
    Question # 1 of 10 ( Start time: 08:20:18 PM ) Total Marks: 1
    In stable sorting algorithm:
    Select correct option:
    One array is used
    In whcih duplicating elements are not handled.
    More then one arrays are required.
    Duplicating elements remain in same relative posistion after sorting.
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 80
    sec(s)
    Question # 2 of 10 ( Start time: 08:20:48 PM ) Total Marks: 1
    Counting sort is suitable to sort the elements in range 1 to k:
    Select correct option:
    K is large
    K is small
    K may be large or small
    None
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 54
    sec(s)
    Question # 3 of 10 ( Start time: 08:21:07 PM ) Total Marks: 1
    Counting sort has time complexity:
    Select correct option:
    O(n)
    O(n+k)
    O(k)
    O(nlogn)
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 71
    sec(s)
    Question # 4 of 10 ( Start time: 08:21:57 PM ) Total Marks: 1
    In in-place sorting algorithm is one that uses arrays for storage :
    Select correct option:
    An additional array
    No additioanal array
    Both of above may be true according to algorithm
    More than 3 arrays of one dimension.
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 83
    sec(s)
    Question # 5 of 10 ( Start time: 08:22:23 PM ) Total Marks: 1
    Memoization is :
    Select correct option:
    To store previous results for further use.
    To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later
    To make the process accurate.
    None of the above
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 18
    sec(s)
    Question # 6 of 10 ( Start time: 08:22:37 PM ) Total Marks: 1
    Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
    Select correct option:
    There is explicit combine process as well to conquer the solutin.
    No work is needed to combine the sub-arrays, the array is already sorted
    Merging the subarrays
    None of above.
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 85
    sec(s)
    Question # 7 of 10 ( Start time: 08:23:56 PM ) Total Marks: 1
    Which sorting algorithn is faster :
    Select correct option:
    O(n^2)
    O(nlogn)
    O(n+k)
    O(n^3)
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 78
    sec(s)
    Question # 8 of 10 ( Start time: 08:24:05 PM ) Total Marks: 1
    In Quick sort algorithm,constants hidden in T(n lg n) are
    Select correct option:
    Large
    Medium
    Not known
    small
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Time Left 75
    sec(s)
    Quiz Start Time: 08:20 PM
    Question # 9 of 10 ( Start time: 08:24:22 PM ) Total Marks: 1
    Quick sort is
    Select correct option:
    Stable and In place
    Not stable but in place
    Stable and not in place
    Some time in place and snd some time stable
    Click here to Save Answer & Move to Next Question
    MC090406319 : Tayyaba Hameed
    Quiz Start Time: 08:20 PM
    Time Left 75
    sec(s)
    Question # 10 of 10 ( Start time: 08:24:42 PM ) Total Marks: 1
    The running time of quick sort depends heavily on the selection of
    Select correct option:
    No of inputs
    Arrangement of elements in array
    Size o elements
    Pivot element
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 81
    sec(s)
    Question # 1 of 10 ( Start time: 08:29:43 PM ) Total Marks: 1
    In in-place sorting algorithm is one that uses arrays for storage :
    Select correct option:
    An additional array
    No additioanal array
    Both of above may be true according to algorithm
    More than 3 arrays of one dimension.
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 85
    sec(s)
    Question # 2 of 10 ( Start time: 08:29:59 PM ) Total Marks: 1
    Memoization is :
    Select correct option:
    To store previous results for further use.
    To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later
    To make the process accurate.
    None of the above
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 80
    sec(s)
    Question # 3 of 10 ( Start time: 08:30:11 PM ) Total Marks: 1
    In Quick sort algorithm,constants hidden in T(n lg n) are
    Select correct option:
    Large
    Medium
    Not known
    small
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 82
    sec(s)
    Question # 4 of 10 ( Start time: 08:30:31 PM ) Total Marks: 1
    Which sorting algorithn is faster :
    Select correct option:
    O(n^2)
    O(nlogn)
    O(n+k)
    O(n^3)
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 74
    sec(s)
    Question # 5 of 10 ( Start time: 08:30:44 PM ) Total Marks: 1
    In stable sorting algorithm:
    Select correct option:
    One array is used
    In whcih duplicating elements are not handled.
    More then one arrays are required.
    Duplicating elements remain in same relative posistion after sorting.
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 82
    sec(s)
    Question # 6 of 10 ( Start time: 08:31:04 PM ) Total Marks: 1
    Counting sort is suitable to sort the elements in range 1 to k:
    Select correct option:
    K is large
    K is small
    K may be large or small
    None
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Time Left 80
    sec(s)
    Quiz Start Time: 08:29 PM
    Question # 7 of 10 ( Start time: 08:31:19 PM ) Total Marks: 1
    Quick sort is
    Select correct option:
    Stable and In place
    Not stable but in place
    Stable and not in place
    Some time in place and snd some time stable
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 69
    sec(s)
    Question # 8 of 10 ( Start time: 08:31:35 PM ) Total Marks: 1
    Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
    Select correct option:
    There is explicit combine process as well to conquer the solutin.
    No work is needed to combine the sub-arrays, the array is already sorted
    Merging the subarrays
    None of above.
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 83
    sec(s)
    Question # 9 of 10 ( Start time: 08:32:03 PM ) Total Marks: 1
    Counting sort has time complexity:
    Select correct option:
    O(n)
    O(n+k)
    O(k)
    O(nlogn)
    Click here to Save Answer & Move to Next Question
    MC090406557 : Nadia Parveen
    Quiz Start Time: 08:29 PM
    Time Left 78
    sec(s)
    Question # 10 of 10 ( Start time: 08:32:15 PM ) Total Marks: 1
    one example of in place but not stable sort is :
    Select correct option:
    Quick
    Heap
    Merge
    Bubble
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 74
    sec(s)
    Question # 1 of 10 ( Start time: 08:38:06 PM ) Total Marks: 1
    The running time of quick sort depends heavily on the selection of
    Select correct option:
    No of inputs
    Arrangement of elements in array
    Size o elements
    Pivot element
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 82
    sec(s)
    Question # 2 of 10 ( Start time: 08:38:33 PM ) Total Marks: 1
    Counting sort has time complexity:
    Select correct option:
    O(n)
    O(n+k)
    O(k)
    O(nlogn)
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 86
    sec(s)
    Question # 3 of 10 ( Start time: 08:38:46 PM ) Total Marks: 1
    Memoization is :
    Select correct option:
    To store previous results for further use.
    To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later
    To make the process accurate.
    None of the above
    Click here to Save Answer & Move to Next Question
    c
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 79
    sec(s)
    Question # 4 of 10 ( Start time: 08:38:55 PM ) Total Marks: 1
    In stable sorting algorithm:
    Select correct option:
    One array is used
    In whcih duplicating elements are not handled.
    More then one arrays are required.
    Duplicating elements remain in same relative posistion after sorting.
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Time Left 71
    sec(s)
    Quiz Start Time: 08:38 PM
    Question # 5 of 10 ( Start time: 08:39:13 PM ) Total Marks: 1
    one example of in place but not stable sort is :
    Select correct option:
    Quick
    Heap
    Merge
    Bubble
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 79
    sec(s)
    Question # 6 of 10 ( Start time: 08:39:35 PM ) Total Marks: 1
    In Quick sort algorithm,constants hidden in T(n lg n) are
    Select correct option:
    Large
    Medium
    Not known
    small
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 80
    sec(s)
    Question # 7 of 10 ( Start time: 08:39:51 PM ) Total Marks: 1
    Quick sort is
    Select correct option:
    Stable and In place
    Not stable but in place
    Stable and not in place
    Some time in place and snd some time stable
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 73
    sec(s)
    Question # 8 of 10 ( Start time: 08:40:06 PM ) Total Marks: 1
    Which sorting algorithn is faster :
    Select correct option:
    O(n^2)
    O(nlogn)
    O(n+k)
    O(n^3)
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 82
    sec(s)
    Question # 9 of 10 ( Start time: 08:40:28 PM ) Total Marks: 1
    Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
    Select correct option:
    There is explicit combine process as well to conquer the solutin.
    No work is needed to combine the sub-arrays, the array is already sorted
    Merging the subarrays
    None of above.
    Click here to Save Answer & Move to Next Question
    BC070400619 : M. AATIF ALI
    Quiz Start Time: 08:38 PM
    Time Left 81
    sec(s)
    Question # 10 of 10 ( Start time: 08:40:43 PM ) Total Marks: 1
    Counting sort is suitable to sort the elements in range 1 to k:
    Select correct option:
    K is large
    K is small
    K may be large or small
    None
    Click here to Save Answer & Move to Next Question

    Sponsored Links

  2. #2
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,251

    Icon16

    Do find the attachment for latest quiz and mcq's
    Attached Files Attached Files

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Replies: 1
    Last Post: 12-02-2014, 10:40 PM
  2. Replies: 0
    Last Post: 01-28-2013, 03:22 PM
  3. CS502 Fundamentals of Algorithms Online Quiz No. 1 Fall Semester 2012
    By Vuhelper in forum MCQ's & Quiz Discussion
    Replies: 0
    Last Post: 11-12-2012, 03:05 PM
  4. Replies: 0
    Last Post: 11-03-2012, 03:18 PM
  5. Replies: 1
    Last Post: 01-23-2011, 02:54 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
-: Vuhelp Disclaimer :-
None of the files shown here are hosted or transmitted by this server. The links are provided solely by this site's users. The administrator's or staff of Vuhelp.net cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms. If you have any doubts about legality of content or you have any suspicions, feel free to contact us.
Online Education | JhelumSoft