| Are u studying these things ?? | |
|
|
Author | Message |
---|
RC Active member
| Subject: Are u studying these things ?? Thu Mar 18, 2010 12:05 pm | |
| 1. Tower of Hanoi Prog ( Cant find it in stack chap of Sumita Arora) 2. Circular Queue 3. Deque 4. Tree - Programs 5. Link Lists - Programs 6. Quick Sort -Program 7. Merge Sort - program 8. Insertion Sort - program |
|
| |
G-7 Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 12:30 pm | |
| 4. Tree - Programs 5. Link Lists - Programs 6. Quick Sort -Program 7. Merge Sort - program 8. Insertion Sort - program yes..!! others NO WAY....!! |
|
| |
saif Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 2:26 pm | |
| i have not done Quick Sort -Program yet and i won't do (Tree - Programs) and (Link Lists - Programs) but i have done their algos.Their programs are removed from syllabus from this year(our sir told us){ONLINE SYLLABUS MIGHT BE OUTDATED}
what have you ppl done from big O(Complexity).I have not done that chap. in details.. |
|
| |
G-7 Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 2:31 pm | |
| me too saif..i have not done it..! |
|
| |
saif Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 2:35 pm | |
| In big o
i have done definition of
BIG O COMPLEXITY dominant term best average worst complexity
and method to calc complexity of simple loops,nested loops and if else statement... |
|
| |
WinRrule Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 9:41 pm | |
| hey do we need to search for the item if we want to delete the first node in the linked list? |
|
| |
mohan123
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 9:46 pm | |
| dude anyone pls tell me what is important in data structures !!!! |
|
| |
Uber Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 9:48 pm | |
| algos of pop & push .....Mohan123 |
|
| |
G-7 Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 9:57 pm | |
| @WinrRule: The first check that we do will be the final chck..! but we still have to write the whole checking program as we do not know if the item is present in the first node.? |
|
| |
mohan123
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 10:00 pm | |
| what abt trees !!!UberSoldat |
|
| |
WinRrule Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 10:02 pm | |
| - G-7 wrote:
- @WinrRule: The first check that we do will be the final chck..! but we still have to write the whole checking program as we do not know if the item is present in the first node.?
but if u hav to delete the first node then? |
|
| |
G-7 Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 10:17 pm | |
| Ok..first u search for the node corresponding to ur target...assuming that u dont know where it is. Do u follow Sumita Arora's text..? Then u can see that the item is compared to the Start.getdata(). If equal, its deleted and u jump out of the loop. Else you keep traversing and checking at the same time so that at the instant u find the item, u break free. |
|
| |
hima Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 10:53 pm | |
| anyone online........................pls help me i have some doughts in geo |
|
| |
shreyk
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 10:54 pm | |
| i dnt assure of thes thingz but my teacher told tht they r probable.... merge sort... big o notation one program on inheritence is sure shot.. n recurrsion (factorial or conversion of bases) may b..GCD linked lists n BST only algorithms |
|
| |
G-7 Active member
| Subject: Re: Are u studying these things ?? Thu Mar 18, 2010 11:00 pm | |
| thanks shreyk |
|
| |
Sponsored content
| Subject: Re: Are u studying these things ?? | |
|
|
|
| |
| Are u studying these things ?? | |
|