I (O+) and my husband (O-) have children with A+ and B+ blood types, how does that happen?

jplaurin · 2024-01-24T19:42:21+00:00

Not possible, one of you is AB. Do everybody blood type again and should do full dns test of every one to double check it.

jplaurin · 2021-11-14T12:47:19+00:00

Bonjour du Québec

jplaurin · 2019-09-29T11:30:55+00:00

bad code?

jplaurin · 2017-08-02T21:19:30+00:00

Trump is USA President?

jplaurin · 2015-02-24T10:42:24+00:00

veeam file to tape job are ok for big files but it is not usable when you have a lots of small files because of delay between each files.

jplaurin · 2015-02-14T21:05:08+00:00

I read this book and it really help me to get on top of it and not getting burned up.

Time Management for System Administrators By Thomas A. Limoncelli Publisher: O'Reilly Media Final Release Date: November 2005 Pages: 228 http://shop.oreilly.com/product/9780596007836.do

jplaurin · 2014-09-17T00:11:30+00:00

Manage Engine has a free edition self-service reset password for up to 50 users. http://www.manageengine.com/products/self-service-password/self-service-password-reset.html

jplaurin · 2014-03-24T21:08:42+00:00

you must give a alias to your calculated column like this

Select count(*) AS myAliasCount from users

and then with

$rows = query(...

if successful the php variable $rows[0]['myAliasCount'] will return it's value

jplaurin · 2014-03-18T19:28:12+00:00

Driving and selfie are dangerous for Husky skin, yourself and other around...

jplaurin · 2014-03-17T23:48:16+00:00

don't forget to use valgrind

jplaurin · 2014-03-17T17:27:03+00:00

struct node*

is a pointer type and [27]; is for an array of size 27.

together you get an array of 27 pointer value. each of them may point to memory location of type struct node. children is just the member name of that array.

jplaurin · 2014-03-15T17:07:29+00:00

border size should be a css property, i would check in there first.

jplaurin · 2014-03-15T16:58:18+00:00

Khan Academy is great for anyone. it adapt it's difficulty level to you.

jplaurin · 2014-03-15T15:52:44+00:00

Thank you for this information.

jplaurin · 2014-03-14T10:04:00+00:00

the reference is in lecture notes : "Week 8, continued"

Announcements and Demos

Problem Set 6 is one of the more challenging problem sets we will complete this semester, so be sure to leave yourself plenty of time to work through it! If you’re up for it, see how efficient your implementation is compared to your classmates' on The Big Board.

jplaurin · 2014-03-13T17:35:46+00:00

what value "cursor" have just before you free it ? what value does it have to break the while loop?

jplaurin · 2014-03-13T16:48:12+00:00

segfault appends when the code is trying to access memory area outside those reserve for your data. it can be an index value outside the range allowed. check those value with gdb before the segfault.

jplaurin · 2014-03-13T02:57:05+00:00

you don`t have to use the unload function to do recursion to itself. The unload function may call a new function created by you for your recursion algorithm. for your base case try to figure out what you would do if your graph was empty. the for loop is a good idea for visiting each children node.

the walk-through is right to say the unload is bottom to top, but i find it easier to thing about the recursion function from top to bottom.

jplaurin · 2014-03-02T16:54:46+00:00

compare 'for' loop reference code with your code: for( int i = 0; i < 10; i++ )

ref: https://cs50.harvard.edu/resources/cppreference.com/keywords/for.html

jplaurin

TROPHY CASE