Commit 0019ecb

committed

added notes fro 3.2 stacks and queues

1 parent c8dbda2 commit 0019ecbCopy full SHA for 0019ecb

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,6 +3,8 @@ layout: post`
`3`	`3`	`title: 3.1 Arrays and linked lists`
`4`	`4`	`---`
`5`	`5`
	`6`	`+* abstract data types: container (stack, queue), dictionary, priority queue`
	`7`	`+* common data structures than can be used to implement them: arrays or linked lists and so on`
`6`	`8`	`* Contiguously-allocated structures are composed of single slabs of memory`
`7`	`9`	`* Linked data structures are composed of distinct chunks of memory bound together by pointers`
`8`	`10`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+---`
	`2`	`+layout: post`
	`3`	`+title: 3.2. Stacks and queues`
	`4`	`+---`
	`5`	`+`
	`6`	`+## Containers`
	`7`	`+`
	`8`	`+* abstract data structure that permits storage and retrieval of data items independent of content`
	`9`	`+* they're distinguished by the retrieval order they support`
	`10`	`+* in stacks and queues this retrieval order depends on the insertion order`
	`11`	`+`
	`12`	`+## Stacks`
	`13`	`+`
	`14`	`+* support retrieval by last-in, first-out (LIFO) order`
	`15`	`+* push - insert item at the top of the stack`
	`16`	`+* pop - return (and remove) the top item of the stack`
	`17`	`+`
	`18`	`+## Queues`
	`19`	`+`
	`20`	`+* support retrieval in first in, first out (FIFO) order`
	`21`	`+* minimize the maximum time spent waiting`
	`22`	`+* (average waiting time will be the same regardless of whether FIFO or LIFO is used)`
	`23`	`+* enqueue - insert an item at the back of the queue`
	`24`	`+* dequeue - return (and remove) the front item from the queue`
	`25`	`+`
	`26`	`+Both stacks and queues can be effectively implemented using either arrays or linked lists.`

Comments

(0)