Data Structures Notes CS-1 Class 12th
Q.1) Define the following : a) Traversing :- Traversing means accessing each record (elements) only once so that it can be processed. b) Searching :- Searching means finding the location of record (element) with given key value or finding all records that satisfies condition. c) Inserting :- Inserting means adding new record (element) to the structure. d) Deleting :- Deleting means removing the record (element) from the structure. e) Sorting :- Sorting means annoying records (elements) in some logical order. For example : (i) Arranging names in aplhabitical order. (ii) Arranging numbers in ascending order. f) Merging :- Merging means combining the records in two different files into a single file. How to Gain Free traffic from Guest Posting. Q.2) What is an algorithm ? Ans: (i) A algorithm, is a finite step-by-step list of well defined instructions for solving a particular problem. (ii) It lists for variable and input data. (iii) It is used as specification for perfo...