.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

CS301 ALL Current Mid Term Papers Fall 2016 And Past Mid Term Papers at One Place from 17 December 2016 to 29 December 2016

This Content Originally Published by a member of VU Students.

Views: 1018

See Your Saved Posts Timeline

Replies to This Discussion

No automatic alt text available.

No automatic alt text available.

No automatic alt text available.

No automatic alt text available.

No automatic alt text available.

No automatic alt text available.

Image may contain: text

No automatic alt text available.

No automatic alt text available.

Image may contain: text

No automatic alt text available.

Mara paper tu bht mushkal aya...
Q... Write a code of inorder traversal...5 marks
Q...write postfix A*(B-C)/D in following
Symble........postfix......stack
Marks 5
Q...write code of linked list to get first element..marks 3
Q...write the output of the given code...code yaaad nae...3 marks
Q...postorder traversal of given tree...2 marks
Q....inorder nd postorder traversal of given tree...
Root 15....left node...2...right node...11....2 marks
Mcq's. Half from Old paper ndhalf new ones
CS 301
Q1: In AVL insertion. What are cases in which cases in which single rotation is possible?
Q2: Suppose we want 2 find a name in a directory having 100000 entries. What is the best method linear or non-linear.
Q3: ab-cd. Post fix method.
Q4:Write linked list function to remove-first () to remove the first element of linked list.
fall 2016 current paper
CS301 ( )
Disadvantages of AVL
Uses of Priority of Q
AVL placement without step
binary search tree
data structure and array data structure

Mcqs were easy,

Questions were about  Draw Binary Search Tree

-Draw Binary Search Tree

-Difference between circularly and linked list, doubly linked list

-Draw Balanced Binary Tree

-2 codes were given.. one with * and one without * tell the difference

-Evaluate postfix expression using Stack

-How many rotations will balance a tree if new node is added to the left subscript 

CS301 paper...20.12.2016
mcq's ziada tr past paper ma sa thy
Q. what is strictly binary tree? 2 marks..
Q. (a) give 2 advantage of linked list over array? 3 marks
(b) in which case binary search tree is used singly linked list?
Q. write code for inserting new node in double linked list? 2 marks
Q. write code for deleting a node that have right subtree
and left subtree,? 3marks
Q. digram di gy thy AVL tree ki...preorder or postorder k bary ma question tha...ab thak sa yad nh ? 5 marks

RSS

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

+ More Categorizes

© 2017   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service