Data Structures And Algorithms

Lecture Details Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit httpnptel.iitm.ac.in

Created by

skill expert

32:48:50 Hours

0 Enrolled

    • (0 Reviews)

English

Last updated

Mon, 25-Jul-2022

Course description

Overview

Introduction, Stacks, Queues and Linked Lists, Dictionaries, Hashing, Tree Walks/Traversals, Deletion, Quick Sort, AVL Trees, Red Black Trees, Disk Based Data Structures, Priority Queues, Binary Heaps, Sorting, Graphs, Depth First Search(DFS) , Prims Algorithm for Minimum Spanning Trees and Dijkstras Algorithm.

What will i learn?

Requirements

skill expert

View profile

Free

Lectures

36

Skill level

Beginner

Expiry period

Lifetime

Certificate

Yes
Enroll now

Related courses

Beginner

Tools in Scientific Computing

0

(0 Reviews)

Compare

Overview Rapid advancements in computer hardware and high quality software libraries have enabled one to undertake works requiring high precision scientific computing with relative ease. The course involves exploration of various tools available for scientific computing with an emphasis on hands-on implementation. The course will deal briefly with the theory and the associated implementation for practical problems that an engineer may encounter. Undergraduates, postgraduates, and PhD students may find this course immensely useful for their project or research work. The course will make use of Python, GNU Octave, and PETSC (C based) as the medium of coding.

Free

34:30:27 Hours

Beginner

Artificial Intelligence Search Methods for problem Solving

0

(0 Reviews)

Compare

Overview For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving.

Free

27:10:39 Hours

Beginner

Introduction to R Software

0

(0 Reviews)

Compare

Overview Any scientific task without the knowledge of software is difficult to imagine and complete in the current scenario. R is a free software that is capable of handling mathematical and statistical manipulations. It has its own programming language as well as built in functions to perform any specialized task. We intend to learn the basics of R software in this course.

Free

20:48:51 Hours

Beginner

Introduction to parallel Programming in Open MP

0

(0 Reviews)

Compare

Overview This course focuses on the shared memory programming paradigm. It covers concepts & programming principles involved in developing scalable parallel applications. Assignments focus on writing scalable programs for multi-core architectures using OpenMP and C. This is an introductory course in shared memory parallel programming suitable for computer science as well as non-computer science students working on parallel/HPC applications and interested in parallel programming

Free

07:24:45 Hours

Beginner

Design of Digital Circuits and Computer Architecture

0

(0 Reviews)

Compare

Overview The class provides an introduction to the design of digital circuitry. The class covers the basics of the technical foundations of gates. An introduction to hardware description languages and their use in the design process follows.

Free

39:26:26 Hours

Beginner

Memory Systems

0

(0 Reviews)

Compare

Overview In this course, we first provide a comprehensive overview of memory systems, taking an approach that covers both fundamentals and recent research. We first introduce fundamental principles and ideas, covering DRAM and emerging memory technologies as well as many architectural concepts and ideas related to memory organization, memory control, processing-in-memory, and memory latency / energy / bandwidth / reliability / security / QoS. We discuss major challenges facing modern memory systems (and the computing platforms we currently design around the memory system) in the presence of greatly increasing demand for data and its fast analysis. We examine some promising research and design directions to overcome these challenges. On the research-related part of course (sprinkled across topical lectures), we discuss the following key research topics in detail, focusing on both open problems and potential solution directions: Fundamental issues in memory reliability and security and how to enable fundamentally secure, reliable, safe architectures Enabling data-centric and hence fundamentally energy-efficient architectures that are capable of performing computation near data Reducing both latency and energy consumption by tackling the fixed-latency/energy mindset Enabling emerging memory technologies Enabling predictable and QoS-aware memory systems Research challenges and opportunities in enabling emerging NVM (non-volatile memory) technologies Scaling NAND flash memory and SSDs (solid state drives) into the future

Free

22:36:25 Hours

Beginner

Hardware Accelerated Database Lectures

0

(0 Reviews)

Compare

Overview Let's get real and talk about hardware acceleration for database management systems. We are flexing hard with another season of database technical talks at Carnegie Mellon University in Fall 2018. The "Hardware Accelerated Database Lectures" is a semester-long seminar series featuring speakers from the leading developers of DBMSs designed to exploit modern computational and storage hardware. Each speaker will present the implementation details of their respective systems and examples of the technical challenges that they faced when working with real-world customers.

Free

06:05:46 Hours

Beginner

Advanced Algorithms

0

(0 Reviews)

Compare

Overview CS 224 is an advanced course in algorithm design, and topics we will cover include the word RAM model, data structures, amortization, online algorithms, linear programming, semidefinite programming, approximation algorithms, hashing, randomized algorithms, fast exponential time algorithms, graph algorithms, and computational geometry.

Free

35:28:15 Hours

Beginner

Virtual Reality

0

(0 Reviews)

Compare

Overview Introduction:Course mechanics - Goals and VR definitions - Historical perspective - Birds-eye view (general) - Birds-eye view (hardware) - Birds-eye view (software) - Birds-eye view (sensation and perception) Geometry of Virtual Worlds:Geometric modeling - Transforming models - Matrix algebra and 2D rotations - 3D rotations and yaw, pitch, and roll - Axis-angle representations - Quaternions - Converting and multiplying rotations - Homogeneous transforms - The chain of viewing transforms - Eye transforms - Canonical view transform - Viewport transform Light and Optics:Three interpretations of light - Refraction - Simple lenses - Diopters - Imaging properties of lenses - Lens aberrations - Optical system of eyes

Free

13:50:03 Hours

Beginner

WiFi Wireless Security

0

(0 Reviews)

Compare

Overview Getting Started - Linux Networking Commands - Enabling Monitor Mode - Sniffing Traffic - Sniffing from the Command Line - macchanger and Targeted Sniffing - Deauthentication / Deauth Attacks - WPA / WPA2 Password Recovery Overview - WPA / WPA2 Password Recovery Demonstration - How to Protect Against Dictionary Attacks - Using Pyrit to Speed Up Password Recovery - Reaver for WPS Pin Recovery - Hydra for Router Login - Whats is DNS Spoofing and MITM Attacks? - DNS Spoofing and MITM Attack Demo - How to Defend Against MITM Attacks - Fake Access Point Prevention

Free

02:11:47 Hours

Beginner

Cognos

0

(0 Reviews)

Compare

Overview Cognos is IBM's business intelligent tool to help non technical professionals to analyse the user data & making sense of the data for the future decisions and growth.

Free

10:07:51 Hours

Beginner

COBOL

0

(0 Reviews)

Compare

Overview Introduction Divisions Accept Display - Identification and Environment Divisions - Simple variables - Arithmetic Operations - Move and IF - Sign and Decimals - Zero suppression - Perform and Loops - Perform Thru and Until - Arrays and Records - Nested Records - Condition Names - Call Programs using Linkage

Free

01:42:21 Hours

Study any topic, anytime. explore thousands of courses for the lowest price ever!

Top categories

Useful links

Help

Subscribe to our newsletter