Computer Science Concepts

Front

In 'Type-II' polynomial representation, what is a drawback for dense polynomials?

Back

It can require approximately twice as much storage as Type-I.

Front

What is a 'dangling reference' in pointers and dynamic memory?

Back

A pointer that points to a memory location that has already been deallocated or freed.

Front

How does fast_transpose improve upon basic matrix transpose?

Back

It calculates the number of elements per column to directly place each element in its final position.

Front

How can a jagged 2D array be created in C?

Back

Allocate an array of pointers, then allocate memory for each row individually.

Front

What is the formal definition of Big O notation, f(n) = O(g(n))?

Back

There exist positive constants c and n₀ such that f(n) ≤ c·g(n) for all n ≥ n₀.

Front

What is a disadvantage of 'Type-I' polynomial representation?

Back

It wastes a large amount of space for sparse polynomials.

Front

Which is NOT required for an algorithm?

Back

Optimality.

Front

Total space complexity S(P) of a program P consists of what?

Back

Fixed space requirement (c) and variable space requirement (Sp(I)).

Front

Difference between int list[5]; and int *plist[5];?

Back

list[5] is an array of five integers; *plist[5] is an array of five pointers to integers.

Front

Defining characteristic of an Abstract Data Type (ADT)?

Back

Separates the representation and implementation of operations from their logical properties.