All Materials regarding to B.tech R-20 in Computer Science Engineering with unit wise for Every Subjects are available.
👇👇Scroll Down for Important Questions and Topics Unit Wise 👇👇
| CSE 1-2 DS | ||
|---|---|---|
| S.No | Chapters / Units | Download Link |
| 1 | Unit 1 | Download |
| 2 | Unit 2 | Download |
| 3 | Unit 3 | Download |
| 4 | Unit 4 | Download |
| 5 | Unit 5 | Download |
CSE 1-2 DS Important Topics Questions
UNIT I
Data Structures - Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity.
Searching - Linear search, Binary search, Fibonacci search.
Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix
sort), merging (Merge sort) algorithms.
UNIT II
Linked List: Introduction, Single linked list, Representation of Linked list in memory,
Operations on Single Linked list-Insertion, Deletion, Search and Traversal ,Reversing Single
Linked list, Applications on Single Linked list- Polynomial Expression Representation
,Addition and Multiplication, Sparse Matrix Representation using Linked List, Advantages
and Disadvantages of Single Linked list, Double Linked list-Insertion, Deletion, Circular
Linked list-Insertion, Deletion.
UNIT III
Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked
list, Implementation of Queues-using Arrays and using Linked list, Application of Queues-
Circular Queues, Deques, Priority Queues, Multiple Queues.
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked
list Representation of Stacks, Operations on Linked Stack, Applications-Reversing list,
Factorial Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.
UNIT IV
Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees
using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations:
Insertion, Deletion, Tree Traversals, Applications-Expression Trees, Heap Sort, Balanced
Binary Trees- AVL Trees, Insertion, Deletion and Rotations.
UNIT V
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list,
Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using Prims &
Kruskals Algorithm, Dijkstra’s shortest path, Transitive closure, Warshall’s Algorithm.
Disclaimer :
We are not responsible for any loss of data /or any other information by visiting this website. We just providing previous papers to help the students who need previous papers to prepare themselves. This downloaded from internet source just to education purpose only.
Thank you.
Feel free to contact us, if you want any other courses or Tutorials or any other information .
We'll always try to helps you better learn something