Difference between revisions of "Weekly Schedule 20121 - OOP344"
(→To Do) |
(→This Week) |
||
(90 intermediate revisions by 15 users not shown) | |||
Line 136: | Line 136: | ||
** Another answer: [http://mikeprog.blogspot.com/2012/02/oop344-lazy-authentication.html 'Lazy' Authentication]. | ** Another answer: [http://mikeprog.blogspot.com/2012/02/oop344-lazy-authentication.html 'Lazy' Authentication]. | ||
** My answer... using only && operator--[[User:Tvirutthasalam|Tvirutthasalam]] 01:15, 11 February 2012 (EST) [http://thevakaran.wordpress.com/2012/02/09/answer-to-challenging-question/ '''Blog Post'''] | ** My answer... using only && operator--[[User:Tvirutthasalam|Tvirutthasalam]] 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|Tvirutthasalam]] 17:12, 09 February 2012 (EST) [http://thevakaran.wordpress.com/2012/02/08/class-for-string-array/ '''Blog Post'''] | *Class for String Array --[[User:Tvirutthasalam|Tvirutthasalam]] 17:12, 09 February 2012 (EST) [http://thevakaran.wordpress.com/2012/02/08/class-for-string-array/ '''Blog Post'''] | ||
Line 141: | Line 142: | ||
*Concatenate by command line argument!--[[User:Tvirutthasalam|Tvirutthasalam]] 07:08, 10 February 2012 (EST)[http://thevakaran.wordpress.com/2012/02/09/concatenate-by-command-line-arqument/ '''Blog Post'''] | *Concatenate by command line argument!--[[User:Tvirutthasalam|Tvirutthasalam]] 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|Tvirutthasalam]] 17:26, 10 February 2012 (EST)[http://thevakaran.wordpress.com/2012/02/09/miniprint-bug-fixed-version/ '''Blog Post'''] | *Bug fixed version of MiniPrint!--[[User:Tvirutthasalam|Tvirutthasalam]] 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]] | + | *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 === | === Help === | ||
Line 189: | Line 190: | ||
*:data3 -> data2 -> data1 -> NULL | *: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|Tvirutthasalam]] 19:08, 23 February 2012 (EST) | *: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|Tvirutthasalam]] 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. | + | *:* 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|Tvirutthasalam]] 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) | ||
=== Resources === | === Resources === | ||
Line 197: | Line 199: | ||
=== This Week === | === This Week === | ||
* Study break | * Study break | ||
− | * R0.2 Due this week [http://youtu.be/qNsQugbwvTE '''VIDEO DEMO'''] and [http://thevakaran.wordpress.com/2012/03/01/color-console-4/ '''UPGRADED R0.2(Color)'''] | + | * R0.2 Due this week [http://youtu.be/qNsQugbwvTE '''VIDEO DEMO'''] and [http://thevakaran.wordpress.com/2012/03/01/color-console-4/ '''UPGRADED R0.2(Color)''']--[[User:Tvirutthasalam|Tvirutthasalam]] 19:54, 12 March 2012 (EDT) |
---- | ---- | ||
+ | * 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|Tvirutthasalam]] 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|Tvirutthasalam]] 21:33, 4 March 2012 (EST) | ||
+ | * [http://thevakaran.wordpress.com/2012/03/05/priority-queue/ '''SORTED QUEUE''']--[[User:Tvirutthasalam|Tvirutthasalam]] 22:15, 4 March 2012 (EST) | ||
+ | * [http://thevakaran.wordpress.com/2012/03/05/circular-left-shift-3/ '''CIRCULAR LEFT SHIFT''']--[[User:Tvirutthasalam|Tvirutthasalam]] 22:28, 4 March 2012 (EST) | ||
=== To Do=== | === To Do=== | ||
Line 213: | Line 223: | ||
*Please login to : http://bbb.senecac.on.ca | *Please login to : http://bbb.senecac.on.ca | ||
*your password is student123 | *your password is student123 | ||
+ | |||
+ | === Help === | ||
+ | |||
+ | === Resources === | ||
+ | [http://matrix.senecac.on.ca/~fardad.soleimanloo/files/LinkedLists.odp Linked List Slides (odp)]<br /> | ||
+ | [http://matrix.senecac.on.ca/~fardad.soleimanloo/files/LinkedLists.pptx Linked List Slides (pptx)] | ||
+ | |||
+ | == Week 9 - Mar 04 == | ||
+ | === This Week === | ||
+ | * Test One | ||
+ | * bitwise operators | ||
+ | |||
+ | === 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|Tvirutthasalam]] 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]] | ||
+ | * [http://btulchinsky.wordpress.com/2012/03/11/ison-and-isoff-functions/ '''isOn/isOff functions'''] --[[User:Btulchinsky|Barry]] 06:17, 11 March 2012 (EST) | ||
+ | * [http://honghuichen.blogspot.com/2012/03/homework-mar-8.html '''Find the given Bit number in a integer value is ON or OFF'''] --[[User: HonghuiChen|hchen142]] | ||
+ | |||
+ | === Help === | ||
+ | * [http://thevakaran.wordpress.com/2012/03/07/color-console-with-shadow-and-solid-frame-border/ R0.2 With Color, Shadow and Solid Borders]--[[User:Tvirutthasalam|Tvirutthasalam]] 19:54, 12 March 2012 (EDT) | ||
+ | |||
+ | === Resources === | ||
+ | *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/03/oop344-lecture-mar-8-2012.html here!] | ||
+ | |||
+ | == Week 10 - Mar 11 == | ||
+ | === This Week === | ||
+ | * bitwise operators (continued) | ||
+ | |||
+ | === To Do=== | ||
+ | * Make the following possible: | ||
+ | int i = 2345; | ||
+ | cout<<"i: "<<bits(i)<<endl; | ||
+ | output: i: 00000000000000000000100100101001 | ||
+ | |||
+ | * [http://bsinghseneca.blogspot.com/2012/03/return-bits-present-in-integer-by-using.html '''Return the bits present in a integer by using a function''']----[[User:bsingh107|bsingh107]] 17:44, 12 March 2012 (EST) | ||
+ | * [http://thevakaran.wordpress.com/2012/03/12/cout-bits/ '''My bits function'''] and [http://thevakaran.wordpress.com/2012/03/13/cout-bits-from-integer-similar-to-others-version-2/ '''''Modified from others version''''']--[[User:Tvirutthasalam|Tvirutthasalam]] 17:59, 12 March 2012 (EDT) | ||
+ | * [http://leolian.wordpress.com/2012/03/12/solution-for-printing-binary-numbers '''My solution for printing the binary numbers for the integer''']----[[User:xlian3|xlian3]] 18:28, 12 March 2012 (EST) | ||
+ | * [http://goop344.blogspot.com/2012/03/0-i-j-strjval-1-i10-strj0-return-str.html '''Using cout to print binary version of int''']--[[User:Gdanish|Gdanish]] 19:07, 12 March 2012 (EDT) | ||
+ | * [http://orplicity.com/wordpress/?p=279 '''Using cout to print binary version of int''']--[[User:wwong20|wwong20]] 23:10, 13 March 2012 (EDT) | ||
+ | * [http://honghuichen.blogspot.com/2012/03/make-following-possible-print-binary.html ''' print binary numbers ''']--[[User: HonghuiChen|hchen142]] 23:59, 13 March 2012 (EDT) | ||
+ | * [http://yudongxu.blogspot.com/2012/03/using-cout-to-print-binary.html ''' My answer ''']--[[User: dyu26|dyu26]] 17:56, 14 March 2012 (EDT) | ||
+ | * [http://daagger.blogspot.com/2012/03/int-i-2345cout-i-0000000000000000000010.html '''Getting cout<<"i: "<<bits(i)<<endl; to work''']--[[User: aadamico|aadamico]] 20:51, 14 March 2012 (EDT) | ||
+ | |||
+ | === Help === | ||
+ | |||
+ | === Resources === | ||
+ | |||
+ | |||
+ | *If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture [http://777sblog.blogspot.com/2012/03/oop344-lecture-mar14-2012.html here!] | ||
+ | |||
+ | *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/03/oop344-lecture-mar12-2012.html here!]<--Assignment explained! | ||
+ | |||
+ | == Week 11 - Mar 19 == | ||
+ | === This Week === | ||
+ | * linklists | ||
+ | * templates | ||
+ | |||
+ | === To Do=== | ||
+ | * [http://goop344.blogspot.ca/2012/03/insertbefore-and-insertafter-functions.html'''insertBefore and insertAfter''']--[[User:Gdanish|Gdanish]] 21:51, 20 March 2012 (EDT) | ||
+ | * [http://bsinghseneca.blogspot.ca/2012/03/double-linked-list-with-templates.html'''Double linked list with templates ''']--[[User:bsingh107|bsingh107]] 22:32, 20 March 2012 (EDT) | ||
+ | * [http://avr-s.blogspot.ca/2012/03/double-linked-list-with-template-no.html'''Double linked list with template (no sort) ''']--[[User:avtran3|avtran3]] 23:32, 20 March 2012 (EDT) | ||
+ | * [http://thevakaran.wordpress.com/2012/03/21/double-linked-list-with-templates/ '''Double Linked List with Template - (INCLUDED ALL)''']--[[User:Tvirutthasalam|Tvirutthasalam]] 04:53, 21 March 2012 (EDT) | ||
+ | |||
+ | |||
+ | |||
+ | * [http://thevakaran.wordpress.com/2012/03/21/templated-double-linked-list-tester/ '''TESTER FOR ABOVE PROGRAM''']--[[User:Tvirutthasalam|Tvirutthasalam]] 12:32, 21 March 2012 (EDT) | ||
+ | |||
+ | === Help === | ||
+ | |||
+ | === Resources === | ||
+ | *[http://www.sendspace.com/file/swzqsb 19-Mar-2012.mp4] (Monday) Also if you are interested audio lecture in one file.mp4 (74 mb)<br/> | ||
+ | *If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture [http://777sblog.blogspot.ca/2012/03/oop344-lecture-mar19-2012.html here!] | ||
+ | |||
+ | == Week 12 - Mar 26 == | ||
+ | === This Week === | ||
+ | * i/o/f streams | ||
+ | * read/write from files | ||
+ | |||
+ | === To Do=== | ||
+ | |||
+ | === Special Event === | ||
+ | '''<font color="red">Fardad's Birthday[Mar 26, 2012] Celebration -> [http://thevakaran.wordpress.com/2012/03/29/fardads-birthday-march-26-2012/ PICTURES]'''</font> | ||
+ | |||
+ | === Help === | ||
+ | *[http://zenit.senecac.on.ca/wiki/index.php/File:IOS.png IOS Classes Hierarchy] | ||
+ | *Has Fardad mentioned when we are having test #2? | ||
+ | *: Coming Monday!--[[User:Tvirutthasalam|Tvirutthasalam]] 01:32, 5 April 2012 (EDT) | ||
+ | |||
+ | === Resources === | ||
+ | *[http://www.sendspace.com/file/2mmtzi 26-Mar-2012.mp4] (Monday, Sec B) Also if you are interested audio lecture in one file.mp4 (75 mb)<br/> | ||
+ | *[http://www.sendspace.com/file/ag5wc0 29-Mar-2012.mp4] (Thusday, Sec B) Also if you are interested audio lecture in one file.mp4 (75 mb)<br/> | ||
+ | *If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture [http://777sblog.blogspot.ca/2012/03/oop344-lecture-mar26-2012.html here!] | ||
+ | * [http://oop344kkwong.blogspot.ca/2012/04/exam-reference-book-my-notes-part2.html '''Exam Notes''']--[[User:kwong67|kwong67]] 16:10, 13 April 2012 (EST) | ||
+ | |||
+ | == Week 13 - Apr 02 == | ||
+ | === This Week === | ||
+ | |||
+ | === To Do=== | ||
+ | |||
+ | === Help === | ||
+ | |||
+ | === Resources === | ||
+ | |||
+ | == Week 14 - Apr 09 == | ||
+ | === This Week === | ||
+ | * Test 2 | ||
+ | |||
+ | === To Do=== | ||
+ | |||
+ | === Help === | ||
+ | |||
+ | === Resources === | ||
+ | |||
+ | == Week 15 - Apr 16 == | ||
+ | === This Week === | ||
+ | * EXAM WEEK | ||
=== Help === | === Help === | ||
=== Resources === | === Resources === |
Latest revision as of 09:02, 14 April 2012
OOP344 | Weekly Schedule | Student List | Teams | Project | Student Resources
Contents
- 1 OOP344 -- Weekly Schedule 2012/1 (Winter Semester)
- 1.1 Week 1 - Jan 8
- 1.2 Week 2 - Jan 15
- 1.3 Week 3 - Jan 22
- 1.4 Week 4 - Jan 30
- 1.5 Week 5 - Feb 05
- 1.6 Week 6 - Feb 12
- 1.7 Week 7 - Feb 19
- 1.8 Week 8 - Feb 26
- 1.9 Week 9 - Mar 04
- 1.10 Week 10 - Mar 11
- 1.11 Week 11 - Mar 19
- 1.12 Week 12 - Mar 26
- 1.13 Week 13 - Apr 02
- 1.14 Week 14 - Apr 09
- 1.15 Week 15 - Apr 16
OOP344 -- Weekly Schedule 2012/1 (Winter Semester)
- Watch the lecture, scroll bellow to Resources!
Week 1 - Jan 8
This Week
- Introduction to Open Source development.
- Collaboration Tools:
- Wiki
- Blog
- IRC
- Code Repository
To Do
Form a team of 3 to 5 students and select a name for your team. (members can be from both sections of oop344)
- Create an account on this wiki, (please use your seneca email id for your wiki id)
- Join the IRC by registering your nickname on freenode server and joining the #seneca-oop344 channel for 344 related dialog
Additional channels of interest: #seneca to interact with all Seneca students participating in opensource projects, and #seneca-social for Social (off-topic) dialog. - Create a blog (if you don't already have one)
- Add your name to the OOP344 Student List
- Download SVN and check out the OOP344 repo(svn://zenit.senecac.on.ca/oop344) to get the notes done in class (userid: "oop344", no password)
- Create your team page using provided template
Resources
- TortoiseSVN download page for windows
- A quick tutorial for SVN: Source Control in Ten Minutes
- create console application projects in Visual Studio
- IRC account and login (in Windows)
- RabbitVCS - Linux alternative to TortoiseSVN
- Compare IRC clients
- How To edit Wiki pages
- How To edit Wiki Cheatsheet
- Free Xchat for windows
- Colloquy an IRC Client for Mac
- RapidSVN a SVN Client for Mac
Week 2 - Jan 15
This Week
- namespaces
- extern
- define
- Macros
- project review
To Do
- Form your teams and send me ONE email per team containing team member complete Seneca info.
- Update the Team page.
- If you are not able to join a team send me an email to place your myself.
Resources
- Each team should have their own page like this team. Click here for more info.
Week 3 - Jan 22
This Week
- pointers review, pointer arithmetic
- project review
To Do
- Finalize your teams
Resources
- Some notes from the Thursday class can be found here (apetrus)
- 26-Jan-2012.mp4 Also if you are interested audio lecture in one file.mp4 (55 mb)
- One important thing to know here --Gdanish 22:36, 9 February 2012 (EST)
Week 4 - Jan 30
This Week
- Statics
- variables
- attributes (member variables
- methods
- recursion
- Operators in C
- Virtual
- pure virtual methods
- abstract base classes
- Pointers to Functions
To Do
- Review your teams
Resources
- 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 here!
- I have also posted some class notes here and here (apetrus)
- 02-Feb-2012.mp4 Also if you are interested audio lecture in one file.mp4 (85 mb)
Week 5 - Feb 05
This Week
- References
- review
- Returning
- Dynamic Memory Allocation (DMA)
- review
- Creating a Smart Integer Array
- Variable Argument list
- Command line arguments
- Pointers to Functions (continued)
- SVN account submissions
To Do
int validMonth(int mon, char* errmes){ int res = 0; if(mon > 0 && mon <=12){ res = 1; } else{ strcpy(errmes, "Invalid month (1<=month<=12)"); } return res; }
write the above function in one line:
int validMonth(int mon, char* errmes){ return yada yada; }
yada yada can have only operators and one function call (no ?: operator allowed)
- Challenging question answer
- Here is my Answer.--Gdanish 12:16, 9 February 2012 (EST)
- My answer to the Challenging Question: Blog Post.
- Try My answer: Blog Post.
- Another answer: 'Lazy' Authentication.
- My answer... using only && operator--Tvirutthasalam 01:15, 11 February 2012 (EST) Blog Post
- Here is the solution Blog Post.--bsingh107 5:58, 4 March 2012 (EST)
- Class for String Array --Tvirutthasalam 17:12, 09 February 2012 (EST) Blog Post
- Concatenate Command line program here
- Concatenate by command line argument!--Tvirutthasalam 07:08, 10 February 2012 (EST)Blog Post
- Bug fixed version of MiniPrint!--Tvirutthasalam 17:26, 10 February 2012 (EST)Blog Post
- Bug fixed version of MiniPrint(better code)--bsingh107 5:21, 4 March 2012 (EST)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.--Tvirutthasalam 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..!!--Tvirutthasalam 00:08, 7 February 2012 (EST)
- No problems! Please comment!!
Resources
- If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture here!
- 06-Feb-2012.mp4 (Monday) Also if you are interested audio lecture in one file.mp4 (70 mb)
- 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 here!
- 09-Feb-2012.mp4 (Thursday) Also if you are interested audio lecture in one file.mp4 ( mb)
Week 6 - Feb 12
This Week
- Monday Class will be in T2107
- Dynamic Arrays/Strings Continued
- Overload Casts
- Linked Lists Intro
To Do
- (Re-post): Class for String Array --Tvirutthasalam 11:51, 16 February 2012 (EST)
- List for single integer – QUEUE --Tvirutthasalam 17:36, 17 February 2012 (EST)
Help
- Is anyone aware if the mid term test is this Thursday or the Monday after reading week?
- It is on Monday after the study break.--Gdanish 16:17, 29 February 2012 (EST)
Resources
- SVN_for_School_Projects
- Video DEMO/Tutorial--Tvirutthasalam 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 here!
- 16-Feb-2012.mp4 (Thursday) Also if you are interested audio lecture in one file.mp4 (84 mb)
Week 7 - Feb 19
This Week
- void pointers
- Project
- Linked Lists
To Do
Help
- 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...--Tvirutthasalam 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.--Tvirutthasalam 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...--bsingh107 5:34, 4 March 2012 (EST)
Resources
- 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 here!
- 23-Feb-2012.mp4 (Thursday) Also if you are interested audio lecture in one file.mp4 (62 mb)
Week 8 - Feb 26
This Week
- Study break
- R0.2 Due this week VIDEO DEMO and UPGRADED R0.2(Color)--Tvirutthasalam 19:54, 12 March 2012 (EDT)
- Answer to TEST1 - Q2/Q3 / Q1--Tvirutthasalam 09:48, 1 March 2012 (EST)
- Answer to TEST1 -Q4--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
- Hey where are the questions to the above answers because I want to take a look at it. Thanks
- STACK (append/del from bottom included)--Gdanish 09:48, 4 March 2012 (EST)
- PRIORITY QUEUE--Tvirutthasalam 21:33, 4 March 2012 (EST)
- SORTED QUEUE--Tvirutthasalam 22:15, 4 March 2012 (EST)
- CIRCULAR LEFT SHIFT--Tvirutthasalam 22:28, 4 March 2012 (EST)
To Do
At 9:45:
- Have your computers ready (you might want to)
- Login to IRC
- Have svn handy and Visual Studio (or any IDE) just in case
- make sure your default computer speakers are set to be your head set
- test your head set
- test your webcam, if you would like to use it (I will)
it is Very important to use your real name when joining the conference
- Please login to : http://bbb.senecac.on.ca
- your password is student123
Help
Resources
Linked List Slides (odp)
Linked List Slides (pptx)
Week 9 - Mar 04
This Week
- Test One
- bitwise operators
To Do
- Find given bit no ON/OFF for given Value --Tvirutthasalam 19:41, 8 March 2012 (EST)
- Find the given Bit number in a integer value is ON or OFF----bsingh107 11:21pm, 8 March 2012 (EST)
- Try my answer: Find the given Bit value is 0 or 1----xlian3
- isOn/isOff functions --Barry 06:17, 11 March 2012 (EST)
- Find the given Bit number in a integer value is ON or OFF --hchen142
Help
- R0.2 With Color, Shadow and Solid Borders--Tvirutthasalam 19:54, 12 March 2012 (EDT)
Resources
- 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 here!
Week 10 - Mar 11
This Week
- bitwise operators (continued)
To Do
- Make the following possible:
int i = 2345; cout<<"i: "<<bits(i)<<endl; output: i: 00000000000000000000100100101001
- Return the bits present in a integer by using a function----bsingh107 17:44, 12 March 2012 (EST)
- My bits function and Modified from others version--Tvirutthasalam 17:59, 12 March 2012 (EDT)
- My solution for printing the binary numbers for the integer----xlian3 18:28, 12 March 2012 (EST)
- Using cout to print binary version of int--Gdanish 19:07, 12 March 2012 (EDT)
- Using cout to print binary version of int--wwong20 23:10, 13 March 2012 (EDT)
- print binary numbers --hchen142 23:59, 13 March 2012 (EDT)
- My answer --dyu26 17:56, 14 March 2012 (EDT)
- Getting cout<<"i: "<<bits(i)<<endl; to work--aadamico 20:51, 14 March 2012 (EDT)
Help
Resources
- If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture here!
- 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 here!<--Assignment explained!
Week 11 - Mar 19
This Week
- linklists
- templates
To Do
- insertBefore and insertAfter--Gdanish 21:51, 20 March 2012 (EDT)
- Double linked list with templates --bsingh107 22:32, 20 March 2012 (EDT)
- Double linked list with template (no sort) --avtran3 23:32, 20 March 2012 (EDT)
- Double Linked List with Template - (INCLUDED ALL)--Tvirutthasalam 04:53, 21 March 2012 (EDT)
- TESTER FOR ABOVE PROGRAM--Tvirutthasalam 12:32, 21 March 2012 (EDT)
Help
Resources
- 19-Mar-2012.mp4 (Monday) Also if you are interested audio lecture in one file.mp4 (74 mb)
- If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture here!
Week 12 - Mar 26
This Week
- i/o/f streams
- read/write from files
To Do
Special Event
Fardad's Birthday[Mar 26, 2012] Celebration -> PICTURES
Help
- IOS Classes Hierarchy
- Has Fardad mentioned when we are having test #2?
- Coming Monday!--Tvirutthasalam 01:32, 5 April 2012 (EDT)
Resources
- 26-Mar-2012.mp4 (Monday, Sec B) Also if you are interested audio lecture in one file.mp4 (75 mb)
- 29-Mar-2012.mp4 (Thusday, Sec B) Also if you are interested audio lecture in one file.mp4 (75 mb)
- If you missed this class (Monday) or you couldn't follow along because fardad speaks too fast. whatever the reason you can watch the lecture here!
- Exam Notes--kwong67 16:10, 13 April 2012 (EST)
Week 13 - Apr 02
This Week
To Do
Help
Resources
Week 14 - Apr 09
This Week
- Test 2
To Do
Help
Resources
Week 15 - Apr 16
This Week
- EXAM WEEK