Sadev.co.za

      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...

2 mark Questions: 1. max heapis sorted in array H=50,40,37,32,28,22,36,13 2.what are AVL insertion in which single rotation is successful? 3. What is skip list? 4.In array representation of union operation , what -1 represent on a particular index...

I did my homework, and it says that dynamic data structures are "data structures that change in size as a program needs it to by allocating and de-allocating memory from the heap". So I was wondering, are PHP arrays examples of dynamic data structures...

Binary Tree Structure -- a quick introduction to binary trees and the code that operates on them Reading about a data structure is a fine introduction, PDF format binary-trees-stanford-cs-ed-library.pdf [...]

I've been studying up on a computer science question that burned me on a 2nd interview code-test after a very successful 1st interview. Otherwise, I would've considered it a slam-dunk. Basically, I was to implement minesweeper, using lattice cells,...