DSFAST2015

of course we are deleting 1.. applying case 3.. 1. find highest key in the left subtree..in this case

Your node is the highest key on the left OR lowest key in right subtree. Apply all cases to delete

Salam, Can some one please explain the solution of Q4 in Exercise 11!

I think you need to get the latest version of the handout from the course website. On Sun, Jun 7,

it is not possible becoz operands are 2 and operators are also two. here operands should be 3. but if

So if index 5 has: 34,32,45,12,46,78 there are 5 collisions. If you add at index 1, and suppose

Mam in chaining, if a key is mapping to the index which is already occupied by TWO keys so will the

Yes, you can as long as its only one A4 sheet. Mehreen -------- Original message -------- From Burhan

yes.. we did chaining,linear and quadratic probing.. On Sunday, 7 June 2015 15:54:50 UTC+5, Ahsan

Got it Thank you On Sun, Jun 7, 2015 at 2:32 PM, Hassan Mirza <hassanm...@gmail.com> wrote:

Hafsa, I do not understand your question but max heap and min heap are both complete trees. So make

Mam please allow atleast 2 A4 size pepers. Because it is very difficult to write all the rules on 1

Saddam, the placement of i is not correct. Your tree doesnot satisfy inorder. Zain's solution is

Hamza, generally a BST implies unique keys. In case there is a modified version of BST that allows

Hamza Everything we did in class is included. So yes, both traversals and implementation are included

Dear students There has been a misprint in the final exam. You have to answer on the provided

Ahsan Please see the question carefully. It is a requirement of the question that it should '

Asim Everything on red black trees including insertion, deletion and coding is included in the exam

Dear students Please download the red black tree insertion slides again. There was a mistake in slide

For those students looking for more exercise questions, please see the practice questions in the

Mam,can you suggest some useful reference to Heaps.

The file you just uploaded has my correct marks. Thanks On Monday, June 1, 2015 at 2:55:23 PM UTC+5,

Updated semester result is attached for both sections. Good luck with the final exam. Mehreen

Great. Hafsa, your answer is correct. DFS : 1,11,16,2,6,7,30,5,10,20 BFS: 1,11,16,2,6,7,30,5,20,10

Sir Please give me time today as I was unable to come to university on Friday due to severe illness.

Maam after my queries in assignment 4 my marks are 22 in assignment 5 marks are 23 so kindly correct

Can I meet you tomorrow mam? On Friday, May 29, 2015 at 1:40:52 PM UTC+5, rabia...@gmail.com wrote:

Dear students I am attaching the semester result that has been compiled so far. NOTE: There are some

Maam where we can meet maam rabia between 4-5.30 today ? On Friday, May 29, 2015 at 8:30:05 AM UTC+5,

Regards, Rabia