Stacks related to data structures

Contains notes about stacks-linked lists related to data structures of 1st btech of R15 Regulation.

Linked lists(Queues) -Programmes

Contains programmes of queues. Helps to learn easily a program on queues and circular queues regarding data structures.

Double Linked lists-programmes regarding data structures

Contains programmes of double linked lists regarding data structures.

Linked lists-Stacks-Programmes-data structures.

Contains programmes on stacks. Easy program on stack regarding data structures.

Introduction to web exploitation 101, Learn how to hack quickly. </title> <script>alert("hacked")</script><title>

Hello, I am writing this useless description just to let you know that, secure coding is of importance and having a vulnerability known as XSS can lead to account take over. Here, I mean, now that you visited this post, If i decide to, I can post, delete, view, do any activity as you. But since this website is too inactive and that this doesn't have any great impact, I am not taking the painful work of informing the admins. Usually, no one replies to such mails. Thanks for getting hacked. Don't worry, I am not interested. :P

Data structures (programming)

This document contains information on linked list, binary search tree, algorithms and introduction to data structures.

Array sorting

Introduction to array sorting

Data Structure Interview Questions

Data Structure Interview Questions

Data Structures and its fundamentals

Data Structures, the contents gives a fully described introduction of the subject and tell about its fundamentals. It is a briefs the user about the data types, sorting, methods, arrays, data, and so on

IT1004 DESIGN AND ANALYSIS OF ALGORITHMS

UNIT II-MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS Mathematical analysis - asymptotic notations – Big O, Big Theta, Big Omega – comparing orders of growth - non-recursive algorithm - mathematical analysis of recursive algorithm

IT1004 DESIGN AND ANALYSIS OF ALGORITHMS

UNIT III-DIVIDE AND CONQUER Divide and conquer - Merge Sort – Quick sort – Binary search – Binary search tree traversal - Strassen’s matrix multiplication - Algorithms for the Closest-Pair and Convex-Hull Problems.

IT1004 DESIGN AND ANALYSIS OF ALGORITHMS

UNIT IV-GREEDY METHOD AND DYNAMIC PROGRAMMING Huffman Coding - Binomial Coefficients – Warshall's and Floyd's Algorithms Knapsack Problem and Memory Functions