Open main menu

CDOT Wiki β

Changes

Weekly Schedule 20123 - OOP344

1,687 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 ==
: Note* Did you mean int&?
==== Challenge Answers ====
* Yun Yang's version of these two methods is [at http://yun811.blogspot.ca/ here]!http://yun811.blogspot.ca/
* Amir Mobasseri's version can be find [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]
* 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 ==
*#: 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===
=== 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 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 ==
1
edit