TAOCP 2.1: Introduction

Section 2.1 exercises: 9/9 solved.

9 items

Section 2.1. Introduction

Exercises from TAOCP Volume 1 Section 2.1: 9/9 solved.

#	Rating	Category	Status	Time
1	[04]	simple	solved	-
2	[10]	simple	solved	-
3	[11]	simple	solved	-
4	[18]	medium	solved	-
5	[21]	medium	solved	-
6	[06]	simple	solved	-
7	[04]	simple	solved	-
8	[18]	medium	solved	-
9	[23]	medium	solved	-

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 1

We examine the linked-list structure depicted in equation (3), where `TOP` points to the first element of a stack and each element contains a `NEXT` field referencing the next element in the stack.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 2

We have $\operatorname{LOC}(\operatorname{CONTENTS}(V)) = V$ precisely when $V$ is itself the location of some variable.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 3

Algorithm A inserts a card at the top of the pile.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 4

We wish to design an algorithm analogous to Algorithm A, but instead of placing a new card on top of the pile, we place it _face down_ at the _bottom_ of the pile.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 5

We are asked to find, for each query, a hotel room whose size meets a minimum requirement and whose room number is closest to a preferred room number.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 6

The assignment `CARD ← NODE(TOP)` copies the entire node at the address `TOP` into the variable `CARD`.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 7

The correct sequence to bring `NEXT(TOP)` into register A is sequence (a), `LDA TOP(NEXT)`.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 8

Steps B1-B3 insert a new card at the top of the linked pile.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.1: Introduction ›

TAOCP 2.1 Exercise 9

The pile of cards is represented as a linked list, with `TOP` pointing to the first node and `NEXT` giving the link to the next node.