BSCS students can now download the complete Aikman Series textbook, “Data Structures in C++,” as a PDF. Written by Muhammad Tauqueer and published by Aikman Book Company, this book covers all the fundamental data structures taught in Pakistani universities using C++ programming language.
This book is written in simple and easy-to-understand language with small, practical C++ programs throughout. It is suitable for self-study, classroom use, and exam preparation for BSCS students. All programs are tested using Turbo C++ and are compatible with Borland C++ as well.
Book Overview
- Class: BSCS
- Subject: Data Structures in C++
- Series: Aikman Series
- Author: Muhammad Tauqueer
- Publisher: Aikman Book Company
- Total Chapters: 9
- Format: PDF (Free Download)
Chapter List
Chapter 1: Introduction
Covers data and information, data structures, operations on data structures, algorithms and algorithmic notation, input/output statements, selection and looping statements, sub-algorithms, and types of sub-algorithms.
Chapter 2: Arrays
Explains arrays, representation of linear arrays in memory, operations on linear arrays (traversing, inserting, deleting), searching and sorting arrays, two-dimensional arrays, and algebraic operations on matrices.
Chapter 3: Strings
Covers string representation in memory, fixed and variable length strings, linked strings, string operations (computing length, copying, concatenation, extracting sub-string, pattern matching, insertion, deletion, replacement).
Chapter 4: Stacks
Explains stacks, representation of stacks, stack operations, recursion, implementation of recursive procedures using stacks, evaluation of expressions, Polish notation, reverse Polish (postfix) notation, and infix to postfix conversion.
Chapter 5: Queues
Covers queues, representation of queues, Qinsert and Qdel procedures, deques, representation of deque, priority queues, and representation of priority queues.
Chapter 6: Searching & Sorting
Explains sequential search, binary search, bubble sort, selection sort, insertion sort, and merge sorting with C++ implementation and analysis.
Chapter 7: Linked Lists
Covers single linked lists, representation in memory, single linked list operations (traversing, insertion, deletion), circular linked lists, double linked lists (two-way lists), and circular double-linked lists.
Chapter 8: Trees
Explains basic tree terms, binary trees (full, extended, complete), binary search trees (BST), constructing and representing BSTs, operations on BSTs (insertion, searching, deletion), traversal operations (preorder, inorder, postorder), and expression binary trees.
Chapter 9: Graphs
Covers graph types (undirected, directed, weighted), graph terminology (degree, source/sink nodes, path, cycles), representation of graphs (adjacency matrix and list), and graph traversal using Breadth-First Search (BFS) and Depth-First Search (DFS).
Download Data Structures in C++ PDF
Your free PDF is ready. Click the button below to download the complete Aikman Series Data Structures textbook.
⬇ Download PDFWho Should Read This
This book is written for BSCS students studying Data Structures at Pakistani universities. BIT, BSIT, and MCS students who have Data Structures in their curriculum will also find it very useful. The clear explanations and practical C++ programs make it ideal for both self-study and exam preparation.
Applicable Universities
This Aikman Series textbook is widely used at Pakistani universities offering BSCS, BIT, BSIT, and MCS programs including Punjab University, Virtual University, COMSATS, FAST, UET, and other HEC-recognized institutions.
FAQs
Is this the Aikman Series Data Structures book for BSCS?
Yes, this is the Aikman Series Data Structures in C++ textbook by Muhammad Tauqueer, widely used in BSCS programs at Pakistani universities.
Which data structures are covered in this book?
The book covers Arrays, Strings, Stacks, Queues, Searching and Sorting, Linked Lists (single, double, circular), Trees (binary, BST), and Graphs — all 9 chapters with C++ implementation.
Does this book include C++ programs?
Yes, practical C++ programs are included throughout all chapters. All programs are tested using Turbo C++ and compatible with Borland C++.
Is searching and sorting covered in detail?
Yes, Chapter 6 covers sequential search, binary search, bubble sort, selection sort, insertion sort, and merge sort with C++ code.
Can BIT or BSIT students also use this book?
Yes, BIT, BSIT, and MCS students with Data Structures in their syllabus will find this book very useful for both theory and practical exam preparation.
Is this the latest edition?
This is the available edition of the Aikman Series Data Structures in C++ book by Muhammad Tauqueer for Pakistani university students.