Computing Paper 3 Last Week Revision

[AlphaBeta]

for quick sort is there anything called pivot quick sort method ? how does that work ?

 

[AlphaBeta]

Can they ask for things from Paper 1? such as logic gates etc

thats for 2015 syllabus i guess , with XOR and all

 

[hope4thebest]

thats for 2015 syllabus i guess , with XOR and all

yah i saw that in a specimen paper of 2015

 

[hope4thebest]

The algorithms of quick sorting and insertion sort do we have to remember them?

 

[:: A^]

The algorithms of quick sorting and insertion sort do we have to remember them?

knw the logic

 

[hope4thebest]

knw the logic

have they ever questioned about the sorting in the past papers?

 

[:: A^]

have they ever questioned about the sorting in the past papers?

cant remember seeing one. giving me and you more reasons to study it.

 

[chathumus]

The algorithms of quick sorting and insertion sort do we have to remember them?

In the revision guide for the massive blue book (Computing Coursebook) it says and I quote "Remember the syllabus explicitly states that you will not be expected to produce these algorithms for these sorting methods in the exam. You should, however be able to give a description of the algorithm, and it would be a worthwhile programming exercise'

So yeah I only went through the syllabus before mocks and its too lengthy and I dont have time to do so again but if the syllabus says no then they obv wont ask ot from scratch for sure anyways

 

[hope4thebest]

Ahh syllabus outline clearly says that algorithms can be asked . SAD

 

[A star]

View attachment 43997
Ahh syllabus outline clearly says that algorithms can be asked . SAD

only two algos to be learned

 

[chathumus]

View attachment 43997
Ahh syllabus outline clearly says that algorithms can be asked . SAD

holy what? What is this book I've been revising off of this whole time? :O

 

[hope4thebest]

Guys what I think about paper 3 is that the theory part is very easy such as functions of OS,functions of registers, functions of translators and network chapter. And of course that BCD two's complement floating point chapter is also a potential high scoring chapter. Only if they could make a difficult paper it must come from programming paradigms chapter

 

[chathumus]

View attachment 43997
Ahh syllabus outline clearly says that algorithms can be asked . SAD

??

 

[chathumus]

haha its so called a book by the Cambridge International

Is my syllabus different? I'm sitting the 9691/32 paper? Im so confused right now

 

[hope4thebest]

Is my syllabus different? I'm sitting the 9691/32 paper? Im so confused right now

same but I read this from syllabus outline for 2014

 

[chathumus]

same but I read this from syllabus outline for 2014

Oh no! I've been following the 2013 (its what my teacher gave me. I feel like killing myself now!

 

[hope4thebest]

Oh no! I've been following the 2013 (its what my teacher gave me. I feel like killing myself now!

LOL and this worries me further. If CIE has included this in 2014 syllabus then there is a high probability that they will question it tomorrow

 

[chathumus]

Oh no! I've been following the 2013 (its what my teacher gave me. I feel like killing myself now!

Ok this is not good I just realized our teacher made us follow the 2013 for the coursework too! Dear god!

 

[chathumus]

LOL and this worries me further. If CIE has included this in 2014 syllabus then there is a high probability that they will question it tomorrow

Wow and here I was calm and collected for the paper tomorrow. I dont even know the syllabus!

 

[hope4thebest]

Wow and here I was calm and collected for the paper tomorrow. I dont even know the syllabus!

And its not a good time to know a new thing I also thought I am done with the syllabus before seeing this