Skip to content

CS301 – Data Structures

Home › Forums › Subject-wise Discussion › CS301 – Data Structures

Tagged: , , , , , ,

Viewing 6 posts - 1 through 6 (of 6 total)
  • Author
    Posts
  • May 29, 2024 at 5:40 am #936
    Prof Shoaib
    Keymaster

    This is the platform for helping other subject fellows, you can discuss your midterm and final term papers. And also you are welcome to share all problems related to CS301.

    “Sharing is Caring”.

    June 2, 2024 at 1:23 pm #1262
    Prof Shoaib
    Keymaster

    CS301 Final term
    Paper bht tough aya tha, last lectures 40 -45 sa bht zda aya selection sort bubble sort,max heap , postorder bst tha uska Avl tree construct krna tha, delete a node from bst, two document types of Huffman coding

    June 4, 2024 at 2:13 pm #1276
    Prof Shoaib
    Keymaster

    CS301 Midterm 01-06-204
    in order post order pre order waly 3,4 mcqs thy
    1 long question tha
    time base and event base simulation long question tha
    2 Binary tree bnany thy value given thi
    Paper bhot easy tha

    June 4, 2024 at 2:14 pm #1277
    Prof Shoaib
    Keymaster

    CS301 Midterm Spring 2024
    MCQs mark r dosri files sy mix aiy thy mushkil ni thy easy thy short mei ek program ki out put btnani thi org*Val wala program tha .
    Ek quest the Fifo kue use krty hein r b part mei tha queue ki list btani thi .
    Ek short mei pop() r Puch() ka code likhna tha.
    Long mei b ek org*Val minus -7 wala program tha iski out put btani thi .
    Ek quest mei arrAy diay thy uni mei get(),length(),next() btna tha.
    Ek long program tha void r 2 cheezein thi uska program bnana tha wo mei bhol gye over all paper easy tha tree wegra Kuch ni aya mera

    June 4, 2024 at 2:16 pm #1278
    Prof Shoaib
    Keymaster

    CS301 30/5/24 Midterm
    Mcqz were vey easy mny sirf 2 files ki thi VU topper and Junaid mostly isi ma sy hi thy easy thy
    Long:
    1- Complete missing code
    2- write the output of the code
    3- Write code for remove()
    Short:
    1- Difference between time based – event based simulation
    2- Consider the code is valid or invalid?
    3- Tree data given thy numbers in order- post order traversal which value in the left child of the root?
    Overall paper easy tha Allhamdulillah
    BEST OF LUCK

    June 4, 2024 at 2:17 pm #1279
    Prof Shoaib
    Keymaster

    CS301 Midterm Spring 2024
    overall paper was good.
    mcqs Kuch files se the or baaki Kuch conceptual the. Subjective part me short:
    1: aik postfix expression ki final stack value find kerni thi.
    2: binary tree with string me nodes kaise organize kerte hain Kuch is type question tha.
    3: aik code ki output find kerni thi

    FOR LONG:
    1: difference between binary tree and BST.
    2: Kuch infix expressions the unko postfix me convert kerna tha (5) the.
    3: aik postfix expression ki evaluation kerni thi.
    Conclusion: Tree wale or pre post infix wale concepts ache se clear kerein.
    Wish u goodluck🤞🏻

  • Author
    Posts
Viewing 6 posts - 1 through 6 (of 6 total)
  • You must be logged in to reply to this topic.