Data Structure

Introduction:

A data structure is a specific way to store and organize data in a computer’s memory so that these data can be used efficiently later. Data may be arranged in many different ways such as the logical or mathematical model for a particular organization of data is termed as a data structure. The variety of a particular data model depends on the two factors – Firstly, it must be loaded enough in structure to reflect the actual relationships of the data with the real world object. Secondly, the formation should be simple enough so that anyone can efficiently process the data each time it is necessary. Different kinds of data structures are suited to different kinds of applications. For example, relational databases commonly use B-tree indexes for data retrieval while compiler implementations usually use hash tables to look up identifiers. Usually, efficient data structures are key to designing efficient algorithms. Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer—a bit string, representing a memory address, that can be itself stored in memory and manipulated by the program.

Course Objectives:

This program aims at bringing the learners together to share their knowledge for achieving focused development and advancement in data structure. You should end it appreciating that, understanding the algorithm and data structures used for some real life problems is very much important before actually designing it. The topics covered will be similar to those found in introductory data structures courses viz, sorting and searching algorithms, linked list and tree data structures, graphs, stacks and queues. As well as knowing about them, all should be familiar enough with the concepts to take any of them further and make use of them.

Who Should Attend?

This program is meant for students and associates of CBSE / ICSE – recognized institutions. Fundamental awareness of computers and basic knowledge of programming will help to understand the concepts easily.

Prerequisites

* A basic understanding of Windows and any web browser will be beneficial.

* A student does not need any previous experience of HTML, web page construction or any other programming.

Contents

• Fundamental concepts of Data Structure

• Basic Searching and Sorting techniques: o Linear and Binary search o Radix, Address Calculation, Radix Exchange and Shell sort techniques

• Linked Lists:
-Operations on Single, Double and Circular lists.
-Applications in Symbol table creation

• Applications of Stack and Queues:
-Job Scheduling

• Trees and Forests:
-Traversal, BST

• Graph implementations and Representation

Program Schedule:

Event Name

Time

Registration 09:00AM- 10:00AM
Training and Hands on 10:00AM-12:30PM
Lunch 12:30PM-01:30PM
Test 01:30PM-02:30PM
Result Declaration & Felicitation 03:00PM-03:20PM

Contact Us

Silicon Institute of technology, Bhubaneswar

Address: Silicon Hills, Patia, Near Infocity, Bhubaneswar
Telephone: 082603 33609
State:Odisha 751024
E-mail: