1
edit
Changes
→OOP344 -- Weekly Schedule 2012/1 (Winter Semester)
** Try My answer: [http://leolian.wordpress.com/2012/02/09/my-answer-to-todays-chanlenge-question Blog Post].
** Another answer: [http://mikeprog.blogspot.com/2012/02/oop344-lazy-authentication.html 'Lazy' Authentication].
** My answer... using only && operator--[[User:Tvirutthasalam|DevaTvirutthasalam]] 01:15, 11 February 2012 (EST) [http://thevakaran.wordpress.com/2012/02/09/answer-to-challenging-question/ '''Blog Post''']
**Here is the solution [http://bsinghseneca.blogspot.com/2012/03/challenging-questions-solution.html '''Blog Post'''].--[[User:bsingh107|bsingh107]] 5:58, 4 March 2012 (EST)
----
*Class for String Array --[[User:Tvirutthasalam|DevaTvirutthasalam]] 17:12, 09 February 2012 (EST) [http://thevakaran.wordpress.com/2012/02/08/class-for-string-array/ '''Blog Post''']
*Concatenate Command line program [http://777sblog.blogspot.com/2012/02/concatenate-command-line-program.html here]
*Concatenate by command line argument!--[[User:Tvirutthasalam|DevaTvirutthasalam]] 07:08, 10 February 2012 (EST)[http://thevakaran.wordpress.com/2012/02/09/concatenate-by-command-line-arqument/ '''Blog Post''']*Bug fixed version of MiniPrint!--[[User:Tvirutthasalam|DevaTvirutthasalam]] 17:26, 10 February 2012 (EST)[http://thevakaran.wordpress.com/2012/02/09/miniprint-bug-fixed-version/ '''Blog Post''']
*Bug fixed version of MiniPrint(better code)--[[User:bsingh107|bsingh107]] 5:21, 4 March 2012 (EST)[http://bsinghseneca.blogspot.com/2012/03/miniprint-with-bugs-fixed-better-code.html '''Blog Post''']
=== Help ===
*Can anyone post the audio/video version of today's class. Can't remember the homework question that was given near end of class.--[[User:Tvirutthasalam|DevaTvirutthasalam]] 21:50, 6 February 2012 (EST)
*You can find that at the the end of my page below in Resources
**Yea right... I forgot about you... again.. thank u for da wonderful job. It's always help me..!!--[[User:Tvirutthasalam|DevaTvirutthasalam]] 00:08, 7 February 2012 (EST)
**No problems! Please comment!!
=== To Do===
*'''(Re-post): '''[http://thevakaran.wordpress.com/2012/02/08/class-for-string-array/ '''Class for String Array'''] --[[User:Tvirutthasalam|DevaTvirutthasalam]] 11:51, 16 February 2012 (EST)*[http://thevakaran.wordpress.com/2012/02/17/list-for-single-integer-queue/ '''List for single integer – QUEUE'''] --[[User:Tvirutthasalam|DevaTvirutthasalam]] 17:36, 17 February 2012 (EST)
=== Help ===
=== Resources ===
*[[SVN_for_School_Projects]]
*:[http://thevakaran.wordpress.com/2012/02/14/how-to-work-with-svn/ Video DEMO/Tutorial]--[[User:Tvirutthasalam|DevaTvirutthasalam]] 10:04, 14 February 2012 (EST)
*If you missed this class (Thursday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture [http://777sblog.blogspot.com/2012/02/oop344-lecture-feb-016-2012.html here!]
*[http://www.sendspace.com/file/248p40 16-Feb-2012.mp4] (Thursday) Also if you are interested audio lecture in one file.mp4 (84 mb)<br/>
*'''Fardad, I Have a question,'''
*:data3 -> data2 -> data1 -> NULL
*:I was asking the same question in today's class... just want to get clear about adding a Node. On your example, you wrote, that removing a Node is happenning from _head of the linked list... which is after data3 on my above example... right, then why we are adding a Node from tail (ie. between data1 and NULL) of the linked list...?? if the adding on tail is right then, why we are removing from other side i mean.. head??? both process suppose to happen from same place... right? If we get this type of question on test or exam, it will definetly cofuse me. Please correct me if I understand wrongly. Thanks! If the adding is happenning on head, here is my code...--[[User:Tvirutthasalam|DevaTvirutthasalam]] 19:08, 23 February 2012 (EST)*:* got the answer from Chris' notes. Actually, a queue operates on a first in, first out principle (FIFO). It means, adding haPpen on tail and remove happen on head... My bad.--[[User:Tvirutthasalam|DevaTvirutthasalam]] 09:08, 24 February 2012 (EST)
*:* For a Stack, addition and removal of nodes occurs only at the head. But for a simple linked-list, addition of nodes occurs at the tail of the linked-list(as Fardad always gives an example of a queue at the Tim-Hortons where customers are removed from the queue from the head and are added at the back of the queue). But for a double linked-list, addition and removal of nodes can occur from anywhere in the queue...--[[User:bsingh107|bsingh107]] 5:34, 4 March 2012 (EST)
----
* Answer to TEST1 - [http://thevakaran.wordpress.com/2012/03/01/test-1-20113-q3-and-q4/ Q2/Q3] / [http://thevakaran.wordpress.com/2012/03/01/include-lt/ Q1]--[[User:Tvirutthasalam|DevaTvirutthasalam]] 09:48, 1 March 2012 (EST)
* Answer to TEST1 -[http://goop344.blogspot.com/2012/03/test-1-20113-q4.html Q4]--[[User:Gdanish|Gdanish]] 15:10, 2 March 2012 (EST)
** Hey where are the questions to the above answers because I want to take a look at it. Thanks
*** It's in Fardad's SVN svn://zenit.senecac.on.ca/oop344/tags/20113/test1/TestOne.rtf
* [http://goop344.blogspot.com/2012/03/test-1-20113-q4.html '''STACK'''] (append/del from bottom included)--[[User:Gdanish|Gdanish]] 09:48, 4 March 2012 (EST)
* [http://thevakaran.wordpress.com/2012/03/05/priority-queue-2/ '''PRIORITY QUEUE''']--[[User:Tvirutthasalam|DevaTvirutthasalam]] 21:33, 4 March 2012 (EST)* [http://thevakaran.wordpress.com/2012/03/05/priority-queue/ '''SORTED QUEUE''']--[[User:Tvirutthasalam|DevaTvirutthasalam]] 22:15, 4 March 2012 (EST)* [http://thevakaran.wordpress.com/2012/03/05/circular-left-shift-3/ '''CIRCULAR LEFT SHIFT''']--[[User:Tvirutthasalam|DevaTvirutthasalam]] 22:28, 4 March 2012 (EST)
=== To Do===
=== To Do===
* [http://thevakaran.wordpress.com/2012/03/09/find-given-bit-no-onoff/ '''Find given bit no ON/OFF for given Value'''] --[[User:Tvirutthasalam|DevaTvirutthasalam]] 19:41, 8 March 2012 (EST)
* [http://bsinghseneca.blogspot.com/2012/03/find-given-bit-number-in-integer-value.html '''Find the given Bit number in a integer value is ON or OFF''']----[[User:bsingh107|bsingh107]] 11:21pm, 8 March 2012 (EST)
* Try my answer: [http://leolian.wordpress.com/2012/03/09/after-class-exercise-bitwise/ '''Find the given Bit value is 0 or 1''']----[[User: leolian|xlian3]]
