{"id":20,"date":"2019-09-05T08:45:57","date_gmt":"2019-09-05T08:45:57","guid":{"rendered":"http:\/\/learnlearn.uk\/alevelcs\/?page_id=20"},"modified":"2020-12-09T06:26:26","modified_gmt":"2020-12-09T06:26:26","slug":"stack-queues-linked-lists","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/","title":{"rendered":"Stack, Queues and Linked Lists"},"content":{"rendered":"

Lesson Plan<\/strong><\/p>\n

Review of arrays \/ lists – the difference. How Python creates dynamic arrays.<\/p>\n

Pack of cards to do a practical example<\/p>\n

Implement in Python<\/p>\n

Review of basis list functions – append(), pop(), pop(0)<\/p>\n

 <\/p>\n

Queue – People waiting for something<\/p>\n

 <\/p>\n

Advanced – Python Deque collections efficiency<\/a><\/p>\n

 <\/p>\n

Linked List(deque in Python implementation) vs List<\/p>\n

slower indexing in deque but faster append<\/p>\n

Deque is thread safe, list is not.<\/p>\n

 <\/p>\n

Video Resources<\/strong><\/p>\n

Python Queue Tutorial<\/a><\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Lesson Plan Review of arrays \/ lists – the difference. How Python creates dynamic arrays. Pack of cards to do a practical example Implement in Python Review of basis list functions – append(), pop(), pop(0)   Queue – People waiting for something   Advanced – Python Deque collections efficiency   Linked List(deque in Python implementation)… Read More »Stack, Queues and Linked Lists<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"","neve_meta_content_width":70,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"","neve_meta_disable_title":""},"yoast_head":"\nStack, Queues and Linked Lists - A Level Computer Science<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Stack, Queues and Linked Lists - A Level Computer Science\" \/>\n<meta property=\"og:description\" content=\"Lesson Plan Review of arrays \/ lists – the difference. How Python creates dynamic arrays. Pack of cards to do a practical example Implement in Python Review of basis list functions – append(), pop(), pop(0)   Queue – People waiting for something   Advanced – Python Deque collections efficiency   Linked List(deque in Python implementation)… Read More »Stack, Queues and Linked Lists\" \/>\n<meta property=\"og:url\" content=\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/\" \/>\n<meta property=\"og:site_name\" content=\"A Level Computer Science\" \/>\n<meta property=\"article:modified_time\" content=\"2020-12-09T06:26:26+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/\",\"url\":\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/\",\"name\":\"Stack, Queues and Linked Lists - A Level Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#website\"},\"datePublished\":\"2019-09-05T08:45:57+00:00\",\"dateModified\":\"2020-12-09T06:26:26+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/#breadcrumb\"},\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"A Level Computer Science Home\",\"item\":\"https:\/\/learnlearn.uk\/alevelcs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Stack, Queues and Linked Lists\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#website\",\"url\":\"https:\/\/learnlearn.uk\/alevelcs\/\",\"name\":\"A Level Computer Science\",\"description\":\"CIE Specification\",\"publisher\":{\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/learnlearn.uk\/alevelcs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#organization\",\"name\":\"A Level Computer Science\",\"url\":\"https:\/\/learnlearn.uk\/alevelcs\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/learnlearn.uk\/alevelcs\/wp-content\/uploads\/sites\/20\/2019\/09\/LearnLearnLogowhite.png\",\"contentUrl\":\"https:\/\/learnlearn.uk\/alevelcs\/wp-content\/uploads\/sites\/20\/2019\/09\/LearnLearnLogowhite.png\",\"width\":710,\"height\":98,\"caption\":\"A Level Computer Science\"},\"image\":{\"@id\":\"https:\/\/learnlearn.uk\/alevelcs\/#\/schema\/logo\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Stack, Queues and Linked Lists - A Level Computer Science","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/","og_locale":"en_GB","og_type":"article","og_title":"Stack, Queues and Linked Lists - A Level Computer Science","og_description":"Lesson Plan Review of arrays \/ lists – the difference. How Python creates dynamic arrays. Pack of cards to do a practical example Implement in Python Review of basis list functions – append(), pop(), pop(0)   Queue – People waiting for something   Advanced – Python Deque collections efficiency   Linked List(deque in Python implementation)… Read More »Stack, Queues and Linked Lists","og_url":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/","og_site_name":"A Level Computer Science","article_modified_time":"2020-12-09T06:26:26+00:00","twitter_card":"summary_large_image","schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/","url":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/","name":"Stack, Queues and Linked Lists - A Level Computer Science","isPartOf":{"@id":"https:\/\/learnlearn.uk\/alevelcs\/#website"},"datePublished":"2019-09-05T08:45:57+00:00","dateModified":"2020-12-09T06:26:26+00:00","breadcrumb":{"@id":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/#breadcrumb"},"inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/learnlearn.uk\/alevelcs\/stack-queues-linked-lists\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"A Level Computer Science Home","item":"https:\/\/learnlearn.uk\/alevelcs\/"},{"@type":"ListItem","position":2,"name":"Stack, Queues and Linked Lists"}]},{"@type":"WebSite","@id":"https:\/\/learnlearn.uk\/alevelcs\/#website","url":"https:\/\/learnlearn.uk\/alevelcs\/","name":"A Level Computer Science","description":"CIE Specification","publisher":{"@id":"https:\/\/learnlearn.uk\/alevelcs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/learnlearn.uk\/alevelcs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-GB"},{"@type":"Organization","@id":"https:\/\/learnlearn.uk\/alevelcs\/#organization","name":"A Level Computer Science","url":"https:\/\/learnlearn.uk\/alevelcs\/","logo":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/learnlearn.uk\/alevelcs\/#\/schema\/logo\/image\/","url":"https:\/\/learnlearn.uk\/alevelcs\/wp-content\/uploads\/sites\/20\/2019\/09\/LearnLearnLogowhite.png","contentUrl":"https:\/\/learnlearn.uk\/alevelcs\/wp-content\/uploads\/sites\/20\/2019\/09\/LearnLearnLogowhite.png","width":710,"height":98,"caption":"A Level Computer Science"},"image":{"@id":"https:\/\/learnlearn.uk\/alevelcs\/#\/schema\/logo\/image\/"}}]}},"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"learnlearnadmin","author_link":"https:\/\/learnlearn.uk\/alevelcs\/author\/learnlearnadmin\/"},"rttpg_comment":0,"rttpg_category":null,"rttpg_excerpt":"Lesson Plan Review of arrays \/ lists – the difference. How Python creates dynamic arrays. Pack of cards to do a practical example Implement in Python Review of basis list functions – append(), pop(), pop(0)   Queue – People waiting for something   Advanced – Python Deque collections efficiency   Linked List(deque in Python implementation)… Read…","_links":{"self":[{"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/pages\/20"}],"collection":[{"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/comments?post=20"}],"version-history":[{"count":4,"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/pages\/20\/revisions"}],"predecessor-version":[{"id":1318,"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/pages\/20\/revisions\/1318"}],"wp:attachment":[{"href":"https:\/\/learnlearn.uk\/alevelcs\/wp-json\/wp\/v2\/media?parent=20"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}