CLICK HERE FOR VARIOUS NEW JOBS 
CLICK HERE FOR VARIOUS EDUCATIONAL NEWS 
CLICK HERE FOR NEW SCHOLARSHIPS 
CLICK HERE FOR ADMISSION NOTICES 
Click And Follow On Google+ To Get Updates
Please Wait 10 Seconds... OR You CanSkip

ADMISSION NOTICES
Scholarships

Scholarship-300x291

BUDGET 2014-15
budget_2014-2015
New Date Sheets
VU SOLVED ASSIGNMENTS
Recent Posts

Posts Tagged ‘past papers FALL 2006’

VU CS301- Data Structures (Session – 3 ) FINALTERM solved unsolved past papers FALL 2006

VU CS301- Data Structures (Session – 3 ) FINALTERM Solved Unsolved Past Papers FALL 2006

 

 

MIDTERM  EXAMINATION

FALL 2006

CS301 – DATA STRUCTURES (Session – 3 )

 

Marks: 40

Time: 60min

 

StudentID/LoginID:

______________________________

Student Name:

______________________________

Center Name/Code:

______________________________

Exam Date:

Wednesday, December 06, 2006

 

1.  Attempt all questions. Marks are written adjacent to each question.2.  Do not ask any questions about the contents of this examination from anyone.

a.   If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

b.   If you believe that some essential piece of information is missing, make an appropriate assumption and use it to solve the problem.

c.   Write all steps, missing steps may lead to deduction of marks.

d. All coding questions should be answered using the C ++ syntax.

You are allowed to use the Dev-C++ compiler to write and test your code.  If you do so please remember to copy and paste your code into the examination solution area. (Do NOT share your code; your colleague could get higher marks than you!!)  


**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

 

 

For Teacher’s use only

Question

1

2

3

4

5

6

7

8

9

Total

Marks

 

 

Question No: 1    ( Marks: 2 )     –  Please choose one
The new operation in C++ for dynamically allocating memory returns a pointer to an object it has just created. 

 

►  True 

 

 

 

►  False 

 

 

Question No: 2    ( Marks: 2 )     –  Please choose one
A pointer can be declared without giving it a data type to point to 

 

►  True 

 

 

 

►  False 

 

 

Question No: 3    ( Marks: 2 )     –  Please choose one
An in-order traversal visits nodes in order of descending keys. 

 

►  True 

 

 

 

 

►  False 

 

 

Question No: 4    ( Marks: 2 )     –  Please choose one
An unbalanced tree is one whose root has many more left descendents than right descendants. 

 

 

►  True 

 

 

►  False 

 

 

Question No: 5    ( Marks: 2 )     –  Please choose one
A queue allows access to the first item that was inserted. 

 

►  True 

 

 

 

►  False 

 

 

Question No: 6    ( Marks: 10 )
Write a function in C++ that will swap the second and third node in a singly linked list (having 5 nodes) by adjusting only the pointers (and not the data). You can use Node class and List class methods (such as getNext, setNext, next, get) without writing them. You can assume that the Node class and List class exists, i.e., do not write the code for these classes. The simple declaration of Node class and List class is as follow, 

class   Node

{

public:

int      get() { return   object; };

void   set(int   object) { this->object   =   object; };

 

Node   * getNext() { return   nextNode; };   //returns the next node pointer

void     setNext(Node   * nextNode) { this->nextNode   =   nextNode; }; // set the next node pointer

 

private:

int   object;

Node   * nextNode;

};

 

/* The List class */

class   List

{

public:

List(); // constructor

void   add (int   addObject);   // add the nodes in list

int     get(); // returns the value of the current node

bool   next(); // returns true if next node exist otherwise returns false

friend void  traverse(List list); // used to print the values of all the nodes in the list

void swap();

private:

int      size;

Node *   headNode;

Node *   currentNode;

Node *   lastCurrentNode;

 

};

 

void List ::swap()  // Complete this code

{

 

}

 

 

 

Question No: 7    ( Marks: 5 )
Write the output for the following 

Push the characters ‘c’, ‘d’, ‘m’, ‘a’, ‘b’ into the stack in the given order. Pop two elements from the stack one at a time. Then push two characters ‘f’, and ‘g’. Now pop all the characters. What is the result?

 

 

 

Question No: 8    ( Marks: 10 )
Convert the infix expression 2+(9-3 *2) to postfix. Show the trace of the algorithm, i.e., the stack, the infix expression and postfix expression using the following table pattern. 

Stack infix postfix

 

 

 

