HW1A3902A17 - Lovely Professional University Department of...

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

View Full Document Right Arrow Icon
Lovely Professional University Department of CA HOMEWORK 1 Homework Title/No:1 Course Code: CAP553 Course Instructor: Sr. Lect. Jaswinder Singh Course Tutor: NA Date of Allotment:24-aug-10 Date of submission: 09-sepv-10 Student’s Roll Number:RA3902A17 Section No.:A3902 Declaration: I declare that this assignment is my individual work. I have not copied from any other student’s work or from any other source except where due acknowledgement is made explicitly in the text, nor has any part been written for me by another person. varunkumar Student’s Sign: Evaluator’s Comments: ___________________________________________________ Marks obtained: ____________ out of __________________
Background image of page 1

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

View Full Document Right Arrow Icon
Part-A 1. Why structuring of data is required .Take one example problem and discuss various problems that can be faced if wrong choice has been made in selecting data structure for the problem. Ans: Data structure is a way of storing data in a computer memory so that it can be used efficiently. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented using the data types, references and operations on them provided by a programming language. 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 routing tables rely on networks to function. In the design of many types of programs, the choice of data structures is a primary design consideration, as experience in building large systems has shown that the difficulty of implementation and the quality and performance of the final result depends heavily on choosing the best data structure. After the data structures are chosen, the algorithms to be used often become relatively obvious. Sometimes things work in the opposite direction – data structures are chosen because certain key tasks have algorithms that work best with particular data structures. In either case, the choice of appropriate data structures is crucial. This insight has given rise to many formalized design methods and programming languages in which data structures,
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 6

HW1A3902A17 - Lovely Professional University Department of...

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

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