16
edits
User:Dildar Sk: Difference between revisions
Jump to navigation
Jump to search
→Y: Your task
| Line 173: | Line 173: | ||
* Please provide a rough estimated timeline for your work on the task. | * Please provide a rough estimated timeline for your work on the task. | ||
*: During Google Summer of Code, I would work 60 hours per week. This is my rough estimated timeline: | *: During Google Summer of Code, I would work 60 hours per week. This is my rough estimated timeline: | ||
*: ''' | *: '''community bonding period '''(Before May 14): | ||
*: ''' | *::i) I will try to refresh my idea of Octave's codebase first.Start to know the | ||
* | *:: other guys,developer and mentors.Will start to interacting with them. | ||
*:: | *::ii) I will study readline library thoroughly.Will try to strengthen knowledge | ||
*:: | *:: on GDB,make auto-tool. | ||
*:: '''Week | *::iii) Will try to implement some missing functions which is | ||
*:: not available in Octave but on MATLAB. | |||
*: '''Phase 1 ''' (May14-june15) | |||
*: ''' week 1 '''(May 14-21): | |||
*::i) Will put all permanent symbols(Keywords,function name) in a .txt file. | |||
*:: And other's directory based symbols will be put in a temporary .txt file. | |||
*:: The temporary .txt will be changed as directory changes. | |||
*::ii)Start implementing closest match of a incorrect keyword by Longest Common Subsequence,Dynamic Programming algorithm. | |||
*: ''' Week 2 '''(May21-28): | |||
*: This is a very rough timeline. The exact steps will become clearer when I do some more discussion with the mentors. | *::i) Completion of LCS based closest keyword implementation. | ||
*::ii) Testing previous implementations. | |||
*::iii) Implementing closest match of a keyword by hash-mapping data structure. | |||
*:: Testing previous implementations. | |||
*: ''' Week 3 & 4 ''' (May 28-june 11) | |||
*: '''week 3 '''(May 28-june 4): | |||
*::i) Testing previous implementation. | |||
*::ii) Creating a API which will allow user to choose anyone based closest. | |||
*::iii)Start implementing trie based closest match of a keyword. | |||
*: '''Week 4 '''(june 5-11): | |||
*::i) Completion of Trie based nearest of a keyword implementation. | |||
*::ii) Writing documentation. | |||
*: ''' June 11-15 ''': | |||
'''Phase 1 evaluation.''' | |||
*: ''' Phase 2 ''' (June 16-july 13) | |||
*:: ''' Week 5 ''' (june 16-june22): | |||
*:: Before this everything will have implemented for both GUI and CLI but this is only for GUI. | |||
*:: Will implement a pop-up using QT to auto-complete.User will be able to interact with a pop | |||
*:: up of a multiple choice,if he press double tab. | |||
*:: I will implement if there is no auto-completion available it will show "No Completion Available" | |||
*: ''' Week 6 ''' (June 22-29): | |||
*:: A frequency based(No of times it's used) hash map will be implemented. | |||
*:: This will be another parameter choosing the closest between multiple choice('acox' between 'acos' and 'acot'). | |||
*:: Different users will get difference suggestion based on this parameter. | |||
*: ''' Week 7 ''' (June 30-july 6): | |||
*:: frequency base hash map parameter will be used in all 3 implementations. | |||
*:: Creating a API to select any of 3 mechanism according to user choice and requirement. | |||
*: ''' Week 8 ''' (July 7-13): | |||
*::i) Writing documentations. | |||
*::ii)Writing tests. | |||
*: ''' Phase 2 evaluation ''' (July 9-13) | |||
*: ''' Final phase ''' (July 14-Aug 14) | |||
*: ''' Week 9 '''(July 15-21): | |||
*:: Implementing a pop-up based on QT which allow to choose number of suggestions in | |||
*:: the pop-up.It will be either top-1,top-2,top-3,top-5. | |||
*: ''' Week 10 ''' (July 22-29): | |||
*::i) Checking if something is left and implementing that. | |||
*::ii) Testing the pop-up.Testing other implementation. | |||
*::iii) writing documentation. | |||
*: ''' Week 11 ''' (July 30-Aug 6): | |||
*:: Target:selecting default implementation. | |||
*:: Comparing the efficiency of Trie,Hash and LCS based. | |||
*:: Test will be made on different sizes same data. | |||
*: ''' Week 12 ''' (Aug 7-14): | |||
*::i) Testing if there is any build issue. | |||
*::ii) Writing documentations. | |||
*::iii) Checking if there need something to implement. | |||
*::iv) ''' Final submission of work product.''' | |||
*: ''' This is a very rough timeline. The exact steps will become clearer when I do some more discussion with the mentors.''' | |||
[[Category: Summer of Code]] | [[Category: Summer of Code]] | ||