tracing while loops

Tracing While Loops 7 January 2019 OSU CSE 1 Consider... int i = - PowerPoint PPT Presentation

Jan 10, 2024 •162 likes •367 views

Tracing While Loops 7 January 2019 OSU CSE 1 Consider... int i = 4, j = 1, n = 0; while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; } 7 January 2019 OSU CSE 2 Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while

  1. Tracing While Loops 7 January 2019 OSU CSE 1

  2. Consider... int i = 4, j = 1, n = 0; while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; } 7 January 2019 OSU CSE 2

  3. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; } 7 January 2019 OSU CSE 3

  4. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i--; } else { j++; } n++; } 7 January 2019 OSU CSE 4

  5. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; } else { j++; } n++; } 7 January 2019 OSU CSE 5

  6. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { j++; } n++; } 7 January 2019 OSU CSE 6

  7. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; } 7 January 2019 OSU CSE 7

  8. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 } 7 January 2019 OSU CSE 8

  9. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 } 7 January 2019 OSU CSE 9

  10. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 } 7 January 2019 OSU CSE 10

  11. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 } 7 January 2019 OSU CSE 11

  12. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 j = 1 n = 1 } 7 January 2019 OSU CSE 12

  13. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 } 7 January 2019 OSU CSE 13

  14. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 } 7 January 2019 OSU CSE 14

  15. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 } 7 January 2019 OSU CSE 15

  16. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 } 7 January 2019 OSU CSE 16

  17. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 j = 1 2 n = 1 2 } 7 January 2019 OSU CSE 17

  18. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 2 j = 1 2 2 n = 1 2 3 } 7 January 2019 OSU CSE 18

  19. Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 2 j = 1 2 2 n = 1 2 3 } i = 2 j = 2 n = 3 7 January 2019 OSU CSE 19

  20. What Does It Do? • Describe in one short sentence what the snippet of code we just traced does. • Don’t repeat the code in English… 7 January 2019 OSU CSE 20

Recommend

LOOPS Loops Loops Loops! How can we repeat a piece of code without having to write it out over

LOOPS Loops Loops Loops! How can we repeat a piece of code without having to write it out over

Session 6 LOOPS Loops Loops Loops! How can we repeat a piece of code without having to write it out over and over?! With loops! The Game Loop For Loop vs. While Loop For Loops While Loops Start/End are Known Start/End not Always Clear

301 views • 26 slides
Loops! Flow of Control: Loops (Savitch, Chapter 4) TOPICS while Loops do while

Loops! Flow of Control: Loops (Savitch, Chapter 4) TOPICS while Loops do while

Loops! Flow of Control: Loops (Savitch, Chapter 4) TOPICS while Loops do while Loops for Loops break Statement continue Statement CS 160, Fall Semester 2012 2 An Example While Loop

446 views • 11 slides
While Loops Python While Loops Form of the while loop: while condition : Statement Block

While Loops Python While Loops Form of the while loop: while condition : Statement Block

While Loops Python While Loops Form of the while loop: while condition : Statement Block Indent Keyword is while Condition needs to evaluate to either True or False Condition is a boolean While Loop Conditions Statement

498 views • 11 slides
Tutorial 3 Loops Side Effects 1 CS 136 Spring 2020 Tutorial 3 Loops: for loops &

Tutorial 3 Loops Side Effects 1 CS 136 Spring 2020 Tutorial 3 Loops: for loops &

Tutorial 3 Loops Side Effects 1 CS 136 Spring 2020 Tutorial 3 Loops: for loops & while loops Using a loop to solve a problem is called iteration . while is similar to if statements but while repeatedly loops back and

