CSC EXAM PREPARATION WITH FULL
COVERAGE
Which hgate hproduces ha h1 has hits houtput honly hif hboth hof hits hinputs hare h1? h-
hcorrect hanswers h-AND
Algorithm h- hcorrect hanswers h-an hordered hcollection hof hunambiguous, hexecutable
hsteps hthat hdefines ha hterminating hprocess.
Pseudocode h- hcorrect hanswers h-an hEnglish-like hlanguage hused hfor hrepresenting
halgorithms.
The hmain hpurpose hof hcomputer hprogramming his hto h- hcorrect hanswers h-solve
hproblems
, compiler h- hcorrect hanswers h-translates han hentire hcomputer hprogram hinto
hmachine hlanguage hand hwrites hit hto ha hfile hso hit hcan hlater hbe hexecuted.
One hof hthe hstages hin hdeveloping hsoftware his h- hcorrect hanswers h-requirements
hanalysis.
Java his hconsidered ha hmember hof hwhich hof hthe hfollowing hprogramming
hparadigms? h- hcorrect hanswers h-object horiented
Sequence, hselection hand hlooping hare h- hcorrect hanswers h-the hcategories hfor
hcontrol hstructures hused hin ha hprogramming hlanguage.
method hor hprocedure h- hcorrect hanswers h-is ha hblock hof hcode hthat hhas hbeen
hassigned ha hname.
A hvariable hhas h- hcorrect hanswers h-name, hmemory haddress, hand hcontents
walk-throughs hand hboundary hanalysis h- hcorrect hanswers h-Techniques hthat hare
huseful hfor htesting halgorithms hare
Boolean hvariables h- hcorrect hanswers h-can hcontain honly hthe hvalues htrue hor
hfalse.
a hparameter h- hcorrect hanswers h-a hvariable hthat his hused hto hpass hinformation hto
ha hfunction
decision h- hcorrect hanswers h-The hcode hbelow his hbest hdescribed has han hexample
hof h
if hy his hnot hequal hto h0 hthen
hz h= hx h/ hy
else
hz h= h0
end hif
The hfor hstatement his huseful hfor h- hcorrect hanswers h-executing ha hblock hof hcode
ha hpredetermined hnumber hof htimes.
9,7 h- hcorrect hanswers h-What hwould hbe hprinted hif hthe hfollowing hinstructions
hwere hexecuted? h
x h= h9 h
print hthe hvalue hof hx h
y h= h5 h
if h(x h< hy) hthen h
hprint hthe hvalue h6 h
COVERAGE
Which hgate hproduces ha h1 has hits houtput honly hif hboth hof hits hinputs hare h1? h-
hcorrect hanswers h-AND
Algorithm h- hcorrect hanswers h-an hordered hcollection hof hunambiguous, hexecutable
hsteps hthat hdefines ha hterminating hprocess.
Pseudocode h- hcorrect hanswers h-an hEnglish-like hlanguage hused hfor hrepresenting
halgorithms.
The hmain hpurpose hof hcomputer hprogramming his hto h- hcorrect hanswers h-solve
hproblems
, compiler h- hcorrect hanswers h-translates han hentire hcomputer hprogram hinto
hmachine hlanguage hand hwrites hit hto ha hfile hso hit hcan hlater hbe hexecuted.
One hof hthe hstages hin hdeveloping hsoftware his h- hcorrect hanswers h-requirements
hanalysis.
Java his hconsidered ha hmember hof hwhich hof hthe hfollowing hprogramming
hparadigms? h- hcorrect hanswers h-object horiented
Sequence, hselection hand hlooping hare h- hcorrect hanswers h-the hcategories hfor
hcontrol hstructures hused hin ha hprogramming hlanguage.
method hor hprocedure h- hcorrect hanswers h-is ha hblock hof hcode hthat hhas hbeen
hassigned ha hname.
A hvariable hhas h- hcorrect hanswers h-name, hmemory haddress, hand hcontents
walk-throughs hand hboundary hanalysis h- hcorrect hanswers h-Techniques hthat hare
huseful hfor htesting halgorithms hare
Boolean hvariables h- hcorrect hanswers h-can hcontain honly hthe hvalues htrue hor
hfalse.
a hparameter h- hcorrect hanswers h-a hvariable hthat his hused hto hpass hinformation hto
ha hfunction
decision h- hcorrect hanswers h-The hcode hbelow his hbest hdescribed has han hexample
hof h
if hy his hnot hequal hto h0 hthen
hz h= hx h/ hy
else
hz h= h0
end hif
The hfor hstatement his huseful hfor h- hcorrect hanswers h-executing ha hblock hof hcode
ha hpredetermined hnumber hof htimes.
9,7 h- hcorrect hanswers h-What hwould hbe hprinted hif hthe hfollowing hinstructions
hwere hexecuted? h
x h= h9 h
print hthe hvalue hof hx h
y h= h5 h
if h(x h< hy) hthen h
hprint hthe hvalue h6 h
