(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

This is the chapter of Data structure. Data structure is something which is very much important according to gate . This chapter covers first 10 lesson about Hashing and then another 6 lesson about Arrays. We will cover the theoritical parts of hashing , its types and see with the example and previous year gate question. Same with the Array.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Hashing and Arrays: GATE

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This is the course overview . In this we have seen the importance of studying data structure for Gate Exam. Afterwards, we will cover Two data structure Hashing and array where we will cover the introduction, theoritical mcq question , types , and numerical solution that is being asked in gate exam.

Course Overview

Hashing is a data structur whose worst case conplexity is O(1). We will cover the introduction , types , algorithm , theoritical mcq ques and numerical ques.

Hashing : Introduction

Hashing is a data structure whose worst case conplexity is O(1). It is being of four types and all are asked in gate exan. Its important. We will cover the introduction , types , algorithm , theoritical mcq ques and numerical ques.

Types of Hash Function : Part I

Hashing is a data structur whose worst case conplexity is O(1). Remaining 2 types are disscused in this slide . We will cover the introduction , types , algorithm , theoritical mcq ques and numerical ques.

Types of Hash Function Part 2

The method for resolving collisions looks into the hash table and tries to find another open slot to hold the item that caused the collision. We will cover the introduction, types and numerical case.

Collision Resolution Technique

Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key. We will see the inroduction, types, numaerical etc

Linear Probing ( Types of Open Addressing )

Quadratic probing is an open addressing scheme in computer programming for resolving collisions in hash tables—when an incoming data's hash value indicates it should be stored in an already-occupied slot or bucket. Quadratic probing operates by taking the original hash index and adding successive values of an arbitrary. We will cover the introduction and types , algorithm

Quadratic Hashing

Clustering is the tendency for a collision resolution scheme such as linear probing to create long runs of filled slots near the hash position of keys. ... Once the primary cluster forms, the bigger the cluster gets, the faster it grows. And it reduces the performance. It is of two types : primary and secondary clustering. We will see in details regarding types, introduction and examples.

Clustering

Double hashing is a computer programming technique used in hash tables to resolve hash collisions, in cases when two different values to be searched for produce the same hash key. It is a popular collision-resolution technique in open-addressed hash tables. We will cover the introduction , algorithms as well as previous year question with solutions.

Double Hashing

We will cover the previous year question related to GATE . All time hashing question is being discussed.

Previous Years Gate Question ( Hashing )

An array is a data structure that contains a group of elements. Typically these elements are all of the same data type, such as an integer or string. Arrays are commonly used in computer programs to organize data so that a related set of values can be easily sorted or searched.

Array : Introduction

Conceptually you can think of a one-dimensional array as a row, where elements are stored one after another. 

datatype: It denotes the type of the elements in the array.

array_name: it is the name given to an array. It must be any valid identifier.

size: It is the number of elements an array can hold.

1 Dimensional Array

An array of arrays is known as 2D array. The two dimensional (2D) array in C programming is also known as matrix. A matrix can be represented as a table of rows and columns. This lesson demonstrates how to store the elements entered by user in a 2d array and how to display the elements of a two dimensional array.

2-D Array

A three-dimensional (3D) array is an array of arrays of arrays. C programming an array can have two, three, or even ten or more dimensions. The maximum dimensions a C program can have depends on which compiler is being used.

More dimensions in an array means more data be held, but also means greater difficulty in managing and understanding arrays.

3-D array is declared using the following syntax:

type array_name[d1][d2][d3][d4]………[dn];

Where each d is a dimension, and dn is the size of final dimension.

Examples:

int table[5][5][20];
float arr[5][6][5][6][5];
In Example 1:

int designates the array type integer.
table is the name of our 3D array.
Our array can hold 500 integer-type elements. This number is reached by multiplying the value of each dimension. In this case: 5x5x20=500.

3-D Array

A square matrix is called lower triangular if all the entries above the main diagonal are zero. Similarly, a square matrix is called upper triangular if all the entries below the main diagonal are zero. A triangular matrix is one that is either lower triangular or upper triangular.we cover to solve it via two types Row major order as well through column major order with previous year questions.

Lower triangle matrix

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Stack in Data Structures with operations, Algorithm and its implementation and is beneficial for GATE(CS IT) preparation.

(Hindi) Stack in Data Structures - GATE (CS and IT)

In this course, I will discuss Arrays in C with some GATE PYQs along with the basic concepts. The course will be beneficial for GATE Aspirants.

(Hindi) Array in C With Concepts and PYQs: GATE (CS and IT)

This course will cover Queue in Data Structures for GATE (CS & IT) Aspirants. In this course, I will be explaining Queue Operations and its implementation using Array & Linked List.

(Hindi) Queue in Data Structures - GATE (CS & IT)

This course will cover total Previous Year Questions From Tree topic of Data structures asked in GATE Exam.

Lessons

15 lessons • 2h 19m

Invalid Date

NaN

Course Overview

Invalid Date

NaN

Hashing : Introduction

Invalid Date

NaN

Types of Hash Function : Part I

Invalid Date

NaN

Types of Hash Function Part 2

Invalid Date

NaN

Collision Resolution Technique

Invalid Date

NaN

Linear Probing ( Types of Open Addressing )

Invalid Date

NaN

Quadratic Hashing

Invalid Date

NaN

Clustering

Invalid Date

NaN

Double Hashing

Invalid Date

NaN

Previous Years Gate Question ( Hashing )

+ See all lessons