Download Application Programmer Terms with Correct Answers 2025–2026 | Programming & IT Concepts | and more Exams Computer Applications in PDF only on Docsity!
APPLICATIONbnPROGRAMMERbnTERMS
bnWITH bnCORRECT bnANSWERS
Process bnBlock bn- bnCORRECT bnANSWER bn-Part bnof bna bnflowchart bnthat bntells bnthe bnprogram bnwhat bnaction bnto bntake. bnUse bnrectangles bnto bncapture bnprocess bnsteps bnlike bnbasic bntasks bnor bnactions bnin bnyour bnprocess Decision bnBlock bn- bnCORRECT bnANSWER bn-The bndiamond-shaped bnblock bnused bnfor bnYES/NO bnquestions. bnThese bnblocks bnhave bntwo bnoutputs: bn 1 bn(for bnyes) bnand bn 2 bn(for bnno). Stored bnData bnblock bn- bnCORRECT bnANSWER bn-This bnis bna bngeneral bndata bnstorage bnobject bnused bnin bnthe bnprocess bnflow bnas bnopposed bnto bndata bnwhich bncould bnbe bnalso bnstored bnon bna bnhard bndrive, bnmagnetic bntape, bnmemory card, bnof bnany bnother bnstorage bndevice. data bnblock bn(i/o) bn- bnCORRECT bnANSWER bn-The bnData bnobject, bnoften bnreferred bnto bnas bnthe bnI/O bnShape bnshows bnthe bnInputs bnto bnand bnOutputs bnfrom bna bnprocess. bnThis bntakes bnthe bnshape bnof bna bnparallelogram. Flowchart bnTerminal/Terminator bn- bnCORRECT bnANSWER bn-The bnterminator bnshows bnwhere bnyour bnprocess bnbegins bnor bnends. bnYou bncan bnuse bnwords bnlike bn'Start', bn'Begin', bn'End' bninside bnthe bnterminator bnshape bnto bnmake bnthings bnmore bnobvious. Flowchart bnDocument bn- bnCORRECT bnANSWER bn-Document bnobject bnis bna bnrectangle bnwith bna bnwave-like bnbase. bnThis bnshape bnis bnused bnto bnrepresent bna bnDocument bnor bnReport bnin bna bnprocess bnflow. Direct bnData bn- bnCORRECT bnANSWER bn-Direct bnData bnobject bnin bna bnprocess bnflow bnrepresents bninformation bnstored bnwhich bncan bnbe bnaccessed bndirectly. bnThis bnobject bnrepresents bna bncomputer's bnhard bndrive. bnUsually bncylinder bnor bncone bnshaped bnlaying bnon bnits bnside. internal bnstorage bn- bnCORRECT bnANSWER bn-This bnis bna bnshape bnwhich bnis bncommonly bnfound bnin bnprogramming bnflowcharts bnto bnillustrate bnthe bninformation bnstored bnin bnmemory, bnas bnopposed bnto bnon bna bnfile. bnThis bnshape bnis
often bnreferred bnto bnas bnthe bnmagnetic bncore bnmemory bnof bnearly bncomputers; bnor bnthe bnrandom bnaccess bnmemory bn(RAM) bnas bnwe bncall bnit bntoday. sequential bnaccess bn- bnCORRECT bnANSWER bn-A bnmethod bnof bndata bnaccess bnused bnby bntape bndrives, bnwhereby bndata bnis bnwritten bnor bnread bnsequentially bnfrom bnthe bnbeginning bnto bnthe bnend bnof bnthe bntape bnor bnuntil bnthe desired bndata bnis bnfound. bnThis bnobject bntakes bnthe bnshape bnof bna bnreel bnof bntape. bnIt bnrepresents bninformation bnstored bnin bna bnsequence, bnsuch bnas bndata bnon bna bnmagnetic bntape. Manual bnInput bn- bnCORRECT bnANSWER bn-This bnobject bnis bnrepresented bnby bnrectangle bnwith bnthe bntop bnsloping bnup bnfrom bnleft bnto bnright. bnThe bnManual bnInput bnobject bnsignifies bnan bnaction bnwhere bnthe bnuser bnis bnprompted bnfor bninformation bnthat bnmust bnbe bnmanually bninput bninto bna bnsystem. Subroutine bn- bnCORRECT bnANSWER bn-A bnsubordinate bnroutine; bnspecifically, bna bnsequence bnof bncomputer bninstructions bnfor bnperforming bna bnspecified bntask bnthat bncan bnbe bnused bnrepeatedly. bnThe bnsame bnobject bnis bnalso bncalled bna bnPredefined bnProcess. bnThis bnmeans bnthe bnflowchart bnfor bnthe bnpredefined bnprocess bnhas bnto bnbe alreadybndrawn, bnand bnyou bnshould bnreference bnthe bnflowchart bnfor bnmore bninformation. sequence bnprogramming bn- bnCORRECT bnANSWER bn-One bnof bnthe bnthree bnbasic bnlogic bnstructures bnin bncomputer bnprogramming. bnThe bnother bntwo bnlogic bnstructures bnare bnselection bnand bnloop. In bna bnsequence bnstructure, bnan bnaction, bnor bnevent, bnleads bnto bnthe bnnext bnordered bnaction bnin bna predetermined bnorder. bnThe bnsequence bncan bncontain bnany bnnumber bnof bnactions, bnbut bnno bnactions bncan bnbe bnskipped bnin bnthe bnsequence. Selection bnProgramming bn- bnCORRECT bnANSWER bn-In bna bnselection bnstructure, bna bnquestion bnis bnasked, bnand bndepending bnon bnthe bnanswer, bnthe bnprogram bntakes bnone bnof bntwo bncourses bnof bnaction, bnafter bnwhich bnthe bnprogram bnmoves bnon bnto bnthe bnnext bnevent. This bnstructure bnis bnsometimes bnreferred bnto bnas bnan bnif-then-else bnbecause bnit bndirects bnthe bnprogram bnto bnperform bnin bnthis bnway: bnIf bnCondition bnA bnis bnTrue bnthen bnperform bnAction bnX bnelseperform bnAction bnY
Polymorphism bn- bnCORRECT bnANSWER bn-The bnconcept bnthat bnobjects bnof bndifferent bntypes bncan bnbe bnaccessed bnthrough bnthe bnsame bninterface. bnEach bntype bncan bnprovide bnits bnown, bnindependent bnimplementation bnof bnthis bninterface. Polymorphism bngives bna bnway bnto bnuse bna bnclass bnexactly bnlike bnits bnparent bnso bnthere's bnno bnconfusion bnwith bnmixing b n types. b n But b n each b n child b n class b n keeps b n its b n own b n methods b n as b n they b n are. This b n typically b n happens b n by b n defining b n a b n (parent) b n interface b n to b n be b n reused. b n It b n outlines b n a b n bunch b n of bncommon b n methods. b n Then, b n each b n child b n class b n implements b n its b n own b n version b n of b n these b n methods. SDLC b n Analysis b n - b n CORRECT b n ANSWER b n - Determine b n user b n requirements b n for b n new b n system b n and b n develop b n logical b n system b n models b n (i.e., b n graph bnic b n displays b n that b n demonstrate b n the b n relationships b n between b n resources, b n activities, b n and b n outputs b n an bnd b n outcomes). "What bnare bnthe bncurrent bnproblems?" bnThis bnstage bnof bnthe bnSDLC bnmeans bngetting bninput bnfrom bnall bnstak bneholders, bnincluding bncustomers, bnsalespeople, bnindustry bnexperts, bnand bnprogrammers. bnLearn bnthe bnst bnrengths b n and b n weaknesses b n of b n the b n current b n system b n with b n improvement b n as b n the b n goal. SDLC: b n Planning b n - b n CORRECT b n ANSWER b n - An b n organization's b n total b n information b n system b n needs b n are b n identified, b n analyzed, b n prioritized, b n and b n ar bnranged. "What b n do b n we b n want?" b n In b n this b n stage b n of b n the b n SDLC, b n the b n team b n determines b n the b n cost b n and b n resource bns b n required b n for b n implementing b n the b n analyzed b n requirements. b n It b n also b n details b n the b n risks b n involved b n an bnd b n provides b n sub-plans b n for b n softening b n those b n risks. In b n other b n words, b n the b n team b n should b n determine b n the b n feasibility b n of b n the b n project b n and b n how b n they b n can bnimplement b n the b n project b n successfully b n with b n the b n lowest b n risk b n in b n mind.
SDLC: b n Design b n - b n CORRECT b n ANSWER b n - A b n description b n of b n the b n recommended b n solution b n is b n converted b n into b n logical b n and b n then b n physical b n syste bnm b n specifications. "How b n will b n we b n get b n what b n we b n want?" b n This b n phase b n of b n the b n SDLC b n starts b n by b n turning b n the b n software b n sp bnecifications b n into b n a b n design b n plan b n called b n the b n Design b n Specification. b n All b n stakeholders b n then b n review b n t bnhis b n plan b n and b n offer b n feedback b n and b n suggestions. b n It's b n crucial b n to b n have b n a b n plan b n for b n collecting b n and b n in bncorporating b n stakeholder b n input b n into b n this b n document. b n Failure b n at b n this b n stage b n will b n almost b n certainly bnresult b n in b n cost b n overruns b n at b n best b n and b n the b n total b n collapse b n of b n the b n project b n at b n worst. SDLC b n Development b n Phase b n - b n CORRECT b n ANSWER b n - Involves b n taking b n all b n of b n the b n detailed b n design b n documents b n from b n the b n design b n phase b n and b n transformin bng b n them b n into b n the b n actual b n system. "Let's b n create b n what b n we b n want." At b n this b n stage, b n the b n actual b n development b n starts. b n It's b n important b n that b n every b n developer b n sticks b n to b n th bne b n agreed b n blueprint. b n Also, b n make b n sure b n you b n have b n proper b n guidelines b n in b n place b n about b n the b n code b n sty bnle b n and b n practices. SDLC b n Testing b n - b n CORRECT b n ANSWER b n - Verifies bnthat bnthe bnsystem bnworks bnand bnmeets bnall bnof bnthe bnbusiness bnrequirements bndefined bnin bnthe bna bnnalysis b n phase 1.) Write b n the b n test b n conditions 2.) Perform b n the b n testing b n of b n the b n system "Did b n we b n get b n what b n we b n want?" b n In b n this b n stage, b n we b n test b n for b n defects b n and b n deficiencies. b n We b n fix b n thos bne b n issues b n until b n the b n product b n meets b n the b n original b n specifications. SDLC b n Deployment b n - b n CORRECT b n ANSWER b n - "Let's b n start b n using b n what b n we b n got."
It b n is b n called b n binary b n because b n each b n node b n can b n have b n at b n most b n two b n children. b n The b n node b n directly b n abo bnve b n another b n node b n is b n called b n its b n parent. b n The b n tree b n which b n is b n a b n child b n of b n a b n node b n is b n called b n subtree. Elements b n with b n no b n children b n are b n called b n Leaves. b n The b n maximum b n number b n of b n nodes b n from b n root b n to b n l bneaf b n is b n called b n the b n height. Full b n Binary b n Tree b n - b n CORRECT b n ANSWER b n - A b n full b n binary b n tree b n (sometimes b n referred b n to b n as b n a b n proper b n or b n plane b n binary b n tree) b n is b n a b n tree b n in b n whic bnh b n every b n node b n in b n the b n tree b n has b n either b n 0 b n or b n 2 b n children. Complete b n Binary b n Tree b n - b n CORRECT b n ANSWER b n - In b n a b n complete b n binary b n tree b n every b n level, b n except b n possibly b n the b n last, b n is b n completely b n filled, b n and b n all b n n bnodes b n in b n the b n last b n level b n are b n as b n far b n left b n as b n possible. Perfect b n Binary b n Tree b n - b n CORRECT b n ANSWER b n - A b n perfect b n binary b n tree b n is b n a b n binary b n tree b n in b n which b n all b n interior b n nodes b n have b n two b n children b n and b n all b n l bneaves b n have b n the b n same b n depth b n or b n same b n level. Queue b n data b n structure b n - b n CORRECT b n ANSWER b n - Operates b n on b n a b n (first b n in, b n first b n out) b n FIFO b n basis; b n new b n elements b n can b n be b n added b n at b n the b n end b n of b n the bndatabase; b n removal b n occurs b n only b n at b n the b n head. Adding b n new b n elements b n into b n queue b n is b n called b n enqueue. b n Removing b n an b n element b n is b n called b n dequeu bne Hash b n Table b n - b n CORRECT b n ANSWER b n - A b n data b n structure b n where b n the b n calculated b n value b n is b n used b n to b n mark b n the b n position b n in b n the b n table b n wher bne b n the b n data b n item b n should b n be b n stored b n using b n key- value b n pairs, b n enabling b n it b n to b n be b n accessed b n directly, b n rather b n than b n forcing b n a b n sequential b n search. Inefficient b n at b n sorting b n data.
linked b n list b n - b n CORRECT b n ANSWER b n - a b n collection b n of b n nodes b n arranged b n so b n that b n each b n node b n contains b n a b n link b n (or b n pointer) b n to b n the b n next b n n bnode b n in b n the b n sequence. Random b n access b n is b n not b n allowed b n with b n linked b n list, b n must b n access b n nodes b n sequentially b n starting b n from bnthe b n first b n one. Stack b n data b n structure b n - b n CORRECT b n ANSWER b n - Uses b n (last b n in, b n first b n out) b n LIFO b n basis; b n elements b n can b n be b n removed b n and b n added b n only b n to b n the b n top b n of bnthe b n list. b n Adding b n new b n element b n is b n called b n push b n and b n removing b n is b n called b n pop scalar b n multiplication b n - b n CORRECT b n ANSWER b n - the b n process b n of b n multiplying b n each b n element b n of b n a b n matrix b n by b n a b n real b n number b n or b n scalar Addition b n of b n Matrices b n - b n CORRECT b n ANSWER b n - (A b n + b n B) b n = b n (A) b n + b n (B). b n Just b n add b n all b n the b n entries b n together Matrix b n Multiplication b n - b n CORRECT b n ANSWER b n - Performed b n by b n multiplying b n the b n elements b n of b n each b n row b n of b n the b n first b n matrix b n by b n the b n elements b n of bneach b n column b n of b n the b n second b n matrix. b n Add b n the b n products. Matrix b n Transpose b n - b n CORRECT b n ANSWER b n - Returns b n the b n transpose b n of b n a b n matrix, b n switches b n the b n rows b n and b n columns Gap b n buffer b n - b n CORRECT b n ANSWER b n - A b n dynamic b n array b n that b n allows b n efficient b n insertion b n and b n deletion b n operations b n clustered b n near b n the b n s bname b n location Heap b n Binary b n Tree: b n definition b n - b n CORRECT b n ANSWER b n - bnA b n binary b n tree b n with b n two b n additional b n constraints:
SQL b n LIKE b n - b n CORRECT b n ANSWER b n - Useful b n when b n specifying b n a b n search b n condition b n within b n your b n WHERE b n clause. SELECT b n * b n FROM b n employees bnWHERE b n FirstName b n LIKE b n 'A%'; Will b n return b n employees b n with b n first b n name b n starting b n with b n A SQL b n Custom b n Names b n - b n CORRECT b n ANSWER b n - SELECT b n ct.ID, b n ord.name bnFROM b n customers b n AS b n ct, b n orders b n AS b n ord inner b n join b n - b n CORRECT b n ANSWER b n - Most b n common b n type b n of b n join; b n includes b n rows b n in b n the b n query b n only b n when b n the b n joined b n field b n matches bnrecords b n in b n both b n tables. left b n outer b n join b n - b n CORRECT b n ANSWER b n - A b n join b n in b n which b n all b n rows b n from b n the b n table b n on b n the b n left b n will b n be b n included b n regardless b n of b n whether b n t bnhey b n match b n rows b n from b n the b n table b n on b n the b n right right b n outer b n join b n - b n CORRECT b n ANSWER b n - A b n join b n in b n which b n all b n rows b n from b n the b n table b n on b n the b n right b n will b n be b n included b n regardless b n of b n whether bnthey b n match b n rows b n from b n the b n table b n on b n the b n left SQL b n Union b n - b n CORRECT b n ANSWER b n - Used b n to b n combine b n the b n result b n sets b n of b n two b n or b n more b n SELECT b n statements b n returning b n results b n witho bnut b n duplicates
SQL b n Union b n All b n - b n CORRECT b n ANSWER b n - Used bnto bncombine bnthe bnresult bnsets bnof bntwo bnor bnmore bnSELECT bnstatements bnreturning bnresults bnwith bnd bnuplicates, b n hence b n ALL ALTER b n TABLE b n - b n CORRECT b n ANSWER b n - The b n SQL b n command b n used b n to b n make b n changes b n to b n table b n structure. b n When b n the b n command b n is b n followe bnd b n by b n a b n keyword b n (ADD b n or b n MODIFY), b n it b n adds b n a b n column b n or b n changes b n column b n characteristics. SQL b n DROP b n - b n CORRECT b n ANSWER b n - to b n delete b n existing b n database b n objects b n or b n columns SQL b n view b n - b n CORRECT b n ANSWER b n - A bnwindow bnthat bndisplays bnthe bnSQL bnstatement bnfor bnthe bncurrent bnquery bnor bnis bnused bnto bncreate bna bnSQL bnspecific b n query. b n When b n you b n create b n a b n query b n in b n design b n view, b n Access b n constructs b n the b n SQL b n equival bnent b n in b n the b n SQL b n view.
