Şimdi Ara

İngilizce Vb soruları Türkçeye çevirme yardım(Vb)

Daha Fazla
Bu Konudaki Kullanıcılar: Daha Az
2 Misafir Kullanıcı, 2 Masaüstü Kullanıcı
1
Cevap
0
Favori
381
Tıklama
Tüm Forumlar >> Web Tasarım - Programlama >> Yazılım Geliştirme >> Delphi / C++ /Vb >> İngilizce Vb soruları Türkçeye çevirme yardım(Vb)
Sayfaya Git:
Sayfa:
1
Giriş
Mesaj
  • Er
    2 Mesaj
    Merhaba arkadaşlar elimde VB.net soruları var fakat sorular İngilizce olduğu için tam olarak anlayamadım,teknik terimler oldugu için İnglizce forumlarına yazmadım belki bana sorularda neler istendiğini yazabilecek biriler vardır,umarım doğru yere açmışımdır başlığı
    1. Write statements to accomplish each of the following tasks:
    a. Display the value of the seventh element of array numbers.


    b. Initialize each of the five elements of one-dimensional Integer array val to 10.

    c. Total the 100 elements of floating-point array acm.

    d. Copy 11-element array sarray into the first portion of 34-element array scopy.



    e. Determine the smallest and largest values contained in 99-element floating-point array dataarray.

    2. Write a program which will find the frequecy of an array element . Assume a(10)={1,2,1,3,4,1,3,4,2,5} is declared. The frequency of any value is the number of appreance of that value. For example frequency of 1 is 3, 2 is 2, 3 is 2, 4 is 2 and 5 is 1.


    3. Write a program which uses two dimensional arrays to add and subtract two 3 x 3 matrices. A 3 x3 matrix has three of rows and three columns.


    4. The value of sin(x) can also be approximated by the series
    sin⁡〖x=x-x^3/3!+x^5/5!-x^7/7!+⋯〗
    The accuracy of this approximation increases as the number of terms in the series increases. In principle, the summation results in an exact answer when number of terms becomes infinite. As a practical matter, the summation is usually sufficiently accurate for five or six terms. To calculate the approximate value of sin x, use the first six terms of the given series.
    a. Write a function which will calculate the factorial of a given integer.

    b. Write a function which will calculate the nth power of a number. Do not use ^ operator.


    c. Use the functions in sections a and b to write a program which calculates the approximate value of sin x.

    1. Write statements to accomplish each of the following tasks:
    a. Define an integer type array which has 10 elements. Initialize its elements to zero.

    Dim b() As Integer = New Integer(9) {}

    b. Define a double type two dimensional array which has 8 elements. Initialize its elements to first eight positive integers .



    c. Write a code to sum the elements of a one dimensional array. Take length of the array as n.


    2. Write a program which will find the frequecy of an array element . Assume a(10)={1,2,1,3,4,1,3,4,2,5} is declared. The frequency of any value is the number of appreance of that value. For example frequency of 1 is 3, 2 is 2, 3 is 2, 4 is 2 and 5 is 1.



    3. The basic algorithm for a one-dimensional array of values is as follows:
    a) Partitioning Step: Take the first element of the unsorted array and determine its final location
    in the sorted array (i.e., all values to the left of the element in the array are less than
    the element, and all values to the right of the element in the array are greater than the element).
    We now have one element in its proper location and two unsorted subarrays.
    b) Recursive Step: Perform step 1 on each unsorted subarray.
    Each time step 1 is performed on a subarray, another element is placed in its final location of the
    sorted array, and two unsorted subarrays are created. When a subarray consists of one element, it
    must be sorted; therefore, that element is in its final location.
    The basic algorithm seems simple, but how do we determine the final position of the first element
    of each subarray? Consider the following set of values (the element in bold is the partitioning
    element—it will be placed in its final location in the sorted array):
    37 2 6 4 89 8 10 12 68 45
    a) Starting from the rightmost element of the array, compare each element to 37 until an element
    less than 37 is found, then swap 37 and that element. The first element less than 37 is 12, so 37 and 12 are swapped. The new array is
    12 2 6 4 89 8 10 37 68 45
    Element 12 is italicized to indicate that it was just swapped with 37.
    b) Starting from the left of the array, but beginning with the element after 12, compare each
    element to 37 until an element greater than 37 is found, then swap 37 and that element.
    The first element greater than 37 is 89, so 37 and 89 are swapped. The new array is
    12 2 6 4 37 8 10 89 68 45
    c) Starting from the right, but beginning with the element before 89, compare each element
    to 37 until an element less than 37 is found, then swap 37 and that element. The first element
    less than 37 is 10, so 37 and 10 are swapped. The new array is
    12 2 6 4 10 8 37 89 68 45
    d) Starting from the left, but beginning with the element after 10, compare each element to
    37 until an element greater than 37 is found, then swap 37 and that element. There are no
    more elements greater than 37, so when we compare 37 to itself, we know that 37 has
    been placed in its final location of the sorted array.
    Once the partition has been applied to the above array, there are two unsorted subarrays. The subarray
    with values less than 37 contains 12, 2, 6, 4, 10 and 8. The subarray with values greater than 37 contains 89, 68 and 45. The sort continues with both subarrays being partitioned in the same manner
    as the original array.
    Using the preceding discussion, write a procedure QuickSort to sort a one-dimensional
    Integer array. The procedure should receive as arguments an Integer array, a starting
    index and an ending index. Procedure Partition should be called by QuickSort to perform the
    partitioning step.



    |
    |
    _____________________________




HızlıCevap
Sayfaya Git:
Sayfa:
1
Reklamlar
haberler
Bey Azura
SEO
üniversite
Bu sayfanın
Mobil sürümü
Mini Sürümü

DHBR1
0,266
1.2.165

Reklamlar
- x
Bildirim
mesajınız kopyalandı (ctrl+v) yapıştırmak istediğiniz yere yapıştırabilirsiniz.