Preview

Angel Nikolov BSC IT Programming in Jav

Better Essays
Open Document
Open Document
2965 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Angel Nikolov BSC IT Programming in Jav
Assignment Front Cover Sheet

PART 1 – To be completed by the student
Student Name
Angel Nikolov

Student ID Number
LON29101212

Module Name
(e.g.: Business Environment)

Data Structures and Algorithms

Course (e.g. HND Business )

BSC in IT

Assignment Title

Implementing Data Structures and Algorithms

Module Lecturer

Rafiqul Islam

Number of Words

2966

Assignment Due Date

06/05/2014

Submission Date

05/05/2014

First submission


Resubmission (as per lecturer’s instruction)


PART 2 – Student declaration

By submitting this work to LSBM, I confirm that I have read and understood the Dishonesty and Plagiarism Policy that is applicable to all assessments and assignments submitted by me.

I also confirm further that the work submitted here is my own work, save for where indicated by proper referencing. Should I not abide by the policy and be found guilty of plagiarism by my course lecturer or any other LSBM or appointed staff member I shall be bound by the decision of that lecturer and/or staff member as well as the terms of the Dishonesty and Plagiarism Policy.

Contents
Introduction 1
Task 1 1
Task 2Heap sort 8
Task 3 String operations 10
Conclusion 12
Bibliography 12

Introduction

The good knowledge of data structures is absolute must for anyone involved in computer science. The data structures are part of any software system nowadays. This report highlights three important aspects of the data structure algorithms. Sorting is the way of arranging the data elements in a way suitable for posterior handling. The searching is a process repeated thousands of times per hour and its optimizing by suitable algorithm can reduce the process times many times. And finally the metrics necessary for judging speed of other factors to compare algorithms. Different algorithms will be compared through their output in three cases, worst case, average case and best cases. In task three will be given overview of Java features for manipulating



Bibliography: Cay S. Horstmann, G. C., 2013. Core Java Volume I - Fundamentals. 9th ed. Boston: Prentice Hall Inc.. Drozdek, A., 2010. Data Structures and algorithms. 2nd ed. Boston: Course Technology. Keil, D. M., 2014. Data Structures. [Online] Available at: http://www.framingham.edu/~dkeil/ds-matls.htm McQuain, 2006. Data structure and OO Development I. [Online] Available at: http://courses.cs.vt.edu/cs2604/SummerI_2006/ Morin, P., 2011. Open data structures (in Java). 2nd ed. Chicago: Apress. Reid-Miller, D. M., 2010. Introduction to data structures Fall 2010. [Online] Available at: http://www.cs.cmu.edu/~mrmiller/15-121/

