By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Slides:



Advertisements
Similar presentations
Chapter 5 Errors Bjarne Stroustrup
Advertisements

Wait-Free Linked-Lists Shahar Timnat, Anastasia Braginsky, Alex Kogan, Erez Petrank Technion, Israel Presented by Shahar Timnat 469-+
Copyright  Oracle Corporation, All rights reserved. 1 Creating an Application: The AppBuilder for Java IDE.
The Efficiency of Algorithms Chapter 4 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Why care about debugging? How many of you have written a program that worked perfectly the first time? No one (including me!) writes a program that works.
Coding. Steps to Success 1.Create a PLAN including a detailed statement of requirements (SORs) 2.Write algorithms based on the SORs 3.Write pseudocode.
David Streader Computer Science Victoria University of Wellington Copyright: David Streader, Victoria University of Wellington Recursion COMP T1.
Computer Science and Software Engineering© 2014 Project Lead The Way, Inc. How To Program.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Fluency with Information Technology Third Edition by Lawrence Snyder Chapter.
Search and Recursion pt. 2 CS221 – 2/25/09. How to Implement Binary Search Take a sorted data-set to search and a key to search for Start at the mid-point.
Reviewing the work of others Referee reports. Components of a referee report Summary of the paper Overall evaluation Comments about content Comments about.
General Computer Science for Engineers CISC 106 Lecture 21 Dr. John Cavazos Computer and Information Sciences 04/10/2009.
Chapter 24 (lecture 16) Click To Close: A Fluency Summary.
10 November JavaScript. Presentation Hints What do YOU think makes a good presentation Some of my suggestions Don’t write full sentences on slides Talk,
COS Sept 9, 2005 Key Issues in Programming Stefan Brandle.
Class 0: Review and Perspective. cis 335 Fall 2001 Barry Cohen Class info n Barry Cohen n n Office hours: W 3:15-4:40.
27-Jun-15 Profiling code, Timing Methods. Optimization Optimization is the process of making a program as fast (or as small) as possible Here’s what the.
30-Jun-15 Profiling. Optimization Optimization is the process of making a program as fast (or as small) as possible Here’s what the experts say about.
Open Source WGISS 39. Definition of Open Source Software (OSS)  Open source or open source software (OSS) is any computer software distributed under.
Principles of Procedural Programming
Oakkar Fall The Need for Decision Engine Automate business processes Implement complex business decision logic Separation of rules and process Business.
INTEL CONFIDENTIAL Parallel Decomposition Methods Introduction to Parallel Programming – Part 2.
Code as Communication Programming Studio Spring 2015.
The Pseudocode Programming Process Chapter 9. Summary of Steps in Building Classes and Routines.
JS Arrays, Functions, Events Week 5 INFM 603. Agenda Arrays Functions Event-Driven Programming.
©2003 Pearson Education, Inc., publishing as Longman Publishers. Study Skills Topic 13 Preparing & Taking Exams PowerPoint by JoAnn Yaworski.
Technology in Action Chapter 10 Behind the Scenes: Software Programming Copyright © 2014 Pearson Education, Inc. Publishing as Prentice Hall.
INTRODUCTION SOFTWARE HARDWARE DIFFERENCE BETWEEN THE S/W AND H/W.
Lokesh Puppala. Introduction  Git - Distributed version control system  Initiated by Linus Torvalds  Strongly influenced by Linux kernel development.
IDEs Department of Information Systems and Computer Science Ateneo de Manila University.
DEBUGGING. BUG A software bug is an error, flaw, failure, or fault in a computer program or system that causes it to produce an incorrect or unexpected.
Selection Control Structure. Topics Review sequence control structure Structure theorem Selection control structure If statement Relational operators.
© 2006 Pearson Education 1 More Operators  To round out our knowledge of Java operators, let's examine a few more  In particular, we will examine the.
1 Ch. 1: Software Development (Read) 5 Phases of Software Life Cycle: Problem Analysis and Specification Design Implementation (Coding) Testing, Execution.
Slide 1 Systems Analysis and Design with UML Version 2.0, Second Edition Alan Dennis, Barbara Wixom, and David Tegarden Chapter 6: Functional Modeling.
The concept of RAID in Databases By Junaid Ali Siddiqui.
Examination preparation. The Eightfold Path of tips to help you do well!  1. Take your time and pace yourself. The exam will give you enough time to.
Software Development Problem Analysis and Specification Design Implementation (Coding) Testing, Execution and Debugging Maintenance.
Lesson - 2. Introduction When we make a program we must follow some steps, called Programming Development Life Cycle (PDLC). Programming steps are five:
M1G Introduction to Programming 2 3. Creating Classes: Room and Item.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
CS12230 Introduction to Programming Lecture 6-2 –Errors and Exceptions 1.
Integrated Development Environments (IDEs) CS 21a: Introduction to Computing I Department of Information Systems and Computer Science Ateneo de Manila.
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
CS 177 Recitation Week 1 – Intro to Java. Questions?
OBJECTIVES 1. Be able to recognise binary code 2. Be able to convert denary numbers into binary numbers 3. Be able to convert binary into denary numbers.
By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)
Slide 1 Systems Analysis and Design with UML Version 2.0, Second Edition Alan Dennis, Barbara Wixom, and David Tegarden Chapter 6: Functional Modeling.
FFT Accelerator Project Rohit Prakash(2003CS10186) Anand Silodia(2003CS50210) Date : February 23,2007.
Chapter 2: The Visual Studio.NET Development Environment Visual Basic.NET Programming: From Problem Analysis to Program Design.
Chapter 2: System Structures
Raw Materials and Resources
Microsoft Connect /22/2019 9:54 PM
Lecture 7 Algorithm Design & Implementation. All problems can be solved by employing any one of the following building blocks or their combinations 1.
Lesson 1 - Visualizing Dependencies
File Management System Simulation
Click To Close: A Fluency Summary
Troubleshooting Compiler Errors
Review of Previous Lesson
Kernel Debugging with VMplayer and Windbg
Hello World Program In Visual Studio and Debugging
Design Document Review
Presentation transcript:

By Anand George SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Linked list Sorting  No moving of data like in the array.  But just exchange the links when needed. 1 link NULL 1 link NULL After Sorting Before Sorting SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Demo  Linked list sorting. SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Complications? How to deal?  Try to get a reasonable understanding of the algorithm or the “logic”.  Give your best effort to implement the logic by yourself even though you are sure you may not be able to do it.  Debug, Debug and Debug. Make sure your stepping and breakpoint goes into all the if else cases in multiple iterations.  Now look at working implementation.  Debug and modify the working implementation.  If you don’t understand a line comment out that line and see what difference it makes in the working implementation.  See if you can make your implementation work?  Don’t Try to understand the working implementation without having a proper understanding of the logic. Try to understand the working implementation without a sincere attempt from your side. Try to look at code of the working implementation and try to understand the follow without debugging. Remember you are not a computer you have to “think” and act like a CPU to understand the flow without the help of a debugger. SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

If you need more than 3 levels of indentation, you're screwed anyway, and should fix your program. Linus Torvalds. Linux kernel coding style document -  Unfortunately all the code your manager will ask you to understand and/or enhance/fix is not written by Linus or Linux Kernel.  You need to get familiarize with all kind of complications and complexities when it comes to code written by others. SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Summary  Linked List Sorting  How to deal with complicated logic in the code effectively. SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)

Thank you SourceLens.org Copyright. All rights reserved. Content Owner - Meera R (meera at sourcelens.org)