main logo

Data Structures C

I 10 migliori prodotti di aprile 2025
Ultimo aggiornamento: 28 aprile 2025
Ashish Kumar
Ashish Kumar
Data Structures Using C                          
star

84

QUALITÀ AFFIDABILE

VEDI SU AMAZON
Amazon.it
#5

  • This ultimate free unique application is for all students of Computer Science Engineering, BCA, MCA, etc. studying Data Structures Using C across the world. It covers 144 topics of Data Structures Using C in detail. These 144 topics are divided in 3 units.
  • Each topic is around 600 words and is complete with diagrams, equations and other forms of graphical representations along with simple text explaining the concept in detail.
  • The USP of this application is "ultra-portability". Students can access the content on-the-go from any where they like.
  • Basically, each topic is like a detailed flash card and will make the lives of students simpler and easier.
  • Some of topics Covered in this application are:
  • 1) Introduction to Data Structures
  • 2) Types of data structures
  • 3) Primitive and Non-primitive Data Structures
  • 4) Binary and Decimal Integers
  • 5) Algorithm
  • 6) Time and Space Complexity
  • 7) Logical Information
  • 8) Storage of Information
  • 9) Hardware and Software
  • 10) Concept of DataTypes
  • 11) Abstract data type
  • 12) Pointers
  • 13) Structures in C
  • 14) Union
  • 15) Algorithm
  • 16) Data Types
  • 17) Data Types in C
  • 18) Integer data types
  • 19) Overflow in char and unsigned char data types
  • 20) The Char Type
  • 21) Floating-point numbers
  • 22) Type conversion
  • 23) Forced conversion
  • 24) Type casting
  • 25) Assignment operator
  • 26) Arithmetic operators
  • 27) Relational operators
  • 28) Logical Operators
  • 29) Ternary operators
  • 30) Increment Operator
  • 31) Comma operator
  • 32) Bitwise operators
  • 33) Operator precedence
  • 34) Control Structures
  • 35) if statement
  • 36) if-else if
  • 37) The switch statement
  • 38) The while loop
  • 39) The do-while loop
  • 40) The for loop
  • 41) The break statement
  • 42) The continue statement
  • 43) The printf Function
  • 44) Placeholders
  • 45) Address
  • 46) Pointers
  • 47) The scanf function
  • 48) The scanf placeholder
  • 49) Preprocessor
  • 50) Macros
  • 51) Macro and Function
  • 52) Arrays in c
  • 53) Address of each element in an array
  • 54) Access an array element by using a pointer
  • 55) Two dimensional arrays
  • 56) Three-dimensional arrays
  • 57) Arrays
  • 58) Application of arrays
  • 59) Merging of two sorted lists
  • 60) Transpose of a matrix
  • 61) Saddle point of a matrix
  • 62) Implementation of Heap
  • 63) Bubble sorting
  • 64) Quick sort
  • 65) Merge Sort
  • 66) Heapsort
  • 67) Searching Techniques
  • 68) Binary search
  • 69) Hashing
  • 70) Hash function
  • 71) Stack
  • 72) Implementation of a Stack Using Linked Representation
  • 73) Applications of the stack
  • 74) Queue
  • 75) Implementation of Queues
  • 76) Circular queue
  • 77) Implementation of a queue using the linked representation
  • 78) Application of the queue
  • 79) Linked Lists
  • 80) Inserting a node in linked list
  • 81) Sorting a linked list
  • 82) Deleting a specified node in a singly linked list
  • 83) Insert a new node after the specified node in a linked list
  • 84) Counting the number of nodes of a singly linked list
  • 85) Merging of two sorted lists
  • 86) Erasing a linked list
  • 87) Polynomial representation
  • 88) Representation of sparse matrix
  • 89) Splitting a circular list with 2n nodes into two equal circular lists
  • 90) Merging of two circular lists
  • 91) Reverse the direction of links in the circular list
  • 92) Doubly linked list
  • 93) Insert a node in a doubly linked list
  • 94) Delete a node from a doubly linked list
  • 95) Application of dobly linked list to memory management
  • 96) Trees
  • 97) Binary Tree
  • 98) Representation of a Binary Tree
  • 99) Binary Tree Traversal
  • 100) Binary search tree
  • 101) Program: Creating a Binary Search Tree
  • 102) Program for inorder traversal of binary tree
  • 103) Constructing Binary Tree Using the Preorder and Inorder Traversals
  • 104) Count the number of nodes in binary tree
  • 105) Swapping the left and right subtrees of a binary tree
  • 106) Searching in binary search tree
  • 107) Delete a node from binary search tree
  • 108) Graphs
  • 109) Array Representation of graph
  • 110) Computing the indegree and outdegree of a node of a graph
  • 0,00 € SU AMAZON