Skip to main content

LinkedList 1 Data Structure

Question: What are Data Structures?

Ans: Data structures are specialized formats for organizing and storing data in a computer's memory or storage. They define the way data is organized, stored, and manipulated to efficiently perform specific operations. Different data structures are suitable for different tasks, and choosing the right data structure can significantly impact the efficiency and performance of algorithms and programs.


See, data is a central part of whatever system we are building, This is a central part right ?

Here are some common types of data structures:

  1. Arrays: A collection of elements identified by index or key.

  2. Linked Lists: A sequence of elements where each element points to the next element in the sequence.

  3. Stacks: A Last In, First Out (LIFO) data structure where elements are added and removed from the same end.

  4. Queues: A First In, First Out (FIFO) data structure where elements are added at the rear and removed from the front.

  5. Trees: Hierarchical data structures with a root element and subtrees of children, typically represented in a branching structure.

  6. Graphs: A collection of nodes with edges connecting them, representing relationships.

  7. Hash Tables: A data structure that maps keys to values, providing efficient insertion, deletion, and retrieval operations.

  8. Heaps: Specialized tree-based data structures used for priority queue implementations.

Data structures play a crucial role in computer science and programming, influencing the efficiency of algorithms and the performance of software applications. The choice of a specific data structure depends on the requirements of the problem at hand and the operations that need to be performed efficiently.

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

Block vs Inline Elements In HTML

  Block: Block element always start in New Line  Block element always start in new line occupy complete width available  Example: h2, p, div Inline Element: They do not start in new line occuply width as much required  Example: img, anchor a,span There are no different between div and span, only difference is div is block element and span is Inline, it will help you to group your content or elements
Post a Comment
Read more

Time Complexity

What is time complexity ? Ans: Time complexity not a run time of a code, its totally depends on system configuration, processor, server , input size will increase time complexity. Time complexity ko likhne ke tarike jo hote hai use notation kehte hai. Notation is basically symbol NOTATION OF COMPLEXITY Best Case: kam se kam time me chla gya code best case hota hai Ω (Omega) Ω(1) se likhte hai Average Case: Ek average time jisme code chle  Θ(n+1)/2 Worst Case: Worst case ka mtlb kuch bhi ho jaye is time ko ye exceed nhi kregea O(n) Nested Loop me Time Complexity multiply hoti hai aur n^2 banti hai Wahi Do different loops me N+M hoti hai jisme jiski sabse bdi value hai wo big of O me jati hai O(1) - Constant Time: Operations that take a constant amount of time, regardless of the size of the input data. O(log n) - Logarithmic Time: Algorithms that have a logarithmic time complexity, often seen in binary search or certain tree-based algorithms. This is best time Complexity this i...
Post a Comment
Read more

Find Unique Number in Array Java , XOR

 Question:  WAP to find unique number in Array Java package aRray ; import java . util .*; public class practicalArray { public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; // Step 1: Input size of the array from the user int size = scan . nextInt () ; // Step 2: Create an integer array of the specified size int [] arr = new int [ size ] ; // Step 3: Initialize 'res' with the first element of the array int res = arr [ 0 ] ; // Step 4: Loop to read array elements and find the unique number for ( int i = 1 ; i < size ; i ++ ) { // Read an integer from the user and store it in the array arr [ i ] = scan . nextInt () ; // Step 5: Use XOR (^) operation to find the unique number res = res ^ arr [ i ] ; } // Step 6: Print the unique number System . out . print...
Post a Comment
Read more