ITECC04 Flashcards

1
Q

Which operation is characteristic of a Queue data structure?

A

Dequeue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Which HashSet feature ensures that it stores only unique elements?

A

Hashing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What function adds and element in an ArrayList?

A

add();

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What function contatenates two ArrayList?

A

ar1.addAll(index, ar2);

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What function put an ArrayList to another at a specific index?

A

ar1.addAll(index, ar2);

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

adds an item to arraylist at an index

A

al.add(i, item);

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

removes an item’s first occurence in an array list

A

al.remove(item);

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

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

A

Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

describes computation in terms of instructions that change the program/data state

A

Imperative Programming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

specifies what the program should accomplish without describing how to do it.

A

Declarative Programming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

refers to the extra space used in the program other than the input data structure.

A

Auxilliary Space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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

A

Asymptotic notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

This notation specifically describes the
worst-case scenario.

A

Big-o notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

This notation specifically describes the
best-case scenario.

A

Omega Notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

This notation represents the average
complexity of an algorithm.

A

Theta notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Function used to access an item in an array list?

A

get();

17
Q

Modify an element in an arraylist

A

set()

18
Q

get size of an array list

A

size()

19
Q

gets the index of an item in arraylist

A

indexOf()

20
Q
A