alogirhms_intro

alogirhms_intro - Biocomputing Algorithms Introduction...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Biocomputing Algorithms Introduction Armin R. Mikler, Qunfeng Dong Department of Computer Science and Engineering University of North Texas [email protected] [email protected] CSCE/BIOL 4810/5810 Spring 2011 Definitions Algorithm a step-by-step procedure to perform a task Real world: Balancing a checkbook CS: Adding a list of numbers Data Structure a systematic way of organizing and accessing data Real world: Filing cabinet CS: Hierarchical file system A.R.Mikler, Q. Dong (UNT) Biocomputing CSCE/BIOL 4810/5810 2 / 19 Why Study Data Structures? Algorithms and data structures are usually developed hand-in-hand Example: Pushing and popping from a stack The behavior of an algorithm depends on how the data is structured Example: Searching a disc vs. searching a tape Tape: fast-forward, rewind Disc: select a track vs A.R.Mikler, Q. Dong (UNT) Biocomputing CSCE/BIOL 4810/5810 3 / 19 Design Goals Correctness Should correctly solve the task it is designed for For all possible inputs! Always depends on the specific task Efficiency Should not use any more of the computer’s resources than necessary Processing time Memory A.R.Mikler, Q. Dong (UNT) Biocomputing CSCE/BIOL 4810/5810 4 / 19 Pseudo-Code Combine high-level descriptions with familiar programming language structures Written for humans, not computers Algorithm addFromOneToN(n) Input : An integer n Output : The sum of all integers from 1 to n sum 0 for i ← 1 to n do sum ← sum + i return sum A.R.Mikler, Q. Dong (UNT) Biocomputing CSCE/BIOL 4810/5810 5 / 19 Declarative vs Imperative Declarative √ x = y y 2 = x but how?...
View Full Document

This note was uploaded on 04/15/2011 for the course BIOL 4520 taught by Professor Staff during the Spring '10 term at North Texas.

Page1 / 24

alogirhms_intro - Biocomputing Algorithms Introduction...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online