Data Structure
Computer Awareness and Information Technology Solutions from Chapter -1 - Data Structure
This chapter covers topics, such as Sorting and Searching Algorithms, Trees, Basics of Data Structures, Arrays, Performance Analysis and Measurement, Graph Theory, Stacks and Queues, and Linked Lists.
Practice Other Topics from Data Structure
This topic covers concepts, such as Non-primitive Data Structures, Classification of Data Structures, Primitive Data Structures, Operations on Data Structures, Understanding Data Structures, and Concept of Data Structure.
This topic covers concepts, such as Array Declaration by Specific Size and Initializing Elements, Indexing in an Array, Array Declaration by Initializing Elements, Operations on Arrays, Declaration of Array, Array Declaration by Specific size, etc.
This topic covers concepts, such as Properties of Stacks, Types of Queues, Double-Ended Queues, FIFO - First In First Out, Implementation of Stacks, Characteristics of Circular Queue, Input-restricted Dequeue, Output-restricted Dequeue, etc.
This topic covers concepts, such as Singly Linked List, Doubly Linked List, Circular Linked List, Implementation on Linked Lists, Operations on Linked Lists, Circular Doubly Linked List, Types of Linked Lists, and Linked Lists.
This topic covers concepts, such as Binary Trees, Internal Nodes in Tree Data Structure, Height of a Tree in Tree Data Structure, Trees as a Data Structure, Depth of a Node in Tree Data Structure, Complete Binary Tree, Strictly Binary Tree, etc.
This topic covers concepts, such as Depth First Traversal, Edge of a Graph, Meaning of Loop, Undirected Graph, Graph Traversal, Mixed Graphs in Graph Theory, Breadth-First Traversal, Disconnected Graphs, Multiple Graph, Definition of Graph, etc.
This topic covers concepts, such as Quick Sort, Binary Search, Requirements for Searching, Linear Search, Sorted Arrays, Insertion Sort, Bubble Sort, Selection Sort, Specification of the Search Problem, Radix Sort, Unsorted Arrays, Heap Sort, etc.
This topic covers concepts, such as Time Complexity, Big-O Notation for Complexity class, Time versus Space Complexity, Worst versus average Complexity, Constant Time Complexity, Concrete Measures for Performance, Linear Time Complexity, etc.
