improving pseudo code
play

Improving Pseudo-Code CS16: Introduction to Data Structures & - PowerPoint PPT Presentation

Jun 26, 2023 •181 likes •616 views

Improving Pseudo-Code CS16: Introduction to Data Structures & Algorithms Spring 2020 CleanYour Code! Errors per line is approximately constant fewer lines fewer errors overall Fewer lines are easier to grade more likely to

  1. Improving Pseudo-Code CS16: Introduction to Data Structures & Algorithms Spring 2020

  2. CleanYour Code! ‣ Errors per line is approximately constant ‣ fewer lines → fewer errors overall ‣ Fewer lines are easier to grade ‣ more likely to receive credit ‣ Clean code reflects clean thinking ‣ and a better understanding of material ‣ Let’s see some examples 2

  3. Lowest Common Ancestor ‣ Given two nodes u and v ‣ determine deepest node that is ancestor of both A u v LCA(u, v) C D A D B C J E B E F G H G J A G C C I J K 3 3

  4. Lowest Common Ancestor 3 min Activity #1 4

  5. Lowest Common Ancestor 3 min Activity #1 5

  6. Lowest Common Ancestor 2 min Activity #1 6

  7. Lowest Common Ancestor 1 min Activity #1 7

  8. Lowest Common Ancestor 0 min Activity #1 8

  9. Ways to Improve Pseudo-Code ‣ Clarify inputs and outputs with comments ‣ good habit and makes methods easier to understand ‣ Make sure all necessary arguments are included as parameters 9

  10. Lowest Common Ancestor function LCA (u, v): Inputs & outputs ? lca = null udepth = T.depth(u) vdepth = T.depth(v) if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if udepth > vdepth then u = T.parent(u) udepth = udepth – 1 else if vdepth > udepth v = T.parent(v) vdepth = vdepth – 1 else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 10

  11. Lowest Common Ancestor function LCA (u, v): // Input: two nodes u, v // Output: the lowest common ancestor of u and v lca = null udepth = T.depth(u) vdepth = T.depth(v) if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if udepth > vdepth then u = T.parent(u) udepth = udepth – 1 else if vdepth > udepth v = T.parent(v) vdepth = vdepth – 1 else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 11

  12. Lowest Common Ancestor function LCA (u, v): // Input: two nodes u, v // Output: the lowest common ancestor of u and v lca = null Where does T udepth = T.depth(u) vdepth = T.depth(v) come from? if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if udepth > vdepth then u = T.parent(u) udepth = udepth – 1 else if vdepth > udepth v = T.parent(v) vdepth = vdepth – 1 else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 12

  13. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null udepth = T.depth(u) vdepth = T.depth(v) if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if udepth > vdepth then u = T.parent(u) udepth = udepth – 1 else if vdepth > udepth v = T.parent(v) vdepth = vdepth – 1 else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 13

  14. Ways to Improve Pseudo-Code ‣ Get rid of unnecessary variables ‣ Using vars for information that is elsewhere… ‣ …leads to careless errors ‣ In example, no need for udepth and vdepth ‣ since Tree keeps track of node’s depth 14

  15. Lowest Common Ancestor function LCA (u, v, T): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null udepth = T.depth(u) vdepth = T.depth(v) if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if udepth > vdepth then 〉 u = T.parent(u) Needlessly udepth = udepth – 1 complex else if vdepth > udepth v = T.parent(v) vdepth = vdepth – 1 else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 15

  16. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v Now lca = null irrelevant 〉 udepth = T.depth(u) vdepth = T.depth(v) if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u); udepth = udepth - 1 v = T.parent(v); vdepth = vdepth – 1 return lca 16

  17. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 17

  18. Ways to Improve Pseudo-Code ‣ If method returns boolean ‣ no need to check if returned value ==true ‣ Logical operators can be used on boolean returned valued ‣ !T.isroot(u) is same as T.isroot(u)==false 18

  19. Lowest Common Ancestor function LCA (u, v, T ): Redundant // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v equality checks lca = null if (T.isroot(u) == true) or (T.isroot(v) == true) then lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 19

  20. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if T.isroot(u) or T.isroot(v) then lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 20

  21. Lowest Common Ancestor function LCA (u, v, T ): Just removed // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v whitespace lca = null if T.isroot(u) or T.isroot(v) then lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 21

  22. Ways to Improve Pseudo-Code ‣ As soon as you found answer, return it ‣ This avoids going through unnecessary code 22

  23. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v It’s the answer. lca = null if T.isroot(u) or T.isroot(v) then Return it! lca = T.root while (lca == null) do if (u == v) then lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 23

  24. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if T.isroot(u) or T.isroot(v) then lca = T.root return lca It’s the answer. while (lca == null) do if (u == v) then Return it! lca = u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 24

  25. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if T.isroot(u) or T.isroot(v) then lca = T.root return lca while (lca == null) do if (u == v) then lca = u return lca else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 25

  26. Ways to Improve Pseudo-Code ‣ If variable is only used to return something ‣ simply return it ‣ Avoids keeping track of unnecessary variables ‣ and makes code shorter and cleaner 26

  27. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if T.isroot(u) or T.isroot(v) then Condition is lca = T.root return lca irrelevant while (lca == null) do if (u == v) then lca = u return lca else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) return lca 27

  28. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v lca = null if T.isroot(u) or T.isroot(v) then lca is no longer lca = T.root return lca used repeat if (u == v) then lca = u return lca else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) 28

  29. Lowest Common Ancestor function LCA (u, v, T ): // Input: two nodes u, v in a tree T // Output: the lowest common ancestor of u and v if T.isroot(u) or T.isroot(v) then return T.root repeat if (u == v) then return u else if T.depth(u) > T.depth(v) then u = T.parent(u) else if T.depth(v) > T.depth(u) v = T.parent(v) else u = T.parent(u) v = T.parent(v) 29

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Algorithm Design An algorithm can be written out in pseudo code Then turned into source code

