C & data structures (Record no. 1972)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 07222cam a2200169 a 4500 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | 9788177224245 9 (pb) |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Deshpande, P. S. |
| 245 10 - TITLE STATEMENT | |
| Title | C & data structures |
| Statement of responsibility, etc. | P.S. Deshpande and O.G. Kakde. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Hingham, Mass. : |
| Name of publisher, distributor, etc. | Charles River Media, |
| Date of publication, distribution, etc. | c2004 |
| 500 ## - GENERAL NOTE | |
| General note | Title from title screen. |
| 500 ## - GENERAL NOTE | |
| General note | Includes index and link to CD content. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part I: C Language<br/>Introduction to the C Language<br/>The first program in C<br/>Inputting the data<br/>The control statement (if statement)<br/>The iteration loop (for loop)<br/>The do.. .while loop<br/>The switch statement<br/>Data lypes<br/>Various data types in C<br/>The integer data type family<br/>Overflow in char and unsigned char data types<br/>The char type<br/>Octal numbers<br/>Hexadecimal numbers<br/>Representation of floating-point numbers<br/>Type conversion<br/>Forced conversion<br/>Type casting<br/>C Operators<br/>Arithmetic operator<br/>Relational operator<br/>Logical operator<br/>Ternary operator<br/>Increment operator<br/>Comma operator<br/>Bitwis^ operator<br/>Operator precedence<br/>4 Control Structures<br/>Control structures<br/>The if statement<br/>Scope of an 1 f clause<br/>The if-else statement<br/>The if-else if statement<br/>The switch statement<br/>The while loop<br/>The do-while loop<br/>The for loop<br/>The for loop with a comma operator<br/>The break statement<br/>The continue statement<br/>5 The printf Function<br/>printf<br/>Placeholders<br/>6 Address and Pointers<br/>Address<br/>Pointers<br/>7 The scanf Function<br/>scanf<br/>The scanf placeholders<br/>8 Preprocessing<br/>Preprocessor<br/>undef<br/>ifdef<br/>i fndef<br/>#if<br/>ifelse<br/>ifelif<br/>Error directive<br/>#line<br/>Macro<br/>Macro and function<br/>9 Arrays<br/>Arrays<br/>Address of each element in an array<br/>Accessing an array using pointers'<br/>Manipulating arrays using pointers<br/>Another case of manipulating an array using pointers<br/>Two-dimensional array<br/>Three-dimensional array<br/>Pointer arrays<br/>10 Functions<br/>Functions<br/>The concept of stack<br/>The sequence of execution during a function call<br/>Parameter passing<br/>Call by reference<br/>The concept of global variables<br/>Resolving variable references<br/>Syntax of function definition<br/>Calling function<br/>11 Storage of Variables<br/>Storage<br/>External references<br/>Register variables<br/>Scope of variables<br/>Further scope of variables<br/>12 Memory Allocation<br/>Dynamic memory allocations<br/>13 Recursion<br/>Recursion<br/>Stack overheads in recursion<br/>Writing a recursive function<br/>14 Strings<br/>Strings as an array of characters<br/>String definition<br/>Strings as parameters<br/>15 Structures<br/>Structures<br/>Complex structure definitions<br/>Memory allocation to structure<br/>Programming with structures<br/>Structure pointers<br/>16 Union<br/>Union<br/>17 Files<br/>The concept of files<br/>Direct access files<br/>Part 11: Data Structures<br/>18 Arrays, Searching, and Sorting<br/>Arrays<br/>Application of arrays<br/>Manipulations on the list implemented using an array<br/>Merging of two sorted lists<br/>Transpose of a matrix<br/>Finding the saddle point of a matrix<br/>Implementation of heaps<br/>Sorting and searching<br/>^ Bubble sort<br/>Quick sort<br/>v^erge sort<br/>Heapsort<br/>Searching techniques: linear or sequential search<br/>Binary search<br/>Hashing<br/>Hashing functions<br/>19 Stacks and Queues<br/>The concept of stacks and queues<br/>Stacks<br/>Applications of stacks<br/>Queues<br/>Implementation of queues<br/>Circular queues<br/>Implementation of a queue using.linked representation<br/>Applications of queues<br/>20 UnkedUsts<br/>The concept of the linked lists<br/>Inserting a node by using recursive programs<br/>Sorting and reversing a linked list<br/>Deleting the specified node in a singly Imked list<br/>Inserting a node after the specified node in a singly linked list<br/>Inserting a new node in a sorted list<br/>Counting the nuniber of nodes of a linked list<br/>Merging of two sorted lists<br/>Erasing a linked list<br/>Polynomial representation<br/>Representation of sparse matrices<br/>Circular linked lists<br/>Splitting a list with 2n nodes into two separate and equal lists<br/>Merging of two circular lists<br/>Reversing the direction of links in a singly linked circular list<br/>Doubly linked lists<br/>Insertion of a node in a doubly linked Ust<br/>Deleting a node from a doubly Imked list<br/>AppUcation of doubly linked lists to memory management<br/>21 Trees<br/>The concept of tree<br/>Binary tree and its representation<br/>Binary tree traversal<br/>^inary search tree<br/>Counting the number of nodes in a binary search tree<br/>Swapping of left and right subtrees of a given binary tree<br/>Searching for a target key in a binary search tree<br/>Deletion of a node from binary search tree<br/>22 Graphs<br/>Graphs<br/>Representations of a graph<br/>Computing indegree and outdegree of a node of a graph using<br/>adjacency matrix representation<br/>Depth-first traversal<br/>Breadth-first traversal<br/>Connected component of a graph<br/>Depth-first spanning tree and breadth-first spanning tree<br/>Minimum-cost spanning tree<br/>Directed acyclic graph (DAG)<br/>Part III: Advanced Problems In Data Structures<br/>23 Problems In Arrays, Searching, Sorting, Hashing<br/>Problem: Calculate the value of an N x N determinant<br/>Problem: Write a program to find the saddle point of a matrix,<br/>if it exists<br/>Problem: Multiply two sparse miatrices<br/>Problem: Multiplication of two sparse matrices (different versions)<br/>Problem: Implement A-way sort-merge to sort a file containing records<br/>Problem: Find a plateau in a matrix<br/>Problem: Implementation of a hash search<br/>Problem: Implementation of rehashing<br/>24 Problems in Stacks and Queues<br/>Problem: Convert an infix expression to prefix form<br/>Problem: Implementation of two stacks using an array<br/>25 Problems in Linked Lists<br/>Problem: Implementation of polynomials using linked lists<br/>Problem: Implementation of circular lists by using arrays<br/>Problem: Reversing links in the case of circular list<br/>Problem: Memory management using lists<br/>Problem: Memory management using various schemes<br/>Problem: Garbage collection—the first method<br/>Problem: Garbage collection—the second method<br/>Problem: Compute N equivalence classes<br/>26 Problems in Strings<br/>Problem: Maximize a combination under constraints<br/>Problem: Maximize a combination of strings—the second method<br/>Problem: Closure of sets<br/>Problem: Finding the maximum matching pattern in the string<br/>Problem: Implementation of the soundex function<br/>27 Problems in Trees<br/>Problem: Write a non-recursive version of preorder<br/>Problem: Write a non-recursive version of postorder<br/>Problem: Preorder traversal of a threaded binary tree<br/>Problem: Implementation of a set using a binary tree<br/>Problem: Huffman coding<br/>Problem: Implementation of a B-tree<br/>Problem: Implementation of a B+ tree<br/>28 Problems in Graphs<br/>Problem: The dfs method for graph traversal<br/>Problem: Connected components in a graph<br/>Problem: Minimum spanning tree<br/>Problem: Topological sort<br/>Problem: Finding the shortest path by using an adjacency matrix<br/>Problem: Finding the shortest path by using an adjacency list<br/>Problem: The m shortest path<br/>Problem: The all-cost shortest path<br/>29 Miscellaneous Problems<br/>Problem: The two-class classification problem<br/>Problem: The iV-coins problem<br/>Problem: All combinations of strings<br/>Problem: The 8-knights problem<br/>Problem: A^-queens problem<br/>Problem: Mapping of N-queues in an array<br/>Problem: Implementation of A* algorithm |
| 650 #0 - SUBJECT | |
| Keyword | C (Computer program language) |
| 650 #0 - SUBJECT | |
| Keyword | Data Structures (Computer science) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 01/06/2016 | 005.1 | P31492 | 11/10/2022 | 08/09/2022 | General Books |