Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged aggregator

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Islam TeCNo

COUNT (Transact-SQL) - 0 views

msdn.microsoft.com/...ms175997.aspx

shared by Islam TeCNo on 10 Jun 09 - Cached
  • COUNT(*) returns the number of items in a group. This includes NULL values and duplicates. COUNT(ALL expression) evaluates expression for each row in a group and returns the number of nonnull values. COUNT(DISTINCT expression) evaluates expression for each row in a group and returns the number of unique, nonnull values.
    • Abdelrahman Ogail
      Abdelrahman Ogail on 10 Jun 09
       
      Count Function is a Mathematical Aggregation Function. Many forms of it appreas below
    • Islam TeCNo
      Islam TeCNo on 10 Jun 09
       
      ana fahem el kalam eli maktoub :D bas mesh fahm el bo2en eli enta katbhom dol :D
    • Abdelrahman Ogail
      Abdelrahman Ogail on 10 Jun 09
       
      In Relational Algebra and Set Theory COUNT is a type of function called Aggregation Function that is applied to an attribute (databse column) and results in one value
    • Islam TeCNo
      Islam TeCNo on 10 Jun 09
       
      ahaaaa ...thanks ZiKaS
Islam TeCNo

Design and Analysis of Computer Algorithms - 0 views

www.personal.kent.edu/...algorithm.html

shared by Islam TeCNo on 09 Jun 09 - Cached
Islam TeCNo liked it
  • Dijkstra's Algorithm
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      Algorithm for finding shortest path is graph
  • Huffman's Codes
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      used in data compression
  • Ahmed Mansour on 09 Jun 09
     
    recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !
  • Ahmed Mansour on 09 Jun 09
     
    this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !
  • Islam TeCNo on 09 Jun 09
     
    Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks
Janos Haits

Meet the bright web - beam - 0 views

www.beamapp.co

web beam software service generator tool metasearch tools reference search engine browser web evolution internet socialnetworking aggregator technology

shared by Janos Haits on 11 Jun 24 - No Cached
  • Janos Haits on 11 Jun 24
     
    "Sync & End-to-End Encryption Your content is securely end-to-end encrypted and only you can access it."
1 - 3 of 3
Showing 20▼ items per page