반응형 전체 글200 AP Computer Science A [FRQ] Practice (2) AP Computer Science A [FRQ] Practice (2) FRQ Question 1 notice To succeed on the FRQ Question 2 on Classes, you must know how to: -Create a class using public class Classname { } -Write a constructor with the same name as the class and no return type. This constructor will probably have a parameter that is assigned to an instance variable and will need to assign default values to the other insta.. 2024. 4. 4. AP Computer Science A [FRQ] Practice (1) AP Computer Science A [FRQ] Practice (1) FRQ Question 1 notice FRQ Question 1 on Control Structures will probably involve: -a for-loop that probably uses the method’s parameter variables, -an if statement, probably inside the loop, -calls to other class methods given to you, -a numerical or string value that is calculated by the loop and returned at the end of the method. -if the question has 2 .. 2024. 4. 4. [자바기초.030] Sorting Algorithms [자바기초.030] Sorting Algorithms 데이터를 정렬하는 알고리즘은 아주 많습니다. 이곳에서 다룰 정렬 알고리즘은 Selection, Insertion, Merge 정렬 알고리즘 입니다. 1.Selection Sort 선택 정렬(selection sort)은 제자리 정렬 알고리즘의 하나로, 다음과 같은 순서로 이루어진다. 1.주어진 리스트 중에 최소값을 찾는다. 2.그 값을 맨 앞에 위치한 값과 교체한다(패스(pass)). 3.맨 처음 위치를 뺀 나머지 리스트를 같은 방법으로 교체한다. n개의 주어진 데이터를 이와 같은 방법으로 정렬하는 데에는 Θ(n^2) 만큼의 시간이 걸린다.(이중 for문) 좀 더 자세히 설명하면, Selection Sort(선택 정렬)는 첫 번째 데이터를 두 번째 데.. 2024. 3. 30. [자바기초.029]Searching Algorithms [자바기초.029]Searching Algorithms 1.Search Algorithm 컴퓨터는 많은 양의 데이터를 메모리에 저장하고 원하는 데이터를 빠르게 찾아내는 역할을 합니다. 그 중에서 데이터를 찾아내는 일을 "탐색(Searching)"이라고 말합니다. 가장 대표적인 Searching 방법인 Sequential(Linear) Search와 Binary Search 알고리즘에 대해 알아봅시다. 2.Sequential Search(Linear Search) Sequential Search = Linear Search = 순차 탐색 Sequential Search는 데이터를 처음부터 끝까지 차례대로 비교하여 원하는 데이터를 찾아내는 알고리즘 입니다. Sequential Search는 정렬되지 않은 데.. 2024. 3. 30. APCSA Mock Test APCSA Mock Test -Mock Test (1) link: https://vo.la/vlsqd -Mock Test (2) link: https://vo.la/bHyeQ -Mock Test (3) link: https://vo.la/cWnxf -Mock Test (4) link: https://vo.la/IkCne -Mock Test (5) link: https://vo.la/NhlYl -Mock Test (6) link: https://vo.la/XUvSl (Timed test below;) -Mock Test (7) link: https://vo.la/LPIuq -Mock Test (8) link: https://vo.la/axuCw -Mock Test (9) link: https://vo.la.. 2024. 3. 29. [자바AP연습문제] 10.Recursion [자바AP연습문제] 10.Recursion *10.Recursion 단원의 복습내용은 아래 "더보기" 클릭 더보기 In this unit you learned about recursion. A recursive method calls itself (contains a call to the method from inside of the method). A recursive method should have at least one way to stop the recursion. This is called a base case. base case - A way to stop the recursive calls. This is a return without a recursive call. call stack -.. 2024. 3. 29. [자바AP연습문제] 09.Inheritance [자바AP연습문제] 09.Inheritance *09.Inheritance 단원의 복습내용은 아래 "더보기" 클릭 더보기 In this chapter you learned about inheritance. In an object-oriented program you write classes that define what objects of each class know (instance variables) and can do (methods). One class can inherit object instance variables and methods from another, which makes the amount of code that you have to write smaller and makes th.. 2024. 3. 29. [자바AP연습문제]08.2D Arrays [자바AP연습문제] 08. 2D Arrays *08.2D Arryas 단원의 복습내용은 아래 "더보기" 클릭 더보기 In this chapter you learned about two dimensional arrays. A two dimensional array stores objects in a 2d table. You can think of it as storing objects in rows and columns, but it actually uses an array of arrays to store the objects as shown below. In this chapter you learned how to declare 2d arrays, create them, and access array .. 2024. 3. 29. [자바AP연습문제] 07.ArrayList [자바AP연습문제] 07.ArrayList *07.ArrayList 단원의 복습내용은 아래 "더보기" 클릭 더보기 In this chapter you learned about ArrayLists which are dynamic re-sizable arrays. You learned how to declare and create ArrayLists, add and remove objects from them, set the object at an index, and get the object at an index. List are like arrays in that you can store many objects of the same type in a list, just as you can in an ar.. 2024. 3. 29. 이전 1 2 3 4 5 ··· 23 다음 728x90 반응형