You May Also Find These Documents Helpful

  • Good Essays

    ECET 370 Week 5 Lab 5

    • 650 Words
    • 3 Pages

    Exercise 1: Review of the Lecture Content Create a project using the ArrayList class and the Main class provided in DocSharing. The ArrayList class contains implementations of the first three search methods explained in this week's lecture: sequential, sorted, and binary search. The Main class uses these three methods. These programs test the code discussed in the lecture. Compile the project, run it, and review the code that is given carefully.…

    • 650 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Pt1420 Unit 1 Assignment 2

    • 1305 Words
    • 6 Pages

    Hosch, L., Liesandthem, G., Luebring, J.E., Pallardy, R., Young, G. (2014). Java. In Encyclopedia Britannica.…

    • 1305 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Searching and Sorting Streams and Files Graphics GUI Components and Events Mouse, Keyboard, Sounds, and Images Big-O Analysis of Algorithms The Java Collections Framework Lists and Iterators Stacks and Queues Recursion Revisited Binary Trees Lookup Tables and Hashing Heaps and Priority Queues Design Patterns…

    • 3908 Words
    • 16 Pages
    Powerful Essays
  • Good Essays

    Student declaration: In accordance with the Flinders University information on academic integrity and plagiarism, referred to in the Student related policies and procedures manual (http://www.flinders.edu.au/ppmanual/student.html),…

    • 2006 Words
    • 9 Pages
    Good Essays
  • Powerful Essays

    I declare that all material in this assessment is my own work except where there is clear acknowledgement or reference to the work of others and I have complied and agreed to the University statement on Plagiarism and Academic Integrity on the University website at www.utas.edu.au/plagiarism *…

    • 1906 Words
    • 6 Pages
    Powerful Essays
  • Good Essays

    Transcultural Nursing Paper

    • 2588 Words
    • 11 Pages

    I have read and understand the plagiarism policy as outlined in the University Bulletin and this module as it relates to the IWU Honesty/Cheating Policy. By affixing this statement, I certify that I have not cheated or plagiarized in the process of completing this assignment. If it is found that cheating and/or plagiarism have taken place, I understand that the consequences of this action may include expulsion from Indiana Wesleyan University.…

    • 2588 Words
    • 11 Pages
    Good Essays
  • Powerful Essays

    Obsticle Courses

    • 6417 Words
    • 26 Pages

    I certify that the attached material is my original work. No other person’s work or ideas have been used without acknowledgement. Except where I have clearly stated that I have used some of this material elsewhere, I have not presented this for assessment in another course or unit at this or any other institution. I have retained a copy of this assignment. I have read and understand the Curtin University of Technology document Academic Integrity at Curtin: Student guidelines for avoiding plagiarism.…

    • 6417 Words
    • 26 Pages
    Powerful Essays
  • Powerful Essays

    Health and Social Care

    • 2042 Words
    • 9 Pages

    I declare that this is my own work. I understand that assignment malpractice such as plagiarism (copying), colluding or other forms of cheating will incur a heavy penalty in line with College and other policies. I have properly acknowledged the books, texts or other material quoted or used in this assignment. I am aware of the college appeals policy and assessment policy in the Student Handbook.…

    • 2042 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    References: Sipser.2006.Introduction to the Theory of computation.Second Edition. Albacea.CMSC A. Discrete Structures in Computer Science.University of the Philippines Open University.…

    • 731 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    * Alfred V, Aho J, Horroroft, Jeffrey DU (2002). Data Structures and Algorithms (India: Pearson Education Asia).…

    • 2162 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from 16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored. Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they solve have become larger and more complex, thus requiring development of more intricate programs to solve the problems. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the…

    • 72871 Words
    • 292 Pages
    Satisfactory Essays
  • Powerful Essays

    There are four required steps/procedures to be taken before the “tree” can work as an efficient representation of a certain data structure:…

    • 2024 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    Data Structure Reviewer

    • 5336 Words
    • 22 Pages

    In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications and some are highly specialized to certain tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Data structures are used in almost every program or software system. Specific data structures are essential ingredients of many efficient algorithms and make possible the management of huge amounts of data, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.…

    • 5336 Words
    • 22 Pages
    Powerful Essays
  • Powerful Essays

    I understand what plagiarism entails and am aware of the University’s policy in this regard. I declare that this assignment, including the essay questions hereafter is my own original work. Where someone else’s work is used, due acknowledgement is given and references are made according to the University’s requirements. I have not made use of another student’s work and submitted it as my own, nor have I allowed anyone to copy my work with the intention of presenting it as his or her work.…

    • 1552 Words
    • 6 Pages
    Powerful Essays
  • Good Essays

    computer science record

    • 6312 Words
    • 26 Pages

    M.A.M. SCHOOL OF ENGINEERING, SIRUGANUR, TIRUCHIRAPPALLI – 621 105. M.A.M. SCHOOL OF ENGINEERING, SIRUGANUR, TIRUCHIRAPPALLI – 621 105. Department of Computer Science and Engineering Department of Computer Science and Engineering LABORATORY MANUAL – CS 2208 – DATA STRUCTURES LABORATORY LABORATORY MANUAL – CS 2208 – DATA STRUCTURES LABORATORY EX: NO: 1 (a) SINGLY LINKED LIST AIM: Step 3:Stop PROGRAM : To write a Program to implement a single linked list ALGORITHM: Step 1:…

    • 6312 Words
    • 26 Pages
    Good Essays