Jump to content

Check out our Community Blogs

galileo's Content

There have been 5 items by galileo (Search limited from 26-October 19)

Sort by                Order  

#400984 intro-new programmer

Posted by galileo on 28 October 2008 - 12:06 AM in Introductions

i studied in applied physics, but my dream is some day to find a connection with astrophysics Steve.L, but unfortunately in greece the educational systems and opportunities suck...so after graduation i joined army and after that i was going to leave for germany, to do a master there in automation and robotics...but something went wrong and they didn't accept me for this year, they told me to reconsider my application for the next year...so i stacked in greece in a mastercourse tha thas to with automation but it more programatistic and i work at the same time...sth that is very very difficult!

as for you Xav i posted to a new thread with name:sparse array in pascal.ok?

#400587 intro-new programmer

Posted by galileo on 27 October 2008 - 10:50 AM in Introductions

jordan i need a lot of help unforunately....if you can see my post about sparse array in pascal...if anyone generally can help me, i will be thankful!!!!

#400555 sparce array in pascal-SOS

Posted by galileo on 27 October 2008 - 09:08 AM in Pascal and Delphi

well i found the logic structure of the program in a book of turbo pascal, but it makes the code differently from what i want...in this example it says that we can register a column or a row of a sparse array A[i,j] into a cyclic linked list with one head-element.each head-element has 4 fields:down,head,right,next. down field is used to link the head-element with a column list and right field for its link with a row list.head field is used for the differentiation of the head-elements from the non zero elements of the array.finally next field just links the heads-elements between them.also the head-element for the i-st row may be also head for the j-st column.so the whole number of the heads-elements is max{n,m},n:number of rows, m:number of columns. every other element has besides head field, five more fields:row,column,down,right,value.down field is used for the link with the next non zero element of the same column, while right field is used for the link with the next non zero element of the same row. so if aij=/(:not equal)0 then head-false, value:=A[i,j], row:=i and column:=j,further this element is linked with the cyclic lists of the i-st row and j-st column, so it is common element for 2 different lists. now every head-element belongs to 3 lists; in one row list, one column list and into a list of heads-elements. [this last list has itself head-element that it is used for registering the dimensions of the array(where do we put that list,into the whole array or outside of it???)].[lets mention that a random selected element can be defined by using the head-element A of the list of heads-elements(???didn't understand why)].well except from my these 2questions i got the whole idea...but it's difficult for me to write down the code in one week...and i tried till now very hard...so because besides the master i also work and i don't have tle luxury of much free time,i was wondering if anyone can help me...if i see the code i will understand the theory(the logic) through the commands of pascal...thanx for your time!

#400524 intro-new programmer

Posted by galileo on 27 October 2008 - 06:03 AM in Introductions

hi to everyone...well i just joined the forum...i studied physics in the university of athens in Greece, and now i attend a master course in automation. in physics department i had been barely familiarized with the basics in fortran and pascal, 2 languages that now aren't so popular for programmers...well now in master course i'm obliged for some lessons to make programms in pascal, and c.i just started to learn c,and keep trying to improve my basics in pascal...so i'm going to need a little extra help!;)

#400519 sparce array in pascal-SOS

Posted by galileo on 27 October 2008 - 05:50 AM in Pascal and Delphi

hi to everyone...i would you to help me because i'm a newb in pascal and i have a homework to do till wednesday, thursday i must give the program to my professor...he wants us to write down a code in pascal so as to build a sparce array that we will after use it as base to build a spanning tree...we have already done a single list with one pointer looking the next record in list and after that we put another pointer that looks opposite, so we made a double linked list.now he wants us to make a sparse array only with the non-zero elements that will have lists: for the rows and for the columns and wants 4 pointers in each list up,down,next,previous..we must also make the program in away that recognizes what happens when we have an interception point. for example in the a[i,j] element that is non zero how the element is linked with the i-st row kai j-st column, to include dispose command because he says that we will need it for the spanning tree etc.can anyone send me the code in a txt or pas file, so that i can understand how the program is built???thanx everyone for your time...

Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download