Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Who's Online 0

Don't Hesitate for ask Question, post your assignment with hope you will find best solution.

CS301 Assignment no 2 Solution and Discussion

ansaraliansarali Posts: 25,240
edited May 2019 in CS301 - Data Structures


Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit (zero marks) if:

o       The assignment is submitted after due date.

o       The submitted code does NOT compile.

o       The submitted assignment is other than .CPP file.

o       The submitted assignment does NOT open or file is corrupted.

o       The assignment is copied (from other student or ditto copy from handouts or internet).

Uploading instructions

For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.


Note: Use ONLY Dev-C++ IDE.


The objective of this assignment is


o  To make you familiar of Programming with Stack Data Structure.

o  Evaluating Postfix expression using Stack


For any query about the assignment, contact at [email protected]




  • ansaraliansarali Posts: 25,240
    Paper 1:
    19 Mcqs from past mostly .
    1. Three association of data structure 3 marks
    2. if delete the root node then which node take place 3 marks
    3. AVL tree add two nodes and balance 5 marks
    4. binary tree 5 marks
    5. code was given and we have to modify it by taking prime number output.

    Question 1 Inorder was given write

    the left child .
    2. What are the function of current and head
    3. A program was given about reference and
    identity the errors in program.
    4.Make a node x between p and q node In
    link list .and also write the c++ statement to
    add the node and current pointer point to x .
    5 .A tree was given and make a binary
    search tree with in order traversal .
  • ansaraliansarali Posts: 25,240
    Today final paper..

    Objective kuch past ppr sy thy
    Huffman coding
    chaining hash table
    arry implemetation
    Union by height
    or ak output likhna tha
  • ansaraliansarali Posts: 25,240
    Cs301 Today paper
    Q1.biner tree bnawa tha OS k levels btao.
    Q2.carictrics of avl tree.
    Q3.if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?
    Q.4hight of nodes if hight is 5?
    Q.6 [2 9 7 5 8] sort it.
    Q.7 ik tree tha osko array mn conert krna tha.
    Q8.crictristics of union method
    Mostly mcqs and questions are from moazz files.
  • ansaraliansarali Posts: 25,240
    1. AVL tree se aik node delete kr k rotation kr k balance krna tha 5 marks
    2. Binary tree agar sorted data ka bnana ho to kiya issue aata hai aur oska solution kya hai? 5Marks
    3. Frequency table bnana tha text ka 3 marks
    4. Insertion sort se data sort krna tha with all steps 3marks
    5. Threaded tree banana tha 5 marks
    6. Path compression se find kese easy hota hai explain krna tha 3 marks
  • ansaraliansarali Posts: 25,240
    Today CS301 paper
    Mcqs mostly from past papers
    1.Application of Hashing
    2.Transitivity relationship
    3.Deleta a node from max heap and draw again.
    4.Frequency table
    5.Program given and write about variable
    6.bubble sort after two iterations. 5 Marks
    7.Threded binary tree given and for one node write its four varaibles values
    a.left flag
    B.Right flag
    C.left pointer node.
    D.Right pointer node.
    5 Marks
    8. AVL tree after deleting one node draw Balance tree. 5 marks
    9.For furniture selling compay to customer s write
    a) What are basic operation must select for the databese system
    b)On what basic points the data structure is select for this company. 5 Marks
    10.Write and Explain Union and Find operation for Dynamic Equivalence Problem.
Sign In or Register to comment.

ACC311 ACC501 ACC311  ACC501 ACF619  ACFI619 BIF401 BIF402 BIF501 BIF601 BIF602

BIF604 BIF619 BIF720 BIF731 BIF732 BIF733 BIT701 BIT703 BIT710 BIT715 BIO101 BIO102 

BIO201 BIO202 BIO203 BIO204 BIO301 BIO302 BIO303 BIO401 BIO502 BIO503 BIO601 BIO731 

BIO732 BIO733 BIO734 BNK601 BNK603 BNK604 BNK610 BNK612 BNK619 BNK620

BNK701 BNK703 BNK704 BNK725 BNKI619 BNKI620 BT101 BT102 BT201 BT301 BT302 BT401

BT402 BT403 BT404 BT405 BT406 BT503 BT504 BT505 BT601 BT603 BT605 BT619 BT720 BT731

BT732 BT733 BT734 BT735 BTI619

CS001 CS101 CS201 CS202 CS204 CS205 CS206 CS301 CS302 CS304 CS310 CS311 CS312 CS314 CS315 CS401

CS402 CS403 CS405 CS406 CS407 CS408 CS409 CS410 CS411 CS420 CS431 CS432 CS435 CS441 CS501 CS502 

CS504 CS506 CS507 CS508 CS510 CS519 CS601 CS602 CS603 CS604 CS605 CS606 CS607 CS608 CS609 CS610

CS611 CS614 CS615 CS619 CS620 CS625 CS701 CS702 CS703 CS704 CS706 CS707 CS708 CS709 CS710 

CS711 CS712 CS713 CS716 CS718CS720 CS721 CS723 CS724 CS726 CS799 COM619 COMI619