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
- 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
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?
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,
- 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 link list... which is from data3 on my above example... right, then why we are adding a Node from tail (ie. between data1 and NULL) of the link list...?? if the adding on tail is right then, why we are removing from head???... both process supposed 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)
void Queue::add(int val){ _head = new Node(val, _head); }