457 views • 8 slides
while Loops Introducing: while Loops General form of a while loop statement: while [boolean

while Loops Introducing: while Loops General form of a while loop statement: while [boolean

while Loops Introducing: while Loops General form of a while loop statement: while [boolean expression "test"]: <repeat block statements run when test is true> Like an if-then statement: The test must be a boolean

208 views • 7 slides
Advanced Ray Tracing 1 2/8/2006 Distributed Ray Tracing Distributed ray tracing is an

Advanced Ray Tracing 1 2/8/2006 Distributed Ray Tracing Distributed ray tracing is an

Advanced Ray Tracing 1 2/8/2006 Distributed Ray Tracing Distributed ray tracing is an elegant technique that tackles many problems at once Stochastic ray tracing: distribute rays stochastically across pixel Distributed ray tracing:

329 views • 8 slides
Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 5.2 1 2 A deceptive problem... Write a method printLetters that prints each letter from a word separated by commas. For

545 views • 20 slides
Building Java Programs Chapter 5 Lecture 10: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 10: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 10: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 5.2 1 String methods Method name Description indexOf( str ) index where the start of the given string appears in this string (-1 if

756 views • 41 slides
Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 5.2 1 2 A deceptive problem... Write a method printLetters that prints each letter from a word separated by commas. For

517 views • 22 slides
Building Java Programs Chapter 5 Lecture 11: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 11: while Loops, Fencepost Loops, and Sentinel Loops

Building Java Programs Chapter 5 Lecture 11: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 5.2 (Slides adapted from Stuart Reges, Hlne Martin, and Marty Stepp) 1 2 Methods using charAt Write a method

795 views • 20 slides
Computer Graphics - Ray-Tracing II - Hendrik Lensch Computer Graphics WS07/08 Ray Tracing II

Computer Graphics - Ray-Tracing II - Hendrik Lensch Computer Graphics WS07/08 Ray Tracing II

Computer Graphics - Ray-Tracing II - Hendrik Lensch Computer Graphics WS07/08 Ray Tracing II Overview Last lecture Ray tracing I Basic ray tracing What is possible? Recursive ray tracing algorithm Intersection

874 views • 84 slides
1 minute Path tracing Bidirectional path tracing Progressive photon mapping 1 minute

1 minute Path tracing Bidirectional path tracing Progressive photon mapping 1 minute

Path tracing Bidirectional path tracing Progressive photon mapping 1 minute Path tracing Bidirectional path tracing Progressive photon mapping 1 minute Bidirectional path tracing Relative efficiency Result Progressive photon mapping

689 views • 41 slides
MIT 6.837 - Ray Tracing Ray Tracing MIT EECS 6.837 Most slides are taken from Frdo Durand and

MIT 6.837 - Ray Tracing Ray Tracing MIT EECS 6.837 Most slides are taken from Frdo Durand and

MIT 6.837 - Ray Tracing Ray Tracing MIT EECS 6.837 Most slides are taken from Frdo Durand and Barb Cutler Some slides courtesy of Leonard McMillan 1 2 Ray Tracing Ray Tracing Ray Tracing kills two birds with one stone: Solves the

328 views • 11 slides
Advanced Ray Tracing Stochastic ray tracing: distribute rays stochastically across pixel

Advanced Ray Tracing Stochastic ray tracing: distribute rays stochastically across pixel

Distributed Ray Tracing Distributed ray tracing is an elegant technique that tackles many problems at once Advanced Ray Tracing Stochastic ray tracing: distribute rays stochastically across pixel Distributed ray tracing: distribute

263 views • 3 slides
61A Extra Lecture 9 Announcements Pixels (Demo) Ray Tracing Ray Tracing A technique for

61A Extra Lecture 9 Announcements Pixels (Demo) Ray Tracing Ray Tracing A technique for

61A Extra Lecture 9 Announcements Pixels (Demo) Ray Tracing Ray Tracing A technique for displaying a 3D scene on a 2D screen by tracing a path through every pixel 5 Ray Tracing A technique for displaying a 3D scene on a 2D screen by tracing

326 views • 32 slides
While Loops 15-110 Friday 09/18 Learning Goals Use while loops when reading and writing

While Loops 15-110 Friday 09/18 Learning Goals Use while loops when reading and writing

While Loops 15-110 Friday 09/18 Learning Goals Use while loops when reading and writing algorithms to repeat actions while a certain condition is met Identify start values, continuing conditions, and update actions for loop control

262 views • 25 slides
Module 2 2.1 Transportation Planning Process The transportation planning process has a lot of

Module 2 2.1 Transportation Planning Process The transportation planning process has a lot of

CE -751, SLD, Class Notes, Fall 2006, IIT Bombay Module 2 2.1 Transportation Planning Process The transportation planning process has a lot of similarity to the problem solving process. The following table gives the major differences between the

503 views • 8 slides
Lapin (an efficient authentication protocol based on Ring-LPN) Stefan Heyse, Eike Kiltz, Vadim

Lapin (an efficient authentication protocol based on Ring-LPN) Stefan Heyse, Eike Kiltz, Vadim

Lapin (an efficient authentication protocol based on Ring-LPN) Stefan Heyse, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, Krzysztof Pietrzak Authentication Protocols Prover Verifier HB-style authentication shared AES key K protocols

563 views • 22 slides
Shorter Linear Straight-Line Programs for MDS Matrices Yet another XOR Count Paper Thorsten Kranz

Shorter Linear Straight-Line Programs for MDS Matrices Yet another XOR Count Paper Thorsten Kranz

Motivation Previous Work Shorter Linear Straight-Line Programs Results Conclusion Shorter Linear Straight-Line Programs for MDS Matrices Yet another XOR Count Paper Thorsten Kranz 1 , Gregor Leander 1 , Ko Stoffelen 2 , Friedrich Wiemer 1 1

950 views • 69 slides
Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint

Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint

Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint work with Jen Pestana and Elle McDonald Jeju, Korea, 2015 p.1/24 Iterative methods For self-adjoint problems/symmetric matrices, iterative

672 views • 25 slides
Tracing and Profiling MySQL Mostly with Linux tools: from strace and gdb to ftrace, bpftrace,

Tracing and Profiling MySQL Mostly with Linux tools: from strace and gdb to ftrace, bpftrace,

Tracing and Profiling MySQL Mostly with Linux tools: from strace and gdb to ftrace, bpftrace, perf and dynamic probes Valerii Kravchuk, Principal Support Engineer, MariaDB vkravchuk@gmail.com 1 Who am I? Valerii (aka Valeriy ) Kravchuk :

549 views • 27 slides
Content-aware Trace Collection and I/O Deduplication for Smartphones Bo Mao 1 , Suzhen Wu 1 , Hong

Content-aware Trace Collection and I/O Deduplication for Smartphones Bo Mao 1 , Suzhen Wu 1 , Hong

Content-aware Trace Collection and I/O Deduplication for Smartphones Bo Mao 1 , Suzhen Wu 1 , Hong Jiang 2 , Xiao Chen 1 , Weijian Yang 1 {maobo, suzhen}@xmu.edu.cn, hong.jiang@uta.edu 1 Xiamen University (http://astl.xmu.edu.cn/) 2 University of

379 views • 19 slides
Selecting points of interest in traces using patterns of events Franois Trahay , Elisabeth

Selecting points of interest in traces using patterns of events Franois Trahay , Elisabeth

Selecting points of interest in traces using patterns of events Franois Trahay , Elisabeth Brunet, Mohamed Mosli Bouksiaa, Jianwei Liao Context Hardware is more and more complex NUMA, hierarchical caches, GPU, ... Software is more

640 views • 35 slides
ANALYSIS ETI2506 Sunday, 23 October 2016 1 WHERE ARE WE IN THE CURRICULUM? 2 GOAL OF TRAFFIC

ANALYSIS ETI2506 Sunday, 23 October 2016 1 WHERE ARE WE IN THE CURRICULUM? 2 GOAL OF TRAFFIC

IN INTRODUCTION TO TRAFFIC ANALYSIS ETI2506 Sunday, 23 October 2016 1 WHERE ARE WE IN THE CURRICULUM? 2 GOAL OF TRAFFIC ANALYSIS 1. Except for user terminals, the telephone network is composed of a variety of common 45 Trunks equipment

385 views • 17 slides

More recommend