Search

Courseware - Data Structures

  • Representation of numeric data
  • Range, precision, and rounding errors
  • Arrays
  • Representation of character data
  • Strings and string processing
  • Runtime storage management
  • Pointers and references
  • Linked structures
  • Implementation strategies for stacks, queues, and hash tables
  • Implementation strategies for graphs and trees
  • Strategies for choosing the right data structure

 

 

Parallel implementation of Multi-List data structure (spillner)

 

 

  • Profesores
  • Estudiantes
  • courseware
  • CS2
  • data structures
  • Multilist
  • data structure
  • thread safe
  • Parallel algorithm
  • Threading Challenge Contest
  • Pthreads
  • Skip list
  • list
  • Search
  • Strategy
  • board game
  • database
  • java
  • Java threads
  • Desarrollo de juegos
  • Computación en paralelo
  • Adding Local Search Functionality to Your Android* Application

    Introduction

    A basic need required in a wide variety of applications is the search feature. In our case we have a restaurant application and need the user to be able to easily and quickly search the menu for what they want. In this article, I will explain how I added local search capabilities to our existing restaurant application while maintaining UI continuity. I will go into detail about the UI choices I made and why, in addition to going over how to add a GestureOverlayView to the activity.

  • Desarrolladores
  • Android*
  • Android*
  • Search
  • UI
  • Parallel algorithm to Bounded Knapsack Problem (matteocilk.com)

    The included code and solution write-up provides a parallel solution for the bounded knapsack problem, as described in the included problem description text file. The included write-up gives an overview of a branch-and-bound technique (as opposed to a dynamic programming algorithm) to enumerate possible solutions. The three heuristics that are implemented in the code (linear-programming relaxation, minimum-weight heuristic, and dominator heuristic) are described. The algorithm is parallelized using Cilk++ in order to launch recursive search tasks.

    Suscribirse a Search