so 1 day left (1 Viewer)

[gabn]

with one day left to study / cram anyone have any suggesttions at what i really should learn before this test...... i have done anything all year don't expect much but it would be nice to pass.

option topic is hardware.

I can write algorthims just not dicate them, I've found useing the writer for this exam is hard.... but i'll make the do as much as possible so it's markable.

What are things you NEED to know for this exam ??

 

[JayWalker]

No offence, but if you dont know stuff from the syllabus allready, you are NOT going to learn them in a day.. Dont worry, chill, I do not support cramming unless its a memory sheet that you memorise before walking into the exam.
I find cramming just freaks you out, you need to chill, revise what you know, and try looking up case studies and apply your knowledge

You'll be fine

 

[einsteinthe2nd]

I know this is totally off topic, but when you are performing the Shift add in binary for multiplication......what do you do when you get 4 1's? How do you add the four ones together?

 

[JayWalker]

I have no idea what your talking about

 

[einsteinthe2nd]

Do you do, or did Developers View Of Hardware.......

When you perform multiplication, you multiply and then shift.......you get like four lines that you gotta add up? With me?

Then when you add, if you encounter like a 1 + 1 + 1 then you put 1 in the line and then carry 1 and then I came upon it where it was 1 + 1 + 1 + 1 ...now what am i suppose to put in the column and carry what?

 

[JayWalker]

haha, thats probably why

I do evolution

 

[neuro_logik]

Evolution is the easiest one

 

[JayWalker]

Evolution is the easiest one

Really? I'm strugling with it... Just dont see how all the different generations differ,, they all seem the same to me

 

[gabn]

Do you do, or did Developers View Of Hardware.......

When you perform multiplication, you multiply and then shift.......you get like four lines that you gotta add up? With me?

Then when you add, if you encounter like a 1 + 1 + 1 then you put 1 in the line and then carry 1 and then I came upon it where it was 1 + 1 + 1 + 1 ...now what am i suppose to put in the column and carry what?

yeah post the full question.... you just add 2 1's on the next colum of addtion. until you end up with a binary number much longer than the orginals

 

[einsteinthe2nd]

In the Sam davis text book, page 351.

Multiply.

1110001
1110 x
__________
* 0000000
1110001
1110001
1110001
___________
010110

Thats where Im up to.........the * is a carry....

 

[Terra_Niux]

Evolution sucks, I really hate LISP and I dont understand any code thats related to the functional paradigm.

 

[einsteinthe2nd]

Yeh here it is

 

[JayWalker]

LISP as in the funny talking people?


We have to know code relating to the paradigms?!?!

 

[Terra_Niux]

LISP = List Processing

Yeah they'll have segments of code that relate to different paradigms..

For Logic they may have SQL or Prolog
For Functional they will probably have LISP (I think it differs from Emacs LISP, not sure)

I dont think they'll ask questions on others.. then again ill probably be wrong

 

[neuro_logik]

Really? I'm strugling with it... Just dont see how all the different generations differ,, they all seem the same to me

Gen 1. Closer to the hardware, machine language, understood by the hardware directly (think of the punch card system), reliant on the hardware type as they have different insructions between architectures

Gen 2. Use of numonic code, close to the hardware but more human readable (Assembly Language), reliant on the hardware type as they have different instructions between architectures.

Gen 3. Closer to the human language, higher level, not concerned with the specifics of the hardware, portable between varying hardware types. (eg: C, VB, C++, Perl, Python)

 

[JayWalker]

Gen 4: Just sounds cool

Gen 5: Sounds even cooler but it is actually not as cool as Gen 4

?!?!?!??@!

 

[Terra_Niux]

For Example...

Question 24 (continued)

Source: 2003 HSC SDD Exam

