General Thoughts (2 Viewers)

[nickw444]

My MC as follows:
1C
2D
3B
4B (although A should be correct too according to sam davis)
5C
6A
7A (Obv because format matters, or leading zeros)
8D
9A
10C
11B
12D
13B
14A
15B (Which I do believe is true, because all the others are invalid, and this is definetly true)
16B (Binary Search is closest integer of n where 2^n > number of values in array
17B
18A
19C
20A

 

[the_one_1]

It was alright. The interrelationship between software and hardware has definitely fucked me up for SDD.

Section 1: about 15
Section 2: definitely 32-34
Section 3: complete fail. Would be lucky with 2.

 

[xer0]

My MC as follows:
1C
2D
3B
4B (although A should be correct too according to sam davis)
5C
6A
7A (Obv because format matters, or leading zeros)
8D
9A
10C
11B
12D
13B
14A
15B (Which I do believe is true, because all the others are invalid, and this is definetly true)
16B (Binary Search is closest integer of n where 2^n > number of values in array
17B
18A
19C
20A

Do you have the test paper or is this from memory? question 16 is about "acceptance testing", 17 is about binary search.

 

[Shazer2]

What did everyone get for MC?
1C
2D
3B
4B
5B (pretty sure this is C, I put C then changed it)
6A
7A
8A
9A
10C
11B
12D
13B
14A
15B
16D
17B
18A
19B
20A

Damn. Just re-read 1st MC, can't believe I didn't read that properly.

 

[hjed]

What did everyone get for MC?

1C
2D
3B
4A
5C
6A
7C <-- unsure about this either a string or integer would be valid, but I went with int because it's more efficient
8D <-- decided that faster *software* download speeds wasn't relevant, were as A was a valid change of requirements
9A
10C
11B
12D
13B
14A
15B
16D <-- not sure about this, this one made the most sense
17B
18A
19B
20C


With MC4, I'm reasonably certain a site license works better than an encryption key, because you have to give the client the encryption key and then they can redistribute it once they've decrypted

 

[the_one_1]

Damn. Just re-read 1st MC, can't believe I didn't read that properly.

wait was C the two numbers in a and b in the table and the final number c was 0. Thats what i selected then.

 

[Shazer2]

It was alright. The interrelationship between software and hardware has definitely fucked me up for SDD.

Section 1: about 15
Section 2: definitely 32-34
Section 3: complete fail. Would be lucky with 2.

I'd say for me:

Section 1: 13
Section 2: 43
Section 3: 5

 

[the_one_1]

I played a game of redesign tripview on my software paper
MC15 i put B, which I was confident was true, and checked it like 4 times and compared with friends
MC16 I put B, binary search is whatever 2^n > number of values to search. where n is the number of passes required.

To make more sense of that,
2^4 = 16.
An array of 15 elements will take 4 passes.

Wait.. it asked for number of elements. Actually no, I think that's the same thing

which question was the one with the array passes was it multiple choice. I think i selected 8. (Was that c). Could have selected b...

what was the question again. a.2, b.4, c.8, d.15

 

[Arex123]

My MC as follows:
1C
2D
3B
4B (although A should be correct too according to sam davis)
5C
6A
7A (Obv because format matters, or leading zeros)
8D
9A
10C
11B
12D
13B
14A
15B (Which I do believe is true, because all the others are invalid, and this is definetly true)
16B (Binary Search is closest integer of n where 2^n > number of values in array
17B
18A
19C
20A

I got the same as you except:

7 C (i think i got wrong, as i said Integer)
8 D (wasn't sure, guessed this)
16 D (and it's about acceptance testing not binary search)
18 D (not sure... but i thought it would expose areas when the data validation wouldn't work, and it also tests all pathways + boundary values)
20 C (because if a > b, then Accumulator = b - a will be negative, so it will jump to else: and store a at c (ie c = a))

 

[hjed]

which question was the one with the array passes was it multiple choice. I think i selected 8. (Was that c). Could have selected b...

what was the question again. a.2, b.4, c.8, d.15

It's Q17. Q16 is acceptance testing

 

[hjed]

I got the same as you except:

7 C (i think i got wrong, as i said Integer)
16 D (and it's about acceptance testing not binary search)
18 D (not sure... but i thought it would expose areas when the data validation wouldn't work, and it also tests all pathways + boundary values)
20 C (because if a > b, then Accumulator = b - a will be negative, so it will jump to else: and store a at c (ie c = a))

18 it said returns a number between 15 and 20 inclusive. Only the first one does does that, D will be an infinite loop

 

[nickw444]

Whoops, i fudged that, I have the paper, just missed a number
15: B
16: B
17: B
18: A
19: C
20: A

 

[Shazer2]

What about your algorithms for the payments one? Mine was like:

BEGIN
    READ account record
    WHILE more customers
        WHILE payments overdue
             ADD to overdue list
        ENDWHILE
    ENDWHILE
END

Or something like that.

 

[the_one_1]

It's Q17. Q16 is acceptance testing

Damn selected C

I HAD FUCKING B and changed it.

 

[hjed]

What about your algorithms for the payments one? Mine was like:

BEGIN
    READ account record
    WHILE more customers
        WHILE payments overdue
             ADD to overdue list
        ENDWHILE
    ENDWHILE
END

Or something like that.

did you have a second READ line inside your while loop in your actual response?

I can't remember the variable names, but:

BEGIN 

OPEN file for reading 
'^may not have been necessary

READ account record
WHILE more customers DO
      IF record.duedate < currentDate THEN
          addToOverdue(record)
       ENDIF
       READ account record
ENDWHILE

CLOSE file 'probs not necessary

END

 

[hjed]

Whoops, i fudged that, I have the paper, just missed a number
15: B
16: B
17: B
18: A
19: C
20: A

Why B for 16?
That's the one I wasn't sure about so interested to here your reasoning

 

[xer0]

What about your algorithms for the payments one? Mine was like:

BEGIN
    READ account record
    WHILE more customers
        WHILE payments overdue
             ADD to overdue list
        ENDWHILE
    ENDWHILE
END

Or something like that.

I had something like

i = 1
WHILE customer(i).custID <> 0 and is valid
   IF customer(i).payment due = TRUE AND customer(i).date due < Today's date THEN
      [U]Add to overdue list[/U]
   ENDIF
   Increment i
END WHILE
[U]Print overdue records[/U]

I assumed that the question said that if a payment is due, the customer has until "date due" to pay it back.

By the way, what was the logic error in that flowchart?

 

[Shazer2]

I had something like

i = 1
WHILE customer(i).custID <> 0 and is valid
   IF customer(i).payment due = TRUE AND customer(i).date due < Today's date THEN
      [U]Add to overdue list[/U]
   ENDIF
   Increment i
END WHILE

I assumed that the question said that if a payment is due, the customer has until "date due" to pay it back.

By the way, what was the logic error in that flowchart?

I said the logic error was that it only read one overdue payment, not all overdue payments.

 

[xer0]

Why B for 16?
That's the one I wasn't sure about so interested to here your reasoning

I'm pretty sure that one was D - "Testing whether a system is ready to become available to the end users"

B was "Testing the user-friendliness of the of the interface by the end users"

 

[xer0]

I said the logic error was that it only read one overdue payment, not all overdue payments.

But it had a loop... It had a decision that said "Last Record?" and if 'NO' then it went back up to the top again and repeated it...