Nesneye y$$nelik programlama $-$dev $2$

Ders kitab$$n$$n b$$l$$m sonu sorular$$ndan olan a$$a$$daki sorular$$zen Visual Studio $2022$ Community

Edition $($VS$22$CE$)$ uygulamalarin geli$$tiriniz$.$

$$deve $$zel kriterler

$6\mathrm{.}23$ ve $8\mathrm{.}19$ projeleri konsol uygulamasi olarak geli$$tirilmelidir$.$

$7\mathrm{.}35$ projesini form tabanl GUI uygulamas olarak geli$$tirilmelidir$.$ Grafiksel uygulamada veri giri$$i

formdan al$$nmal$$ ve $$kt$$ form $$zerinde g$$sterilmelidir$.$

Genel $$dev kriterleri

Odevler grup halinde yap$$acaktir ve gruptan tek bir ki$$inin grup numaras isminde bir zip dosyas$$

y$$klemesi gerekmektedir $($rnek: $2$ numaral grup $2.$zip dosyas$$ y$$klemelidir$).$ Birden fazla

y$$kleme olmas durumunda t$$m grup $$yeleri ilgili $$devden $0$ notunu alacakt$$r$.$

$$devierin VS$22$CE ortam$$nda yaz$$lmas$$ gerekmektedir.

$$devdeki her bir soru ayr$$ VS$22$CE projesi olarak ger$$ekle$$tirilmelidir$.$rnek olarak $1.$devinizde

$4$ soru sorulmu$$tur $(3\mathrm{.}28,4\mathrm{.}12,5\mathrm{.}37$ ve $5\mathrm{.}38).$ Bu nedenle siras$$yla ilgili sorulara kar$$ilik gelen

"Proje$1",$ "Proje$2",$ "Proje$3"$ ve "Proje$4"$ isminde d$$rt VS$22$CE projesi tek ZlP dosyasinda

birle$$tirilerek teslim edilmelidir. Proje isimlerinin Proje$<mi></mi>$D$>$ format$$nda oldu$$una dikkat ediniz.

EBYS'ye y$$klenen ZiP dosyas$$ a$$ld$$nda ortaya $$ikan VS$22$CE proje dizinleri herhangi bir ekstra

i$$leme gerek olmadan VS$22$CE'de $$al$$t$$r$$labilmelidir$.$ Bu $$ekilde $$ali$$t$$nlamayan projeler $0$ notu

alacaktir.

$$dev de$$erlendirmelerinin Windows bir makinada yap$$laca$$ g$$z $$n$$ne al$$nmal$$dir$.$ Projelerin

g$$nderilmeden $$nce Windows kurulu bir bilgisayarda $$al$$t$$rlarak denenmesi gereklidir.

$$devlerde ge$$ teslim m$$mk$$n de$$idir$.$ Edestek sistemi belirtilen son teslim zaman$$nda $$dev

y$$klemeyi otomatik olarak kapatacaktur.

$$devlerin ger$$ekle$$tiriminde ChatGPT gibi yapay zek$$ ara$$lar$$ kesinlikle kullan$$mamal$$dir$.6\mathrm{.}23($Displaying a Diamond$)$ Write an app that displays the following diamond shape. You may use output statements that display a single asterisk $(*),$ a single space or a single newline character. Maximize your use of iteration $($with nested for statements$)$ and minimize the number of output statements.

$7\mathrm{.}35($Recursive Sum Calculation$)$ Write recursive method SunofDigits$($number$)$ that, when called, returns the sum of digits of the number passed.

For example, SumOfDigits$(234)\backslash (=2+3+4\backslash ).$ Assume that the number entered is greater than or equal to $10$ but less than or equal to $99,999.$ The recursive step should use the relationship

$(($number$\backslash \%10)+$ SumOfDigits$($number$/10)).$

The terminating condition occurs when the number is less than $10.$ Incorporate this method into an app that enables the user to enter the number.

$8\mathrm{.}19($Airline Reservations System$)$ A small airline has just purchased a computer for its new automated reservations system. You have been asked to develop the new system. You're to write an app to assign seats on each flight of the airline's only plane $($capacity: $10$ seats$).$

Display the following alternatives: Please type $1$ for First Class and Please type $2$ for Economy. If the user types $1,$ your app should assign a seat in the first$-$class section $($seats $1-5).$ If the user types $2,$ your app should assign a seat in the economy section $($seats $6-10).$

Use a one$-$dimensional array of type bool to represent the seating chart of the plane. Initialize all the elements of the array to false to indicate that all the seats are empty. As each seat is assigned, set the corresponding element of the array to true to indicate that the seat is no longer available.

Your app should never assign a seat that has already been assigned. When the economy section is full, your app should ask the person if it's acceptable to be placed in the first$-$class section $($and vice versa$).$ If yes, make the appropriate seat assignment. If no$,$ display the message "Next flight leaves in $3$ hours."