Local cover image
Local cover image
Amazon cover image
Image from Amazon.com

Data structure lab experiment with c / Girish Rao Salanke and Dillon Addison.

By: Contributor(s): Material type: TextTextPublication details: London : ED-Tech Press, c2023.Description: 118 pages : illustration ; 24cmISBN:
  • 9781804060674
Subject(s): LOC classification:
  • QA 76.73 .C15 .S25 2023 c.1
Contents:
Menu Driven Program to Create An Array and to Perform Insertion and Deletion Operation.--String Searching and Replacement.--Stack Implementation Using Arrays.--Convert Infix to Postfix Expression.--Evaluation of Suffix/Postfix Expression.--Tower of Hanoi Problem with n Disks; Circular Queue Using Arrays.--Singly Linked List; Doubly Linked List.--Polynomial Addition Using Circular Singly Linked List.--Binary Search Tree.--Create n Cities Using Adjacency Matrix, Print Nodes Reachability by BFS Method and Connectivity of the Graph using DFS Method.--Create a hash table using hash function and resolve collision using linear probing.
Summary: This book aim at providing a comprehensive introduction to various data structures and their implementation.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books NU BALIWAG NU BALIWAG Computer Engineering General Circulation GC QA76.73 .C15 .S25 2023 c.1 (Browse shelf(Opens below)) c.1 Available NUBUL000005493

Includes index.

Menu Driven Program to Create An Array and to Perform Insertion and Deletion Operation.--String Searching and Replacement.--Stack Implementation Using Arrays.--Convert Infix to Postfix Expression.--Evaluation of Suffix/Postfix Expression.--Tower of Hanoi Problem with n Disks; Circular Queue Using Arrays.--Singly Linked List; Doubly Linked List.--Polynomial Addition Using Circular Singly Linked List.--Binary Search Tree.--Create n Cities Using Adjacency Matrix, Print Nodes Reachability by BFS Method and Connectivity of the Graph using DFS Method.--Create a hash table using hash function and resolve collision using linear probing.

This book aim at providing a comprehensive introduction to various data structures and their implementation.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image

© 2023 NU LIBRARY BALIWAG. All rights reserved. Privacy Policy I Powered by: KOHA