CIS 216 Post University Indexed Files Programming Research Paper

User Generated

yhoh1

Programming

CIS 216

Post University

CIS

Description

Please see attached PDF for further instructions................................

Unformatted Attachment Preview

CIS216 – Programming Principles Indexed Files Due Date: 11:59 p.m. EST, Sunday of Unit 5 Points: 100 Overview: In this assignment, you will be analyzing sorting data, insertion sort algorithm, multidimensional arrays, and indexed files. Instructions: Part I. Research: 1. Insertion sort, which is one of the other sorting techniques introduced in this chapter. Create an algorithm to implement an insertion sort. 2. Methods for sorting data files. You should produce a brief report discussing the different sorting options that can be used. Part II. 1. Discuss the issues involved in sorting large data files. Explain how indexing is used to overcome this issue. 2. Explain the difference between physical order and logical order. Requirements: • • • • • • Show your work in a Word document. o Include all your work for each question. o You can include screenshots of work done on paper. For all justification exercises, remember to use the definitions and principles that we have learned thus far. You must prepare a written work where you respond to the programming exercises. The work must comply with APA academic writing standards. You must support your answer using appropriate sources that are properly cited. Minimum four pages in length, excluding the Title and Reference page. APA format, including an in-text citation for referenced works. At least three resources. Be sure to read the criteria by which your work will be evaluated before you write and again after you write. Evaluation Rubric for Indexed Files Assignment CRITERIA Part I Part II Resources Paper Length Clear and Professional Writing and APA Format Deficient (0-23 Points) Does not cover the assigned topic; assertions are not supported by evidence; paper is seriously lacking in content and detail. (0-17 Points) Does not cover the assigned topic; assertions are not supported by evidence; paper is seriously lacking in content and detail. (0-5 points) Less than 2 resources or no resources included. Less than one page. Does not meet page requirements. Errors impede professional presentation; guidelines not followed. Needs Improvement (24-31 Points) Does not do an adequate job of covering the assigned topic; assertions are weakly supported by evidence. Proficient Exemplary (32-39 Points) Sufficient coverage of the topics; most assertions are supported by evidence. (40 Points) Provides in-depth coverage of the topics, assertions are clearly supported by evidence. (18-23 Points) Does not do an adequate job of covering the assigned topic; assertions are weakly supported by evidence. (24-29 Points) Sufficient coverage of the topics; most assertions are supported by evidence. (30 Points) Provides in-depth coverage of the topics, assertions are clearly supported by evidence. (6-7 points) Includes at least 2 resources. (8-9 points) Includes at least 3 resources. (10 points) Includes more than 3 resources. Does not meet the Meets the minimum page minimum requirements. requirements. Exceeds the minimum requirements. Significant errors that do not impede professional presentation. Writing and format are clear, professional, APA compliant, and error free. Few errors that do not impede professional presentation. 1 The Main Title of Your Essay: The Subtitle of Your Essay (Subtitle is optional) First Name Last Name Department Name, Post University Course Number: Course Name Instructor’s Name Due Date for Assignment 2 The Main Title of Your Essay: The Subtitle of Your Essay The introduction of the essay should begin here. 3 References Author Last Name, First Initial. (year of publication). Title of the article. Name of the periodical, volume (issue), page range start-page range end. DOI web address
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Hey dude, check out the work , I 😊 would love to assist you anytime😇

Indexed Files
First Name Last Name
Department Name, Post University
Course Number: Course Name
Instructor’s Name
Due Date for Assignment

Part I
Research
1. Insertion sort, which is one of the other sorting techniques introduced in this
chapter. Create an algorithm to implement an insertion sort.
Insertion sort is based on the phenomenon, that one item of the array is processed in each
iteration to find its correct position in the array __ The certain position where this item
belongs to, in a sorted array. In insertion sort we iterate the array elements by growing the
sorted array in each iteration. Then we compare the current item with the largest value in the
sorted array. If the current item turns out to be greater, then it leaves the item in its current
place and moves towards next item otherwise it finds its position in the sorted array that must
be correct and replace it with that position. This all happens when we shift each and every
element which is larger than the current element, in the sorted array to one position ahead.
(Insertion sort)
Insertion sort is an efficient algorithm for smaller data sets but not the larger ones. (Insertion
Sort Algorithm). The benefit of Insertion Sort algorithm is that it reduces its total number of
steps if a partially sorted array is provided. Moreover, it does not change the relative order of
items if they are equal.
ArrayToBeSorted = [5, 1, 4, 3, 8]
n = len(DataayToBeSorted)
for i = 1 to n-1
current = ArrayToBeSorted [i];
j = i-1;
while ((j > -1) && (current < ArrayToBeSorted [j]))
ArrayToBeSorted [j+1] = ArrayToBeSorted [j];
j--;
End while
ArrayToBeSorted [j+1] = current;
End for
Print ArrayToBeSorted

2. Methods for sorting data files. You should produce a brief report discussing the
different sorting options that can be used.
We can divide the concept of sorting into two parts while working with files. Sometimes we
just need to work with file names for which only the name of a file matters in whole process,
secondly, it can be the data presented inside file that we have to process. While performing
sorting operations wit...


Anonymous
Excellent resource! Really helped me get the gist of things.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags