CS301

      FINALTERM  EXAMINATION Spring 2010 CS301- Data Structures Time: 90 min Marks: 58   Question No: 1      ( Marks: 1 ) – Please choose one  A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.        ► True        ► False Question No: 2      ( Marks: 1 ) …

Assignment No. 01 SEMESTER Spring 2013 Total Marks: 20 CS301‐ Data Structures Due Date:     Instructions 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         …

(a)  Encode the phrase “voice version of verses delivered” according to the above Huffman encoding tree (Show all steps).                           [Marks 12]   Frequency and Huffman code table   Character Frequency Code sp 4 111 c 1 010111 d 2 0010 e 7 110 f 1 100100 i 3 1011 l 1 01000 n 1 0000 o 3 0011 r …

  Assignment No. 06 SEMESTER Fall 2012 CS301- Data Structures  Total Marks: 20  Due Date:  14-01-2013 InstructionsPlease read the following instructions carefully before solving & submitting assignment:It should be clear that your assignment will not get any credit (zero marks) if: The assignment is submitted after due date. The submitted assignment is other than .Doc file. The submitted assignment does …

Question No: 1      ( Marks: 1 ) – Please choose one In the statement int x[6]; , we cannot assign any value to x because x is not an lvalue.         ► True        ► False  Question No: 2      ( Marks: 1 ) – Please choose one What will be postfix expression of the following infix expression? Infix …

Solution Code   #include #include #include using namespace std; /* READ BINARY NUMBER */ stack read() { stack s; int x,n,i; cout<>n; cout< for(i=0;i>x; s.push(x); } return s; } /* DISPLAY FUNCTION */ void display(stack&s) { cout<<” “; while(!s.empty()) { cout<<s.top()<<” “; s.pop(); } } /* ADDITION OF TWO BINARY NOS.*/ stack add(stack &s1,stack &s2) { stack s; int sum,carry=0,b1,b2; …

Question. 1       (10 Marks) Consider the following MAX HEAP, represent this heap in the form of an array, start the array index from 1 instead of 0. Question 2.          (10 Marks) Consider the following array, the value on each index of this array represents the node value of a complete binary tree, you are required to create the complete binary …

Suppose you are given a string “You will receive this message in two days”, Use Huffman Encoding algorithm to create a binary tree with this string. Solution Guidelines: In step 1, You have to create a frequency table of characters along with their frequencies. In step 2: You have to create Binary Tree from letters and their frequencies created in …

Suppose some VU campuses are connected to a central server placed at Lahore campus via leased lines such that each campus has a one hop (direct) connectivity to the central server or it has multi hop connection to Lahore campus via other campuses at provincial head quarters or regional campuses which are in turn connected to the Lahore Campus. Here …

We need to store a number of Cricket Players and their Scores in a list using Linked List Data Structure. The data of the players will comprise of their Names and Scores, which means each Node of the Linked List will contain Player Name, Player Score and Next Pointer as follows, You need to write a C++ Program which contains …