top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Advanced topics in C : core concepts in data structures / / Noel Kalicharan
Advanced topics in C : core concepts in data structures / / Noel Kalicharan
Autore Kalicharan Noel
Edizione [1st ed. 2013.]
Pubbl/distr/stampa New York : , : Apress, , 2013
Descrizione fisica 1 online resource (xviii, 292 pages) : illustrations
Disciplina 0006.312
004
005.133
006.3/12
Collana The expert's voice in C Advanced topics in C
Soggetto topico C (Computer program language)
ISBN 1-4302-6401-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""Advanced Topics in C""; ""Contents at a Glance""; ""Contents""; ""About the Author""; ""About the Technical Reviewer""; ""Preface""; ""Chapter 1: Sorting, Searching, and Merging""; ""1.1 Sorting an Array: Selection Sort""; ""1.1.1 Analysis of Selection Sort""; ""1.2 Sorting an Array: Insertion Sort""; ""1.2.1 Analysis of Insertion Sort""; ""1.3 Inserting an Element in Place""; ""1.4 Sorting an Array of Strings""; ""1.5 Sorting Parallel Arrays""; ""1.6 Binary Search""; ""1.7 Searching an Array of Strings""; ""1.8 Example: Word Frequency Count""; ""1.9 Merging Ordered Lists""
""1.9.1 Implementing the Merge""""Chapter 2: Structures""; ""2.1 Defining Structures""; ""2.2 How to Declare a Structure""; ""2.2.1 typedef""; ""2.3 Working with an Array of Structures""; ""2.4 Searching an Array of Structures""; ""2.5 Sorting an Array of Structures""; ""2.6 How to Read, Search, and Sort a Structure""; ""2.7 Nested Structures""; ""2.8 Working with Fractions""; ""2.8.1 Manipulating Fractions""; ""2.9 A Voting Problem""; ""2.10 Passing Structures to Functions""; ""Chapter 3: Pointers""; ""3.1 Defining Pointers""; ""3.2 Passing Pointers as Arguments""
""3.3 More on Passing an Array as an Argument""""3.4 Character Pointers""; ""3.5 Pointer Arithmetic""; ""3.6 Pointers to Structures""; ""3.7 Pointers to Functions""; ""3.8 Void Pointers""; ""Chapter 4: Linked Lists""; ""4.1 Defining Linked Lists""; ""4.2 Basic Operations on a Linked List""; ""4.2.1 Counting the Nodes in a Linked List""; ""4.2.2 Searching a Linked List""; ""4.2.3 Finding the Last Node in a Linked List""; ""4.3 Dynamic Storage Allocation: malloc, calloc, sizeof, free""; ""4.3.1 malloc""; ""4.3.2 calloc""; ""4.3.3 sizeof""; ""4.3.4 free""
""4.4 Building a Linked List: Adding New Item at the Tail""""4.5 Insertion into a Linked List""; ""4.6 Building a Linked List: Adding a New Item at the Head""; ""4.7 Deletion from a Linked List""; ""4.8 Building a Sorted Linked List""; ""4.9 Example: Palindrome""; ""4.10 Saving a Linked List""; ""4.11 Arrays vs. Linked Lists""; ""4.12 Storing a Linked List Using Arrays""; ""4.13 Merging Two Sorted Linked Lists""; ""4.14 Circular and Two-Way Linked Lists""; ""4.14.1 Circular Lists""; ""4.14.2 Two-Way (Doubly Linked) Lists""; ""Chapter 5: Stacks and Queues""; ""5.1 Abstract Data Types""
""5.2 Stacks""""5.2.1 Implementing a Stack Using an Array""; ""5.2.2 Implementing a Stack Using a Linked List""; ""5.3 Creating a Stack Header File""; ""5.4 A General Stack Type""; ""5.4.1 Example: Convert from Decimal to Binary""; ""5.5 Converting Infix to Postfix""; ""5.5.1 Evaluating a Postfix Expression""; ""5.6 Queues""; ""5.6.1 Implementing a Queue Using an Array""; ""5.6.2 Implementing a Queue Using a Linked List""; ""Chapter 6: Recursion""; ""6.1 Recursive Definition""; ""6.2 Writing Recursive Functions in C""; ""6.3 Converting a Decimal Number to Binary Using Recursion""
""6.4 Printing a Linked List in Reverse Order""
Record Nr. UNINA-9910735400503321
Kalicharan Noel  
New York : , : Apress, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advanced Topics in Java : Core Concepts in Data Structures / / by Noel Kalicharan
Advanced Topics in Java : Core Concepts in Data Structures / / by Noel Kalicharan
Autore Kalicharan Noel
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berkeley, CA : , : Apress : , : Imprint : Apress, , 2014
Descrizione fisica 1 online resource (322 p.)
Disciplina 004
005.2
Collana Expert's Voice in Java
Soggetto topico Java (Computer program language)
Software engineering
Java
Software Engineering/Programming and Operating Systems
ISBN 9781430266204
1430266201
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""Contents at a Glance""; ""Contents""; ""About the Author""; ""About the Technical Reviewers""; ""Preface""; ""Chapter 1: Sorting, Searching, and Merging""; ""1.1 Sorting an Array: Selection Sort""; ""1.1.1 Analysis of Selection Sort""; ""1.2 Sorting an Array: Insertion Sort""; ""1.2.1 Analysis of Insertion Sort""; ""1.3 Inserting an Element in Place""; ""1.4 Sorting a String Array""; ""1.5 Sorting Parallel Arrays""; ""1.6 Binary Search""; ""1.7 Searching an Array of Strings""; ""1.8 Example: Word Frequency Count""; ""1.9 Merging Ordered Lists""; ""1.9.1 Implementing the Merge""
""Chapter 2: Introduction to Objects""""2.1 Objects""; ""2.2 Defining Classes and Creating Objects""; ""2.2.1 Access to Class and Instance Variables""; ""2.2.2 Initializing Class and Instance Variables""; ""2.3 Constructors""; ""2.3.1 Overloading a Constructor""; ""2.4 Data Encapsulation, Accessor, and Mutator Methods""; ""2.4.1 An Improved Constructor""; ""2.4.2 Accessor Methods""; ""2.5 Printing an Object�s Data""; ""2.5.3 Using the toString() Method""; ""2.6.1 Testing the Class Part""; ""2.7 How to Name Your Java Files""; ""2.8 Working with Objects""
""2.8.1 Assigning an Object Variable to Another""""2.8.2 Losing Access to an Object""; ""2.8.3 Comparing Object Variables""; ""2.10 Passing an Object as an Argument""; ""2.11 Array of Objects""; ""2.11.1 Finding the Part with the Lowest Price""; ""2.12 Searching an Array of Objects""; ""2.13 Sorting an Array of Objects""; ""2.15 How to Return More Than One Value: Voting""; ""Chapter 3: Linked Lists""; ""3.1 Defining Linked Lists""; ""3.2 Basic Operations on a Linked List""; ""3.2.1 Counting the Nodes in a Linked List""; ""3.2.2 Searching a Linked List""
""3.2.3 Finding the Last Node in a Linked List""""3.3 Building a Linked List: Adding a New Item at the Tail""; ""3.4 Insertion Into a Linked List""; ""3.5 Building a Linked List: Adding a New Item at the Head""; ""3.6 Deletion from a Linked List""; ""3.7 Building a Sorted Linked List""; ""3.8 A Linked List Class""; ""3.9 How to Organize Java Files""; ""3.10 Expanding the LinkedList Class""; ""3.11 Example: Palindrome""; ""3.12 Saving a Linked List""; ""3.13 Arrays vs. Linked Lists""; ""3.14 Storing a Linked List Using Arrays""; ""3.15 Merging Two Sorted Linked Lists""
""3.16 Circular and Two-Way Linked Lists""""3.16.1 Circular Lists""; ""3.16.2 Two-Way (Doubly Linked) Lists""; ""Chapter 4: Stacks and Queues""; ""4.1 Abstract Data Types""; ""4.2 Stacks""; ""4.2.1 Implementing a Stack Using an Array""; ""4.2.2 Implementing a Stack Using a Linked List""; ""4.3 A General Stack Type""; ""4.3.1 Example: Convert from Decimal to Binary""; ""4.4 How to Convert from Infix to Postfix""; ""4.4.1 Evaluating an Arithmetic Expression""; ""4.5 Queues""; ""4.5.1 Implementing a Queue Using an Array""; ""Chapter 5: Recursion""; ""5.1 Recursive Definition""
""5.2 Writing Recursive Functions in Java""
Altri titoli varianti Core concepts in data structures
Record Nr. UNINA-9910300476403321
Kalicharan Noel  
Berkeley, CA : , : Apress : , : Imprint : Apress, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Julia - bit by bit : programming for beginners / / Noel Kalicharan
Julia - bit by bit : programming for beginners / / Noel Kalicharan
Autore Kalicharan Noel
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (302 pages)
Disciplina 001.642
Collana Undergraduate topics in computer science
Soggetto topico Computer programming
Julia (Computer program language)
ISBN 3-030-73936-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910492144503321
Kalicharan Noel  
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Julia - bit by bit : programming for beginners / / Noel Kalicharan
Julia - bit by bit : programming for beginners / / Noel Kalicharan
Autore Kalicharan Noel
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (302 pages)
Disciplina 001.642
Collana Undergraduate topics in computer science
Soggetto topico Computer programming
Julia (Computer program language)
ISBN 3-030-73936-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996464533303316
Kalicharan Noel  
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Learn to Program with C / / by Noel Kalicharan
Learn to Program with C / / by Noel Kalicharan
Autore Kalicharan Noel
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Berkeley, CA : , : Apress : , : Imprint : Apress, , 2015
Descrizione fisica 1 online resource (323 p.)
Disciplina 004
Collana Expert's Voice in Programming
Soggetto topico Programming languages (Electronic computers)
Computer science
Programming Languages, Compilers, Interpreters
Computer Science, general
ISBN 9781484213711
1484213718
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Elementary Programming Concepts -- 2. C The Basics -- 3. Programs with Sequence Logic -- 4. Programs with Selection Logic -- 5. Programs with Repetition Logic -- 6. Working with Characters and Strings -- 7. Working with Functions -- 8. Working with Arrays -- 9. Working with Structures -- A. Keywords in C -- B. ASCII -- C. Integers -- D. C Compilers.
Record Nr. UNINA-9910300649703321
Kalicharan Noel  
Berkeley, CA : , : Apress : , : Imprint : Apress, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui