Home / CS502 Fundamentals of Algorithms

CS502 Fundamentals of Algorithms

CS502 Today term papers .

This topic contains 1 reply, has 1 voice, and was last updated by Profile photo of Aryan Ahmad Aryan Ahmad 1 month ago.

Viewing 2 posts - 1 through 2 (of 2 total)
  • Author
    Posts
  • #2136
    Profile photo of Aryan Ahmad
    Aryan Ahmad
    Participant

    today is my cs 502 paper its difficult one some mcqs from moaz file the subjective are
    1:T(N)=2T(N &2)+1 T(1)=1 SHOW COMPLEXITY RECURRENCE
    2:MERGE SHORT ALGORITHM STABLE OR IN PLACE
    3:WHY GRAPH IS USED VISUALIZING 2D MAXIMA
    4:i=(N+1)(N+2)/2
    5:STEP IN DYNAMIC PROGRAMMING
    6:QUICK SORT ALGORITHM

    #2181
    Profile photo of Aryan Ahmad
    Aryan Ahmad
    Participant

    CS502

    today is my cs 502 paper its difficult one some mcqs from moaz file the subjective are
    1:T(N)=2T(N &2)+1 T(1)=1 SHOW COMPLEXITY RECURRENCE
    2:MERGE SHORT ALGORITHM STABLE OR IN PLACE
    3:WHY GRAPH IS USED VISUALIZING 2D MAXIMA
    4:i=(N+1)(N+2)/2
    5:STEP IN DYNAMIC PROGRAMMING
    6:QUICK SORT ALGORITHM

    • This reply was modified 1 month ago by Profile photo of Aryan Ahmad Aryan Ahmad.
Viewing 2 posts - 1 through 2 (of 2 total)

You must be logged in to reply to this topic.

Share with Friends