tracing while loops
play

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

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

AfterOMPT: An OMPT-based tool for fine-grained tracing of tasks and loops Igor Wodiany, Andi

AfterOMPT: An OMPT-based tool for fine-grained tracing of tasks and loops Igor Wodiany, Andi

AfterOMPT: An OMPT-based tool for fine-grained tracing of tasks and loops Igor Wodiany, Andi Drebes, Richard Neill, Antoniu Pop International Workshop on OpenMP 2020 Introduction Need for precise profiling to identify performance anomalies

868 views • 31 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:

327 views • 8 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

327 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
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
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
I is for Turtle, Bagels, Loop Tracing, Files Part 1 of 4 Identity Who are you?

I is for Turtle, Bagels, Loop Tracing, Files Part 1 of 4 Identity Who are you?

Compsci 101 I is for Turtle, Bagels, Loop Tracing, Files Part 1 of 4 Identity Who are you? Computer Science Student Susan Rodger Invariant September 15, 2020 Reasoning formally and informally about loops Internet

289 views • 10 slides
Ray Tracing 1 Ray Tracing Ray Tracing kills two birds with one stone: Solves the Hidden

Ray Tracing 1 Ray Tracing Ray Tracing kills two birds with one stone: Solves the Hidden

Ray Tracing 1 Ray Tracing Ray Tracing kills two birds with one stone: Solves the Hidden Surface Removal problem Evaluates an improved global illumination model shadows ideal specular reflections ideal specular refractions

586 views • 19 slides
Introduction to Path Tracing Marc Sunet Table of contents From Ray Tracing to Path Tracing The

Introduction to Path Tracing Marc Sunet Table of contents From Ray Tracing to Path Tracing The

Introduction to Path Tracing Marc Sunet Table of contents From Ray Tracing to Path Tracing The Rendering Equation Monte Carlo Integration A Basic Path Tracer Variance Reduction and Optimisation Techniques Additional Resources Plan From Ray

1.08k views • 54 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
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

516 views • 22 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
ARM Assembler Structure / Loops Structure / Loops p. 1/12 Loops Four parts to any loop

ARM Assembler Structure / Loops Structure / Loops p. 1/12 Loops Four parts to any loop

Systems Architecture ARM Assembler Structure / Loops Structure / Loops p. 1/12 Loops Four parts to any loop initialisation init i) body body ii) increment or inc iii) decrement dec exit condition

1k views • 61 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

873 views • 84 slides
Ray-tracing Acceleration Motivation Distribution Ray Tracing Soft shadows

Ray-tracing Acceleration Motivation Distribution Ray Tracing Soft shadows

Ray-tracing Acceleration Motivation Distribution Ray Tracing Soft shadows Acceleration Data Structures Antialiasing (getting rid of jaggies) for Ray Tracing Glossy reflection Motion blur Depth of field (focus)

940 views • 10 slides
Welcome 1 Ray tracing part I of the course 2 Ray tracing part I of the course Why

Welcome 1 Ray tracing part I of the course 2 Ray tracing part I of the course Why

Graphics (INFOGR), 2018-19, Block IV, lecture 1 Deb Panja Today: Vectors and vector algebra Welcome 1 Ray tracing part I of the course 2 Ray tracing part I of the course Why vectors? you need to shoot a lot of such rays!

594 views • 47 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