Software Engineering

Question 1

Big o notation for 000.5n^3

Answer 1

n^3 we ignore all smaller terms, do some big O exampels

Question 2

BIG 0 order

Answer 2

2^N>n^3>N^2logn>N^2>NlogN>n>1(constant)

Question 3

Big O, O(x+Y)

Answer 3

the greater of x or y

Question 4

Big) (XY)

Answer 4

OxOy

Question 5

Bubble sort

Answer 5

start at index o
compare with item next to you. if its less than you, swap,
incriment.

repeat whole list until there are no swaps

Question 6

total passes for bubble sort of n length

Answer 6

n(n-1)/2

Question 7

bubble sort time

Answer 7

best O(n)
avg n^2
worst n^2

Question 8

Insertion sort

Answer 8

assume first item is sorted.
place the next item in the correct spot for the sorted section.
increase the sorted seciton

Question 9

total passes for insertion sort

Answer 9

n-1

Question 10

insertion sort time

Answer 10

best n
worst n^2
avg n^2

Question 11

selection sort

Answer 11

The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.

Question 12

seleciton sort time

Answer 12

n^2 all

Question 13

merge sort

Answer 13

Find the middle point to divide the array into two halves:
middle m = (l+r)/2
2. Call mergeSort for first half:
Call mergeSort(arr, l, m)
3. Call mergeSort for second half:
Call mergeSort(arr, m+1, r)
4. Merge the two halves sorted in step 2 and 3:
Call merge(arr, l, m, r)

Question 14

merge sort timing

Answer 14

nlogn for all

Question 15

Pivot sort

Answer 15

Pick a “pivot”

2. Divide into less-than & greater-than pivot
3. Sort each side recursively

Question 16

Binary search

Answer 16

Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item, until you’ve narrowed down the possible locations to just one

Question 17

benefits of linked lists

Answer 17

no needed size, dynamic, timing is all On but o1 for insert at end

GO OVER CREATION AND ALGORITHM STUFF

Question 18

adding data to stack

Answer 18

Go over stack stuff

push and pop affect stuff on top only

Question 19

enqueue

Answer 19

getting into the queue

Question 20

dequeue

Answer 20

gettingout of the querye, have been served

Question 21

peek

Answer 21

The peek() method of Queue Interface returns the element at the front the container. It does not deletes the element in the container.

Question 22

queue follows

Answer 22

FIFO

Question 23

in order tree traversal

Answer 23

visit left subtree, then root then right

Question 24

pre order tree traversal

Answer 24

visit current node, then left, then right

Question 25

post order tree traversal

Answer 25

traverse left, then right then root.

Question 26

BFS

Answer 26

used for traversing a graphs by visiting all unvisited nodes adjacent to start. then repeating for the adjacent nodes in same order

Question 27

DFS

Answer 27

visiting one adjacent node and then the next as deep as possible and then backtracking until there is anothe optioon, look at sol on guide

Question 28

Rigiid

Answer 28

software hard to change

Question 29

fragile

Answer 29

software prone to breaking in multiple places upon change

Question 30

portible

Answer 30

software that can be used in dif environments

Question 31

immobile

Answer 31

software that is difficult to re-use

Question 32

static software testing

Answer 32

verification through code review, walkthroughs and inspecitons

Question 33

glass box/white box testing

Answer 33

detailed investigation of the internals of the software. everything is transparent

Question 34

black box testinng

Answer 34

tester only cares about outcomes and inputs, no access to code itself is needed

Question 35

unit testing

Answer 35

dyunamicallyu executing unids of code to verify individual performance

Question 36

waterfall mdoel

Answer 36

linear, predetermiend phases and milestones. googhle it