rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Learning JavaScript Data Structures and Algorithms
  name:
    name part: Groner, Loiane
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Safari, an O'Reilly Media Company
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: xx
    date issued: 2014
    edition: 1st edition.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (218 pages)
  abstract: Understand and implement classic data structures and algorithms using JavaScript In Detail A data structure is a particular way of organizing data in a computer to utilize resources efficiently. Data structures and algorithms are the base of every solution to any programming problem. This book begins by covering the basics of the JavaScript language and then moves on to discuss the most important data structures such as array, queue, stack, and linked list. You will also gain an in-depth knowledge of how hash tables and set data structure function. After this, you will be taught what trees are, and how to use the binary tree and the binary search tree. In subsequent chapters, you will learn about graphs, DFS, and BFS. Finally, we will round off by learning how to differentiate between various searching and sorting algorithms such as sequential search, binary search, quick sort, bubble sort, and so on, and how to implement them. Towards the end of the book, you will also be introduced to dynamic programming. What You Will Learn Declare, initialize, add, and remove items from arrays, stacks, and queues Create and use the most complex data structure, graphs, along with DFS and BFS algorithms Grasp the power of linked lists, doubly linked lists, and circular linked lists Store unique elements with hash tables, dictionaries, and sets Explore the applications of binary trees and binary search trees Sort data structures using bubble sort, selection sort, insertion sort, merge sort, and quick sort Search elements in data structures using sequential sort and binary search Understand the importance of big O notation, dynamic programming, and greedy algorithms
  note: Groner, Loiane.
  note: Electronic resource.
  note: Electronic reproduction. Boston, MA : Safari, Available via World Wide Web.
  note: Mode of access: World Wide Web.
  identifier: 9781783554874
  identifier: 9781783554881
  identifier: https://proxy.library.tamu.edu/login
  record info:
    record creation date: 281014
    record change date: 20260129164759.9
    record identifier: in00004250757