for test

Question 1

Recursion

Answer 1

Function calling itself due to a c9ndition being met base case
Has stopping condition so it can exit
Don’t specify how many times called

Question 2

UML

Answer 2

unique moddling language,used to to present information so many people can understand and communicate

Question 3

OOP pros and cons

Answer 3

pros:
easy to use classes
create objects easily
less likely to overwrite original data
easy to test
cons:
difficult to learn
less effecint

Question 4

Backtracking

Answer 4

if one pathway to a solution fails the search for successful path begins at last successful point

Question 5

data mining

Answer 5

finding patterns in large sets of data

Question 6

pipelining

Answer 6

handling instructions abd completing a task while previous is completed
ouput 1=input 2

Question 7

big o

Answer 7

measuremnt of time complexity of an algorithm

Question 8

tree

Answer 8

https://en.wikipedia.org/wiki/Tree_(data_structure)

connected unidirected graph
pre order-NLR
in-order-LNR
post order-LRN

Question 9

graph

Answer 9

can be bidirectional
can be shown with :
matrix and adjacency list
used for searcing
graph can be cylical

Question 10

linked lists

Answer 10

data structure where each element has a seperate object.
eczh node points to the element.each node points to teh next element
pro:
saves memory
con:
no direct acess

Question 11

binary search

Answer 11

1) find midpoint
2) if midpoint=searching val then retrun index poistion
3) if mid> serached val, the UB= mid-1 and step 2
4) if mid

Question 12

Linear search

Answer 12

1) pointer of 0
2) if searched val =list[pointer] then return poistion
3) if not pointer=pointer +1 and step 2

Question 13

Queue

Answer 13

FIFO data structure
enqueue:
IF f=N
   error full
ELSE
   f+1-=item
dequeue

Question 14

plymorphism

Answer 14

using a method in different forms depending on the class

Question 15

class

Answer 15

template for instances

Question 16

attributes

Answer 16

variables in class

Question 17

object

Answer 17

instance of class that shares same atributes

Question 18

methods

Answer 18

sub routines in class

Question 19

insertion sort

Answer 19

1) 2 lists(sorted,unsorted)
2) unsorted item compared to sorted
3) if bigger put after if smaller put before
4) repeat from step 2