1 main :- int_database, go.
2 init_database :- assert(country(australia)),
3 assert(country(spain)),
4 assert(country(france)),
5 assert(city(canberra)),
6 assert(city(paris)),
7 assert(city(madrid)),
8 assert(capital(australia, canberra)),
9 assert(capital(france, paris)),
10 assert(capital(spain, madrid)).
11 go :- nl,list_countries,
12 write($ Enter a country name or quit to finish. $),
13 read(X),
14 X \=quit,
15 show_capital(X),
16 !, go.
17 go :-.
18 list_countries :- write($ Countries in database: $),
19 can_use(Country),
20 tab(2), write(Country),
21 fail.
22 list_countries :- nl.
23 can_use(X) :- country(X).
24 show_capital(X) :- country(X), capital(X,Y),
25 write(Y), write($ is the capital of $), write(X), nl.
26 show_capital(X) :- city(X), write(X), write($ is a city, not a country. $), nl.
27 show_capital(X) :- write (X), write($ is not in my database. $), nl.

(i) Identify the paradigm supported by the programming language used to
write the above program. Justify your answer by listing THREE features
of the paradigm, giving examples from the code.

(ii) Currently, this program has limited use as a geography database. Using
the code given as examples of syntax, extend the third show_capital
module (line 27) so that it prompts for and accepts the capital of the
country not already in the database. The module must also add the new
data to the database.

 

[gabn]

ok

1110001
1110 x
__________
00000000000
00011100010
00111000100
01110001000
___________
11000101110

yeah answer keep on carrying the ones. extra 0 fo it lines up

 

[neuro_logik]

For Example...

Question 24 (continued)

Source: 2003 HSC SDD Exam

1 main :- int_database, go.
2 init_database :- assert(country(australia)),
3 assert(country(spain)),
4 assert(country(france)),
5 assert(city(canberra)),
6 assert(city(paris)),
7 assert(city(madrid)),
8 assert(capital(australia, canberra)),
9 assert(capital(france, paris)),
10 assert(capital(spain, madrid)).
11 go :- nl,list_countries,
12 write($ Enter a country name or quit to finish. $),
13 read(X),
14 X \=quit,
15 show_capital(X),
16 !, go.
17 go :-.
18 list_countries :- write($ Countries in database: $),
19 can_use(Country),
20 tab(2), write(Country),
21 fail.
22 list_countries :- nl.
23 can_use(X) :- country(X).
24 show_capital(X) :- country(X), capital(X,Y),
25 write(Y), write($ is the capital of $), write(X), nl.
26 show_capital(X) :- city(X), write(X), write($ is a city, not a country. $), nl.
27 show_capital(X) :- write (X), write($ is not in my database. $), nl.

(i) Identify the paradigm supported by the programming language used to
write the above program. Justify your answer by listing THREE features
of the paradigm, giving examples from the code.

(ii) Currently, this program has limited use as a geography database. Using
the code given as examples of syntax, extend the third show_capital
module (line 27) so that it prompts for and accepts the capital of the
country not already in the database. The module must also add the new
data to the database.

i) Logical, are there are the statement of facts

3 assert(country(spain)),
4 assert(country(france)),
5 assert(city(canberra)),
6 assert(city(paris)),
7 assert(city(madrid)),
8 assert(capital(australia, canberra)),
9 assert(capital(france, paris)),
10 assert(capital(spain, madrid)).

The use of rules:

25 write(Y), write($ is the capital of $), write(X), nl.

and Queries:

12 write($ Enter a country name or quit to finish. $),
13 read(X),

And there is also the use of forward chaining, as initially there is the statement of facts
within the code, eg: 10 assert(capital(spain, madrid)), and in the final lines leads to a conclusion which is to be met, 26 show_capital(X) :- city(X), write(X), write($ is a city, not a country. $), nl.

 

[Purp|e]

hmmmmmm ... in like 25.5 hours it BEGINS lol hmmm i havnt looked at all that binary shit for ages einstein dude, but i wudnt be too worried about it ... i mean there can only be SO many marks on it, and it prolli wont be a real baed kent one so bleh

lol, im glad this time when sumone posted that question on evo of programming languages they actually sed it was from that option, y'day i came on and saw it and thought i wud have to know that shit @!!!! scared the fuck outta me!

for those who are cramz0ring like me, just read read read, then try and 'consolodate' it all by doing some exam q's ... GL HF