Question No: 9    ( Marks: 5 )
Consider the following binary tree: 

(a) Starting from the root node A, perform an In-order traversal of the binary tree below and write the letters in the nodes that will result during the visitations.

 

(b) Write the nodes if a Pre-order traversal is performed starting with node A.

 

 

 

 

 

 

 

 

VU CS301- Data Structures (Session – 3 ) FINALTERM Solved Unsolved Past Papers FALL 2006

VU CS301- Data Structures (Session – 1 ) FINALTERM solved unsolved past papers FALL 2006

VU CS301- Data Structures (Session – 1 ) FINALTERM Solved Unsolved Past Papers FALL 2006

FINALTERM  EXAMINATION

FALL 2006

CS301 – DATA STRUCTURES (Session – 1 )

 

Marks: 75

Time: 120min

 

StudentID/LoginID:

______________________________

Student Name:

______________________________

Center Name/Code:

______________________________

Exam Date:

Saturday, February 03, 2007

 

1.  Attempt all questions.2.  Do not ask any questions about the contents of this examination from anyone.

a.   If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

b.   If you believe that some essential piece of information is missing, make an appropriate assumption and use it to solve               the problem.

c.   Write all steps, missing steps may lead to deduction of marks.

d. All coding questions should be answered using the C ++ syntax.

You are allowed to use the Dev-C++ compiler to write and test your code.  If you do so please remember to copy and paste your code into the examination solution area. (Do NOT share your code)  


**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

 

 

 

For Teacher’s use only

Question

1

2

3

4

5

6

7

8

9

10

Total

Marks

Question

11

Marks

 

 

Question No: 1    ( Marks: 10 )
Draw AVL Tree by following digits 15, 4, 13, 6, 17, 2, 11 and also perform necessary rotation, while showing all the intermediate trees being created in the process. In each stage, the AVL transformation should be conducted at a discrepancy that is farthest from the root. 

 

 

 

Question No: 2    ( Marks: 10 )
Some operations are given. Show the output of the given operations step by step in form of array. 

Enqueue(13);

Enqueue(35);

Enqueue(11);

Enqueue(39);

Enqueue(9);

N = RemoveMin();

Enqueue( 51);

N = RemoveMin();

Enqueue(15);

 

 

 

Question No: 3    ( Marks: 15 )
The frequency table for letters A, B, C, D and E is given                                             Frequency Table

             

                       Character

Frequency

Huffman Code

A

8

B

12

C

49

D

20

E

11

 

A) Create a Huffman tree to determine the binary codes for each character.     (10)

B) Fill the codes into the table above.                                                              (2.5)

C) Encode the following sequence ABCDE.                                                   (2.5)

 

 

 

Question No: 4    ( Marks: 10 )
Following array is given which represents a min-heap. Insert 4 in the following array and convert it into a min-heap again. Show process steps by drawing heap trees. 

33 55 99 66 88 120 110 122 180

 

 

 

Question No: 5    ( Marks: 10 )
Write down the C++ code to implement Bubble Sort Algorithm. 

 

 

Question No: 6    ( Marks: 10 )
Create a hash table using hash table of size 10 i.e. (0-9). Insert the following values in the hash table79, 76, 75, 56, 53, 47, 48, 63, 90 and 59.

If there is any collision then insert a node in front of collision node to put the value in table e.g.

 

 

You are required to give answer in table form as shown above.

 

 

 

Question No: 7    ( Marks: 2 )     –  Please choose one
Which one is not Divide and Conquer algorithm?

►  merge sort 

 

►  quick sort 

 

►  heap sort 

 

►  none of the above 

 

 

 

Question No: 8    ( Marks: 2 )     –  Please choose one
Hash tables are very good if there are many insertions and deletions.

►  True 
►  False 

 

 

Question No: 9    ( Marks: 2 )     –  Please choose one
A table ts always a two dimensional array of same data type

►  True 
►  False 

 

 

Question No: 10    ( Marks: 2 )     –  Please choose one
When there is a collision, we try to find some other place in our array. This approach is called

►  open addressing 
►  closed hashing 
►  open addressing & closed hashing 
►  none of the above 

 

 

Question No: 11    ( Marks: 2 )     –  Please choose one
___________ is/are called nlog2n algorithm(s).

►  merge sort 

 

►  quick sort 

 

►  heap sort 

 

►        all of the above 

 

 

 

 

VU CS301- Data Structures (Session – 1 ) FINALTERM Solved Unsolved Past Papers FALL 2006

