Weekly Schedule 20121 - OOP344
OOP344 | Weekly Schedule | Student List | Teams | Project | Student Resources
Contents
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)