Algorithm Design An algorithm can be written out in pseudo code Then turned into source code

Algorithm Design An algorithm can be written out in pseudo code Then turned into source code Which is then compiled to machine code Problem Solving Algorithm: set of unambiguous instructions to solve a problem Breaking down a

459 views • 25 slides
A L2-Norm Regularized Pseudo-Code for Change Analysis in Satellite Image Time Series A. Radoi 1 M.

A L2-Norm Regularized Pseudo-Code for Change Analysis in Satellite Image Time Series A. Radoi 1 M.

Motivation & Aim Traditional Change Analysis Techniques Pseudo-code for Change Analysis in SITS Experiments Conclusions A L2-Norm Regularized Pseudo-Code for Change Analysis in Satellite Image Time Series A. Radoi 1 M. Datcu 2 1 Research

312 views • 16 slides
USING PSEUDO-SENSES FOR IMPROVING THE EXTRACTION OF SYNONYMS FROM WORD EMBEDDINGS Olivier Ferret

USING PSEUDO-SENSES FOR IMPROVING THE EXTRACTION OF SYNONYMS FROM WORD EMBEDDINGS Olivier Ferret

USING PSEUDO-SENSES FOR IMPROVING THE EXTRACTION OF SYNONYMS FROM WORD EMBEDDINGS Olivier Ferret CONTEXT AND OBJECTIVES Context semantic specialization of word embeddings most approaches following Retrofitting [Faruqui et al.,

341 views • 11 slides
WRITING QUALITY CODE IDEAS, TECHNIQUES AND TOOLS FOR IMPROVING THE QUALITY OF WRITTEN CODE

WRITING QUALITY CODE IDEAS, TECHNIQUES AND TOOLS FOR IMPROVING THE QUALITY OF WRITTEN CODE

WRITING QUALITY CODE IDEAS, TECHNIQUES AND TOOLS FOR IMPROVING THE QUALITY OF WRITTEN CODE Radosaw Jankiewicz / @radek_j / radekj WHO AM I Programming in Python since 2007 Web applications (mostly) RANDOM FACT... AGENDA 1. Definition

881 views • 53 slides
Pseudo-random numbers: a line at a time mostly Nelson H. F.

Pseudo-random numbers: a line at a time mostly Nelson H. F.

of code Pseudo-random numbers: a line at a time mostly Nelson H. F. Beebe Research Professor University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA

837 views • 65 slides
Pseudo-random numbers: a line at a time mostly Nelson H. F.

Pseudo-random numbers: a line at a time mostly Nelson H. F.

of code Pseudo-random numbers: a line at a time mostly Nelson H. F. Beebe Research Professor University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090, USA

693 views • 68 slides
Pseudo-random numbers: a line at a time mostly Nelson H. F.

Pseudo-random numbers: a line at a time mostly Nelson H. F.

of code Pseudo-random numbers: a line at a time mostly Nelson H. F. Beebe Research Professor University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA

1.07k views • 78 slides
Technical Aspects of the Paper: Improving Code Readability Models with Textual Features

Technical Aspects of the Paper: Improving Code Readability Models with Textual Features

Technical Aspects of the Paper: Improving Code Readability Models with Textual Features Deeksha Arya COMP762 Key Concepts Previous work as mentioned in the paper: QALP tool (to compute similarity between comment and code) Entropy

585 views • 16 slides
Dynamic Data Excavation or: Gimme back my symbol table! Asia Slowinska Traian Stancescu

Dynamic Data Excavation or: Gimme back my symbol table! Asia Slowinska Traian Stancescu

Dynamic Data Excavation or: Gimme back my symbol table! Asia Slowinska Traian Stancescu Herbert Bos VU University Amsterdam Compilation is pseudo-unbreakable code irreversibility assumption Compilation is pseudo-unbreakable code

808 views • 59 slides
A Code Curriculum at Your Fingertips: Improving Performance and Resident A Code Curriculum at Your

A Code Curriculum at Your Fingertips: Improving Performance and Resident A Code Curriculum at Your

A Code Curriculum at Your Fingertips: Improving Performance and Resident A Code Curriculum at Your Fingertips: Improving Performance and Resident Confidence in Pediatric Codes Confidence in Pediatric Codes Alyssa Buono, MD-R, Kelli Davis, DO-R,

325 views • 7 slides
Stackable GSS Pseudo-Mechs draft-williams-gssapi-stackable-pseudo-mechs-00

Stackable GSS Pseudo-Mechs draft-williams-gssapi-stackable-pseudo-mechs-00

Stackable GSS Pseudo-Mechs draft-williams-gssapi-stackable-pseudo-mechs-00 Nicolas.Williams@sun.com 60 th IETF KITTEN BoF History 2000: LIPKEY [RFC2847], basic-over-SPKM Early-2003: CCM-BIND (I-D), first stackable GSS-API

347 views • 21 slides
IMPROVING PROGRAMS THROUGH SOURCE CODE TRANSFORMATIONS Disserta(on

IMPROVING PROGRAMS THROUGH SOURCE CODE TRANSFORMATIONS Disserta(on

IMPROVING PROGRAMS THROUGH SOURCE CODE TRANSFORMATIONS Disserta(on Proposal Jonathan Dorn April 19, 2016 Beyond Functional Correctness So9ware development

775 views • 59 slides
Models for Inexact Reasoning Reasoning with Subjective Pseudo Reasoning with Subjective Pseudo

Models for Inexact Reasoning Reasoning with Subjective Pseudo Reasoning with Subjective Pseudo

Models for Inexact Reasoning Reasoning with Subjective Pseudo Reasoning with Subjective Pseudo Probabilities: The PROSPECTOR Approach Miguel Garca Remesal Department of Artificial Intelligence mgremesal@fi.upm.es The PROSPECTOR System The

276 views • 17 slides
Code Generation Example Tsan-sheng Hsu tshsu@iis.sinica.edu.tw

Code Generation Example Tsan-sheng Hsu tshsu@iis.sinica.edu.tw

Code Generation Example Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Warnings This set of slides contain a pseudo code for a very simple compiler. This is an example, not the standard solution.

675 views • 13 slides
(Pseudo)-Relevance Feedback & Passage Retrieval Ling573 NLP Systems & Applications

(Pseudo)-Relevance Feedback & Passage Retrieval Ling573 NLP Systems & Applications

(Pseudo)-Relevance Feedback & Passage Retrieval Ling573 NLP Systems & Applications April 28, 2011 Roadmap Retrieval systems Improving document retrieval Compression & Expansion techniques Passage retrieval:

926 views • 78 slides
Improving Quality Team Coding Skills with Code Clubs Dwayne & Kevin. Testers at CrowdCompass

Improving Quality Team Coding Skills with Code Clubs Dwayne & Kevin. Testers at CrowdCompass

Improving Quality Team Coding Skills with Code Clubs Dwayne & Kevin. Testers at CrowdCompass by Cvent. Technical Paper: http://www.pnsqc.org/code-clubs-as-training-for-app-debugging-and-programming-tasks/ What ways are you using to learn

596 views • 38 slides
tools and datasets Thursday 14 th May, 13:00-14:30 @asbp_uk Agenda 13:00 Welcome from the

tools and datasets Thursday 14 th May, 13:00-14:30 @asbp_uk Agenda 13:00 Welcome from the

Webinar: Life Cycle Analysis (LCA) tools and datasets Thursday 14 th May, 13:00-14:30 @asbp_uk Agenda 13:00 Welcome from the webinar chair - Jane Anderson, ASBP board member and Director, ConstructionLCA 13:10 eTool - Adrian Giles, UK

459 views • 15 slides
Provability of weak circuit lower bounds J an Pich Kurt G odel Research Center University

Provability of weak circuit lower bounds J an Pich Kurt G odel Research Center University

Proof complexity, Dagstuhl 1st February 2018 Provability of weak circuit lower bounds J an Pich Kurt G odel Research Center University of Vienna based on a joint work with Moritz M uller 1 / 11 Constructive proofs of circuit lower

674 views • 40 slides
Chunling Wang , Dandan Wang, Yunpeng Chai, Chuanwen Wang and Diansen Sun Renmin University of

Chunling Wang , Dandan Wang, Yunpeng Chai, Chuanwen Wang and Diansen Sun Renmin University of

Chunling Wang , Dandan Wang, Yunpeng Chai, Chuanwen Wang and Diansen Sun Renmin University of China Data volume is growing 44ZB in 2020! How to store? Flash arrays, DRAM-based storage : high costs, reliability, or limited capacity

402 views • 28 slides
More Undecidability 14-0 Computation Histories Sometimes it is useful to

More Undecidability 14-0 Computation Histories Sometimes it is useful to

Griffith University 3130CIT Theory of Computation (Based on slides by Harald Sndergaard of The University of Melbourne) More Undecidability 14-0 Computation Histories Sometimes it is useful to consider the

455 views • 18 slides
TARDiS: A branch and merge approach to weak consistency By: Natacha Crooks, Youer Pu, Nancy

TARDiS: A branch and merge approach to weak consistency By: Natacha Crooks, Youer Pu, Nancy

TARDiS: A branch and merge approach to weak consistency By: Natacha Crooks, Youer Pu, Nancy Estrada, Trinabh Gupta, Lorenzo Alvis, Allen Clement Presented by: Samodya Abeysiriwardane TARDiS Transactional key-value store for weakly consistent

662 views • 39 slides
CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal

CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal

CSE101: Algorithm Design and Analysis Russell Impagliazzo Sanjoy Dasgupta Ragesh Jaiswal (Thanks for slides: Miles Jones) Lecture 24: Divide and Conquer (Tree and Computational Geometry) Divide and Conquer Trees Lets say we have a full

846 views • 28 slides
On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6 1 2 min? 3 6 4 5 7 LCA? Parallel Computing Day Ben-Gurion University Tuesday, October 20, 2009 RMQ 2 0 4 3 5 1 7 6 Tuesday,

1.37k views • 108 slides
Approximate Nearest Neighbor via Point- Location among Balls Outline Problem and Motivation

Approximate Nearest Neighbor via Point- Location among Balls Outline Problem and Motivation

Approximate Nearest Neighbor via Point- Location among Balls Outline Problem and Motivation Related Work Background Techniques Method of Har-Peled (in notes) Problem P is a set of points in a metric space. P Build a

527 views • 36 slides

More recommend