×
SET SOME GOALS. STAY QUIET ABOUT THEM. SMASH THE HELL OUT OF THEM. CLAP FOR YOUR DAMN SELF.
--Your friends at LectureNotes

# Note for Data Structure using C - DS By Bput Toppers

• Data Structure using C - DS
• Note
• Biju Patnaik University of Technology BPUT - BPUT
• Master of Computer Applications
• 6 Topics
• 183 Views
• Uploaded 7 months ago
Bput Toppers
0 User(s)

#### Text from page-1

1 Syllabus MCA Sem-II, Paper - I Data Structures 1. Sorting and Searching Techniques Bubble, Selection, Insertion, Shell sorts and Sequential, Binary, Indexed Sequential Searches, Interpolation, Binary Search Tree Sort, Heap sort, Radix sort. Analysis of Algorithms Algorithms, Pseudo code for expressing algorithms, time complexity and space complexity, O-notation, Omega notation and theta notation. 2. Hashing Techniques        Hash function Address calculation techniques, Common hashing functions Collision resolution Linear probing, Quadratic Double hashing Bucket hashing Deletion and rehashing 3. Linear Lists       Stacks: LIFO structure, create, POP, PUSH, delete stack Queues: FIFO structure Priority Queues, Circular Queues, operations on Queues Linear List Concept List v/s Array, Internal pointer and External pointer, head, tail of a list, Null list, length of a list Linked Lists o Nodes, Linked List Data Structure Linked Lists algorithms o Create List o Insert Node (empty list, beginning, Middle, end) o Delete node (First, general case) o Search list o Retrieve Node, add node, Remove node, Print List