Rs Salaria Data Structures code#

These will be the two measures of efficiency we will be working with.ġ3 Algorithm Vs Program What is the difference between an algorithm and a program?  a program is an implementation of an algorithm to be run on a specific computer and operating system. What is efficient? Efficient is something, which has small running time and takes less memory. Good algorithm is an efficient algorithm. (ii) in a programming language or (iii) in the form of a flowchart.ġ2 What is Good Algorithm? There are so many different algorithms for solving a certain problem.

An algorithm can be expressed in three ways:- (i) in any natural language such as English, called pseudo code. It can also be defined as sequence of computational steps that transform the input into the output. Data Structure ? A data structure is a particular way of organizing data in a computer so that it can be used efficiently.īasic operation – Traversing – Accessing and processing record exactly once Insertion – Adding new record to data structure Deletion – Removing particular record from the data structure Searching – Finding the location of the record in data structure Special operation – Sorting – Arranging the record in some specific order Merging – Combining the records from different data structures to single data structureġ1 ALGORITHM A well-defined computational procedure that takes some value, or a set of values, as input and produces some value, or a set of values, as output. One of the most crucial aspects to how quickly a problem can be solved is how the data is stored in memory. (Your algorithm (program) will be faster than others.)Įven though computers can perform literally millions of mathematical computations per second, when a problem gets large and complicated, performance can nonetheless be an important consideration. Dynamic memory allocation PointersĨ Why This Course? You will be able to evaluate the quality of a program (Analysis of Algorithms: Running time and memory space ) You will be able to write fast programs You will be able to solve new problems You will be able to give non-trivial methods to solve problems. Lab work & Lab record Mid sem lab – Viva/Test(P1) 20 End sem lab – Viva/Test(P2) 20 Attendance & discipline in lab 10 Totalīasic programming constructs from C programming like data types, operators, decision control, loops, string and functions etc. Mid Sem 2 hrs 30 End Sem 3 hrs 45 Tutorials 10 Attendance 05 Quiz & Assignments Total 100

Salaria, “Data structure and algorithms using C” Reference Books: Kruse, Tonso, Leung, “Data Structures and Program Design in C” Langsam, Augestein, Tanenbaum, “Data Structures using C and C++” Weiss, “Data Structures and Algorithm Analysis in C/C++” Carrano and Prichard, “Data Abstraction and Problem solving with C++” Corman at el, “Introduction to Algorithms”Ĥ Marks Distribution Component & Nature Duration Marks / Weightage

Seymour Lipschutz, “Data Structure”, Schaum’s Outlines, Tata McGraw Hill Sartaj Sahni, “Data Structures, Algorithms”, Tata Mc Graw Hill, New York Preiss, Bruno R., “Data Structures and Algorithms: With Object-Oriented Design Patterns in C++ “, John Wiley & Sons, New York R.S.

Rs Salaria Data Structures code#

1 DATA STRUCTURE Subject Code -14B11CI211Ģ Syllabus Introduction to Data Structures Algorithm and ComplexityĪrray Searching And Sorting Algorithms Stack Queue Linked List Graph and Tree