Saturday 26 November 2011

::::|| VU ||:::: today paper cs301



-today paper of cs301 all mcqz were from past papaer 

why queue is linear data structure.

how we can delete a node having 2 childs in bt.

2 codes were given to find errors and commenteach line

preorder inorder tree were given 

defie const keyword, reference variable , Dangling reference



ZinDgi ji

--
For study materials, past papers and assignments,
Join VU School at www.VusCool.com
and www.VUGuys.com
CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/coool_vu_students?hl=en

No comments:

Post a Comment