ITECC04 Flashcards
Which operation is characteristic of a Queue data structure?
Dequeue
Which HashSet feature ensures that it stores only unique elements?
Hashing
What function adds and element in an ArrayList?
add();
What function contatenates two ArrayList?
ar1.addAll(index, ar2);
What function put an ArrayList to another at a specific index?
ar1.addAll(index, ar2);
adds an item to arraylist at an index
al.add(i, item);
removes an item’s first occurence in an array list
al.remove(item);
a finite sequence of instructions, each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time
Algorithm
describes computation in terms of instructions that change the program/data state
Imperative Programming
specifies what the program should accomplish without describing how to do it.
Declarative Programming
refers to the extra space used in the program other than the input data structure.
Auxilliary Space
is a mathematical tool that calculates the required time in terms of input size and does not require the execution of the code. It neglects the system-dependent constants and is related to only the number of modular operations being performed in the whole program
Asymptotic notation
This notation specifically describes the
worst-case scenario.
Big-o notation
This notation specifically describes the
best-case scenario.
Omega Notation
This notation represents the average
complexity of an algorithm.
Theta notation