Jump to content
uniGUI Discussion Forums


uniGUI Subscriber
  • Content Count

  • Joined

  • Last visited

  • Days Won


epos4u last won the day on October 25 2018

epos4u had the most liked content!

Community Reputation

96 Excellent

About epos4u

  • Rank
    Advanced Member

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. epos4u


    Eid Mubarak UniGui Family
  2. epos4u

    send sms

    the attachment is still there, please correct your email log in, as you might not be able to download !!
  3. epos4u

    UniGUI Theme Pack Update Package (-x30)

    Thank you
  4. epos4u

    Ramadan Mubarak

    Ramadan Mubarak to all UniGui Family
  5. epos4u

    Version 1498 is not present in customer portal ?

    Please wait, Farshad will be uploading soon, should be up within the hour
  6. epos4u

    Binary search tree

    thanks, but need to hard code it using BST with code
  7. Hi UniGui family, any one with experience of BST search, can you help an old man with this, want to do this in UniGui and then have a chart to display result. thank you T1. Run empirical studies to compute the average length of a path to a random node in a BST (Binary Search Tree) built by insertion of N random keys into an initially empty tree, for N from 100 to 10,000. Do 1,000 trials for each tree size; (a) For a given tree size N,build a BST by insertion of N random keys; e.g., randomly shuffle numbers of 0 to N − 1 and insert them into an (initially empty) BST. (b) Randomly pick a node in the BST; e.g., randomly pick a number between 0 and N − 1. (c) Compute the length of a path to the node, i.e., the number of compare’s carried out while searching the node in the BST. (d) Repeat Step 1b and 1c for 1,000 trials and get the average number of compare’s. Plot the results with the horizontal axis representing treesize N and the vertical axis representing(average) number of compare’s; The plotting can be done using any external software such as spreadsheets. T2. Run similar empirical studies to compute the average number of compare's in Binary Search with an (sorted) array. Note that this has nothing to do with inserting sorted data into a BST. Plot the results. T3. Compare those plots from T1and T2; e.g., overlay the plots together. Discuss whether one could draw a conclusion that the search with BST is more efficient than Binary Search with an (sorted) array or the other way around, etc.
  8. epos4u

    Old man needs help

    hi, its for a course i am doing just in java only lol, not allowed to use delphi or unigui
  9. epos4u

    Old man needs help

    all sorted now
  10. epos4u

    System crashes

    it seems like your running a pirated version!!!!
  11. Thank you for quick reply fredmontier
  12. fredmontier thank you, tried this with mobile log form, how do i put the unimHTMLFrame in the background, it covers my panel and buttons
  13. epos4u

    Screen examples of you're application designs

    Amazing work zemorango simply awesome
  14. epos4u


    i have i3 and mine runs fairly fast, maybe something wrong with windows on your machine
  15. epos4u

    GMap Component

    download is working for latest version, just tested it