www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

# CS301 All Current Mid Term Papers Spring 2013 (25 May 2013 ~ 06 June 2013) at One Place

CS301 All Current Mid Term Papers Spring 2013 (25 May 2013 ~ 06 June 2013) at One Place

From 25 May 22, 2013 to 06 June 2013 Spring 2013

Current Mid Term Papers Spring 2013 Papers, May 2013 Mid Term Papers, Solved Mid Term Papers, Solved Papers, Solved Past Papers, Solved MCQs

Views: 4481

### Replies to This Discussion

Please Share your Current Papers mid Term Papers Spring 2013 Questions/Pattern here to help each other.

Thanks

Dear all,

ek mushkil hai. plz koi help kar de. mujhe binary tree nai banna aata hai. maine kafi links dehe per samjh nai aai kuch khas. jaise question hai 50, 60, 70, 40, 30, 20, 10, 80, 90, 100.

sirf binary tree banan hai preoder, inoder postorder ya leveloder nai...

plz koi help kare meri.

per step by step.

dear ye tu simple ha sirf phle value lu ju k 50 ha ab 2nd value check kru wo 60 ha ju k 50 sy bare ha tu iss ko dain janb lak lu aur us ka link 50 k sath bna du per one by one sub ko chk kr agr koi value 50 sy chote ho ge tu wo bay janb jay ge....

plzzzzzzzzzzzzzzzz tell correct option this M.C.Q

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

► Use better data structures

► Increase the hard disk space

► Use the better algorithm

► Use as much data as we can store on the hard disk

► Increase the hard disk space

Increase the hard disk space

increase the hard disk space                        look at 2nd line of handsout on page 5

AOA

fellows

today paper is

(1) deleting node 3 marks

(2) maximum nodes of BST jo formula lagta ha woh wala tha  .....main nay to log2(n+1)-1 likha ha    2marks

(3) recursive ka program likhna tha    5 marks

(4) node of move karna tha phir us ko variable assign karna tha yh program tha    5 marks

(5)  reference ki example do or us kay benifit  likho    3marks

baki old paper main sy msq 5 aya hun gay is dafa unho nay english langue main zara changing ki ha word different use katy hain

Best of luck yaro

thanksssssssssssssss

Attention Related Mid Term papers Spring 2013: Fellows You don’t need to go any other site for current Mid Term papers Spring  2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.

.

 LIFO : Last in first out is a policy that the most recently arrived item is processed first. A stack implements this.
 FIFO : First in first out is a policy that items are processed in order of arrival. A queue implements this What is the difference between call by value and call by reference? Answer   A call to a function by value using x means (a copy of) the value that x stores is passed in the function call and no matter what the function does with that value, the value stored in xremains unchanged. A call to a function by reference using x means a reference (also called a pointer or alias) to the variable x is passed in the function call and so any changes the function makes using this reference will actually change the value stored in x.

Avantages and Disadvantages of AVL tree

The advantage of an AVL tree is that it is always balanced, guaranteeing the O(lgn) speed of the Binary Search algorithm.
The disadvantages the complex rotations used by the insertion and removal algorithms needed to maintain the tree's balance.

1

2

## Latest Activity

1 hour ago
Hamza( Graphic Designer) and Mehreen Tasneem are now friends
1 hour ago
Minahil khalid left a comment for ☞De Veloper☜♨
4 hours ago
Aijaz khan updated their profile
8 hours ago
Aijaz khan joined + M.Tariq Malik's group

### CS202 Fundamentals of Front End Development

8 hours ago
Ribqa, Muhammad Rizwan Ansari, Muhammad Imran and 3 more joined Virtual University of Pakistan
8 hours ago
8 hours ago
23 hours ago