VU CS301- Data Structures (Session – 3 ) FINALTERM solved unsolved past papers FALL 2006

VU CS301- Data Structures (Session – 3 ) FINALTERM Solved Unsolved Past Papers FALL 2006

 

 

MIDTERM  EXAMINATION

FALL 2006

CS301 – DATA STRUCTURES (Session – 3 )

 

Marks: 40

Time: 60min

 

StudentID/LoginID:

______________________________

Student Name:

______________________________

Center Name/Code:

______________________________

Exam Date:

Wednesday, December 06, 2006

 

1.  Attempt all questions. Marks are written adjacent to each question.2.  Do not ask any questions about the contents of this examination from anyone.

a.   If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

b.   If you believe that some essential piece of information is missing, make an appropriate assumption and use it to solve the problem.

c.   Write all steps, missing steps may lead to deduction of marks.

d. All coding questions should be answered using the C ++ syntax.

You are allowed to use the Dev-C++ compiler to write and test your code.  If you do so please remember to copy and paste your code into the examination solution area. (Do NOT share your code; your colleague could get higher marks than you!!)  


**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

 

 

For Teacher’s use only

Question

1

2

3

4

5

6

7

8

9

Total

Marks

 

 

Question No: 1    ( Marks: 2 )     –  Please choose one
The new operation in C++ for dynamically allocating memory returns a pointer to an object it has just created. 

 

►  True 

 

 

 

►  False 

 

 

Question No: 2    ( Marks: 2 )     –  Please choose one
A pointer can be declared without giving it a data type to point to 

 

►  True 

 

 

 

►  False 

 

 

Question No: 3    ( Marks: 2 )     –  Please choose one
An in-order traversal visits nodes in order of descending keys. 

 

►  True 

 

 

 

 

►  False 

 

 

Question No: 4    ( Marks: 2 )     –  Please choose one
An unbalanced tree is one whose root has many more left descendents than right descendants. 

 

 

►  True 

 

 

►  False 

 

 

Question No: 5    ( Marks: 2 )     –  Please choose one
A queue allows access to the first item that was inserted. 

 

►  True 

 

 

 

►  False 

 

 

Question No: 6    ( Marks: 10 )
Write a function in C++ that will swap the second and third node in a singly linked list (having 5 nodes) by adjusting only the pointers (and not the data). You can use Node class and List class methods (such as getNext, setNext, next, get) without writing them. You can assume that the Node class and List class exists, i.e., do not write the code for these classes. The simple declaration of Node class and List class is as follow, 

class   Node

{

public:

int      get() { return   object; };

void   set(int   object) { this->object   =   object; };

 

Node   * getNext() { return   nextNode; };   //returns the next node pointer

void     setNext(Node   * nextNode) { this->nextNode   =   nextNode; }; // set the next node pointer

 

private:

int   object;

Node   * nextNode;

};

 

/* The List class */

class   List

{

public:

List(); // constructor

void   add (int   addObject);   // add the nodes in list

int     get(); // returns the value of the current node

bool   next(); // returns true if next node exist otherwise returns false

friend void  traverse(List list); // used to print the values of all the nodes in the list

void swap();

private:

int      size;

Node *   headNode;

Node *   currentNode;

Node *   lastCurrentNode;

 

};

 

void List ::swap()  // Complete this code

{

 

}

 

 

 

Question No: 7    ( Marks: 5 )
Write the output for the following 

Push the characters ‘c’, ‘d’, ‘m’, ‘a’, ‘b’ into the stack in the given order. Pop two elements from the stack one at a time. Then push two characters ‘f’, and ‘g’. Now pop all the characters. What is the result?

 

 

 

Question No: 8    ( Marks: 10 )
Convert the infix expression 2+(9-3 *2) to postfix. Show the trace of the algorithm, i.e., the stack, the infix expression and postfix expression using the following table pattern. 

Stack infix postfix

 

 

 

Question No: 9    ( Marks: 5 )
Consider the following binary tree: 

(a) Starting from the root node A, perform an In-order traversal of the binary tree below and write the letters in the nodes that will result during the visitations.

 

(b) Write the nodes if a Pre-order traversal is performed starting with node A.

 

 

 

 

 

 

 

 

VU CS301- Data Structures (Session – 3 ) FINALTERM Solved Unsolved Past Papers FALL 2006

ALL NEW RESULTS
Educational News

Updated Educational News

Categories
POSTS BY DATE
December 2016
M T W T F S S
« Sep    
 1234
567891011
12131415161718
19202122232425
262728293031