Data Structures Using C

Data Structures Using C is a free Computer Science Engineering handbook covering important course topics, detailed notes, diagrams, equations, formulas and study materials. Download this digital book and reference guide for Diploma, BE, BTech, BCA, BSc, MCA and other degree courses.

Learn C programming and data structures, algorithms, arrays, pointers, sorting, searching, stacks, queues, linked lists and hashing. Useful for exams, coding interviews, viva, assignments, projects and quick revision.

RELATED ENGINEERING BRANCHES
Computer Science Engineering (CSE), Information Technology (IT), Computer Engineering, Software Engineering, Artificial Intelligence and Data Science.

ALL 81 UNIQUE TOPICS COVERED

DATA STRUCTURES & C FUNDAMENTALS
1. Introduction to Data Structures
2. Types of Data Structures
3. Primitive and Non-Primitive Data Structures
4. Binary and Decimal Integers
5. Algorithms
6. Time and Space Complexity
7. Logical Information
8. Storage of Information
9. Hardware and Software
10. Concepts of Data Types
11. Abstract Data Types (ADT)
12. Pointers
13. Structures in C
14. Unions
15. Data Types in C
16. Integer Data Types
17. Overflow in char and unsigned char
18. The char Data Type
19. Floating-Point Numbers
20. Type Conversion
21. Forced Conversion
22. Type Casting

C OPERATORS & CONTROL STRUCTURES
23. Assignment Operator
24. Arithmetic Operators
25. Relational Operators
26. Logical Operators
27. Ternary Operator
28. Increment Operator
29. Comma Operator
30. Bitwise Operators
31. Operator Precedence
32. Control Structures
33. if Statement
34. if-else-if
35. switch Statement
36. while Loop
37. do-while Loop
38. for Loop
39. break Statement
40. continue Statement

INPUT/OUTPUT, PREPROCESSOR & ARRAYS
41. printf Function
42. Placeholders
43. Addresses
44. scanf Function
45. scanf Placeholders
46. Preprocessor
47. Macros
48. Macros and Functions
49. Arrays in C
50. Addresses of Array Elements
51. Accessing Array Elements with Pointers
52. Two-Dimensional Arrays
53. Three-Dimensional Arrays
54. Applications of Arrays
55. Merging Two Sorted Lists
56. Matrix Transpose
57. Saddle Point of a Matrix

SORTING, SEARCHING & HASHING
58. Heap Implementation
59. Bubble Sort
60. Quick Sort
61. Merge Sort
62. Heapsort
63. Searching Techniques
64. Binary Search
65. Hashing
66. Hash Functions

STACKS, QUEUES & LINKED LISTS
67. Stacks
68. Stack Implementation with Linked Representation
69. Applications of Stacks
70. Queues
71. Queue Implementation
72. Circular Queue
73. Queue Implementation with Linked Representation
74. Applications of Queues
75. Linked Lists
76. Inserting a Node into a Linked List
77. Sorting a Linked List
78. Deleting a Node in a Singly Linked List
79. Inserting a Node After a Specified Node
80. Counting Nodes in a Singly Linked List
81. Erasing a Linked List

APP FEATURES
• Chapter-wise notes and engineering study materials
• Diagrams, formulas and mobile-optimized content
• Comfortable reading mode and simple navigation
• Useful for exam preparation and interview revision

Use this free Data Structures Using C ebook for programming fundamentals, practical learning and university syllabus revision.