Open main menu

CDOT Wiki β

Changes

Weekly Schedule 20123 - OOP344

3,549 bytes added, 21:47, 7 December 2012
To Do 10
* How to Install
** [http://wiki.tryphon.eu/how_to_install_xchat XChat]
* Great 15 minutes tutorial that will give you basic understanding of Git
** [http://try.github.com/levels/1/challenges/1 Try GitHub]
== Week 2 - Sep 9 ==
=== Resources 9 ===
* [http://etherpad.proximity.on.ca:9001/p/oop3449_nov2a Etherpad Notes Nov 2/12]
* Lecture video for Git: http://www.youtube.com/watch?v=JXusZR41Je0=== Challenge! ===Add the following methods to queue:* unsigned int size( ) and ;* int operator[](unsigned int index);: Note* Did you mean int&?==== Challenge Answers ====* Yun Yang's version of these two methods is here: httpsat http://wwwyun811.bloggerblogspot.comca/blogger.g?blogID=8936735993141520040#editor/target=post;postID=5619335165204064832 ----* Amir Mobasseri's version can be find here: [http://ammobasseri.wordpress.com/2012/11/01/c-queue/ http://ammobasseri.wordpress.com/2012/11/01/c-queue/here!]: * Revised version of Amir's code [http://mmwang2.blogspot.ca/2012/11/updated-version-of-amir-and-saeids-code.html Michael's blog]
: - Also I've noticed that Fardad did not write the return variable as a reference, which made it impossible to edit, as done in line 13 of queuetester.cpp, that is updated that as well.
 ----* Michael Wang's version of the functions [http://mmwang2.blogspot.ca/2012/11/oop344-queue-class-functions.html Michael's blog]* Prasanth's Version - [http://wereallforked.tumblr.com/post/34878497104/queue-challenge Blog Entry]* Peter's Version - [http://peter.ug http://peter.ug/queue-cpp-operator-overload/]* Stanislav's Version - [http://stanislavatseneca.blogspot.ca/ here] http://stanislavatseneca.blogspot.ca/: - I decided to go a bit further and I did my operator[] method able to add new Nodes to the end of the Queue if we have index > size, comments are greatly appreciated.* Minh Khoa (Ken) Nguyen's Version - [http://kennguyen4z.wordpress.com/2012/11/02/oop344-challenge/ Ken's blog]: - I actually go with side. I added a variable into the node.* Carlos Conejo's version (I went a little further: it adds a node with data 0 if you try to reference past the current size so it does not crash): [http://carlosjavi3r.blog.ca/ Carlos's Blog].* Linpei Fan's Version - [http://Linpei.blogspot.ca/ here] Linpei's blog.
== Week 10 - Nov 4 ==
=== This Week 10===
* Project Milestone 0.2
* bitwise operators
*# and, or, not, exclusive or
*# shifts
*# determining the value of bits
*#: masks
*# setting the value of bits
*#: '''"mask AND value"''' to set to "0" (ex. mask for 3rd bit: 1111 0111)
*#: '''"mask OR value"''' to set to "1" (ex. mask for 3rd bit: 0000 1000)
 
=== To Do 10===
* [[The CIO Framework - OOP344 20123#0.2 Milestone|Project Milestone 0.2 (Due Monday Nov 12th 23:59)]]
* Challege
*# setBit(unsigned int val, unsigned int bitNo, bool bitVal);
*#: Sets the "bitNo" bit of val to the "bitVal" value
*# char* bits(unsigned int val)
*#: returns a character string holding the bit pattern of val (i.e cout<<bits(0xF7)<<endl, will print 11110111)
*# write the void prnBits(unsigned int val) function (wrote in class) in only one line.
* I tried two of the functions at http://yun811.blogspot.ca/ Yun Yang's oop344
* My drafts on char* bits(unsigned int val) : http://itactics.wordpress.com/2012/11/20/code-how-to-print-binary/ (Diaoqiang He)
* I have the solutions for all of three functions at my blog - http://linpei.blogspot.ca/ (Linpei Fan)
* I did the void prnBits function in one line:
* void prnBits(int val){
* for(unsigned int m = 1 << (sizeof(val)*8 -1); m;printf("%d", !!(m & val)),m=m>>1);
* }
* Alina Shtramwasser - email: [mailto:ashtramwasser1@myseneca.ca ashtramwasser1]
* Carlos Conejo's Challenges in : [http://carlosjavi3r.blog.ca/ Carlos's Blog].
 
=== Resources 10===
* https://scs.senecac.on.ca/~oop344/pages/content/bitsw.html* http://en.wikipedia.org/wiki/Bitwise_operators* http://bit.ly/TpYFOr
== Week 11 - Nov 11 ==
=== This Week 11===
* Templates** functions** classes === To Do 11===* [[The CIO Framework - OOP344 20123#0.3 Milestone|Project Milestone 0.3 - Part 1 (Due Saturday Nov 17th 23:59)]]** CField, CDialog and CLabel * [[The CIO Framework - OOP344 20123#0.3 Milestone|Project Milestone 0.3 - Part 2 (Due Sunday Nov 18th 23:59)]]**CLineEdit 
=== Resources 11===
* http://git-scm.com/book/en/Git-Branching-Basic-Branching-and-Merging
*: to do merging on local repo and basic conflict handling
 
* Template Specialization and Partial Template specilization
*: http://www.cprogramming.com/tutorial/template_specialization.html
== Week 12 - Nov 18 ==
=== To Do 13===
=== Resources 13===
* function of cstring*: strcat : http://www.cplusplus.com/reference/cstring/strcat/*: strstr : http://www.cplusplus.com/reference/cstring/strstr/*: strcpy : http://www.cplusplus.com/reference/cstring/strcpy/
== Week 14 - Dec 2 ==
== Week 15 - Dec 9 (Exam Week) ==
=== This Week 15===
* Final Exam
*: Room: S3031
*: Time: 11:30
*: Date: Wednesday Dec 12th
 
=== To Do 15===
=== Resources 15===
1
edit