Description

Book Synopsis
This book is an outcome of long years of teaching experience for undergraduate as well as post graduate students, and is an attempt to put together all the essential topics of data structures and Algorithms for easy reference. The under-graduate students of computer science and engineering, post-graduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple choice questions under each chapter which will be useful for those who aspire to write the GATE examination. A brief course on C-programming language is given to help the students in implementing the algorithms.

Salient Features:
  • The data structures are explained with simple relevant examples.
  • Algorithms are written in simple pseudo-code and are easy to convert to any programming language.
  • Concepts are well supported with suitable examples and diagrams for the students to find it easy to follow.
  • Includes review questions as well as MCQs with answers.
  • Critical examples with stepwise explanation makes it a great instructor resource.


Table of Contents
  • Introduction
  • Elementary Data Structures
  • Divide and Conquer Technique
  • Greedy Technique
  • Dynamic Programming
  • Backtracking
  • Branch and Bound Technique
  • NP-Hard and NP-Complete Problems
  • Bibliography
  • Index

Data Structures and Algorithms

Product form

£32.36

Includes FREE delivery

RRP £35.95 – you save £3.59 (9%)

Order before 4pm tomorrow for delivery by Fri 19 Dec 2025.

A Paperback / softback by C. V. Sastry, Rakesh Nayak, CH Rajaramesh

Out of stock


    View other formats and editions of Data Structures and Algorithms by C. V. Sastry

    Publisher: I K International Publishing House Pvt. Ltd
    Publication Date: 30/01/2018
    ISBN13: 9789385909849, 978-9385909849
    ISBN10: 9385909843
    Also in:
    Algorithms and data structures Computer science Engineering: general

    Description

    Book Synopsis
    This book is an outcome of long years of teaching experience for undergraduate as well as post graduate students, and is an attempt to put together all the essential topics of data structures and Algorithms for easy reference. The under-graduate students of computer science and engineering, post-graduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple choice questions under each chapter which will be useful for those who aspire to write the GATE examination. A brief course on C-programming language is given to help the students in implementing the algorithms.

    Salient Features:
    • The data structures are explained with simple relevant examples.
    • Algorithms are written in simple pseudo-code and are easy to convert to any programming language.
    • Concepts are well supported with suitable examples and diagrams for the students to find it easy to follow.
    • Includes review questions as well as MCQs with answers.
    • Critical examples with stepwise explanation makes it a great instructor resource.


    Table of Contents
    • Introduction
    • Elementary Data Structures
    • Divide and Conquer Technique
    • Greedy Technique
    • Dynamic Programming
    • Backtracking
    • Branch and Bound Technique
    • NP-Hard and NP-Complete Problems
    • Bibliography
    • Index

    Recently viewed products

    © 2025 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account