㻾㼕㼠㼟㼡㼙㼑㼕㼗㼍㼚㻌㼁㼚㼕㼢㼑㼞㼟㼕㼠㼥㻌㻳㼞㼍㼐㼡㼍㼠㼑㻭㼅㻞㻜㻞㻟㻌㻱㼚㼠㼞㼍㼚㼏㼑㻌㻱㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻹㼍㼟㼠㼑㼞㻓㼟㻌㻼㼞㼛㼓㼞㼍㼙㻳㼞㼍㼐㼡㼍㼠㼑㻌㻿㼏㼔㼛㼛㼘㻌㼛㼒㻵㼚㼒㼛㼞㼙㼍㼠㼕㼛㼚㻌㻿㼏㼕㼑㼚㼏㼑㻌㼍㼚㼐㻌㻱㼚㼓㼕㼚㼑㼑㼞㼕㼚㼓㻭㼐㼢㼍㼚㼏㼑㼐㻌㻵㼚㼒㼛㼞㼙㼍㼠㼕㼛㼚㻌㻿㼏㼕㼑㼚㼏㼑㻌㼍㼚㼐㻌㻱㼚㼓㼕㼚㼑㼑㼞㼕㼚㼓㻌㻹㼍㼖㼛㼞㻹㼍㼖㼛㼞㻌㻿㼡㼎㼖㼑㼏㼠㼟㻌䠄㻯㼛㼙㼙㼛㼚㻌㻿㼡㼎㼖㼑㼏㼠㼟䞉㻿㼜㼑㼏㼕㼍㼘㼕㼦㼑㼐㻿㼡㼎㼖㼑㼏㼠㼟䠅㻭㼐㼙㼕㼟㼟㼕㼛㼚㼟㻯㼛㼡㼞㼟㼑

㻱㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㼜㼍㼓㼑㻾㼑㼓㼡㼘㼍㼞㻌㻭㼐㼙㼕㼟㼟㼕㼛㼚㼟䠄㻱㼚㼓㼘㼕㼟㼔㻙㼎㼍㼟㼑㼐㻌㻼㼞㼛㼓㼞㼍㼙䠅㻭㼡㼓㼡㼟㼠

㻼㻚㻌㻝䡚㻲㼑㼎㼞㼡㼍㼞㼥

㻼㻚㻌㻞㻟䡚

㻲㼑㼎㼞㼡㼍㼞㼥
䠄㻿㼑㼜㼠㼑㼙㼎㼑㼞㻌㻞㻜㻞㻠㻱㼚㼞㼛㼘㼘㼙㼑㼚㼠㻕㻶㼡㼘㼥㻵㼚㼠㼑㼞㼚㼍㼠㼕㼛㼚㼍㼘㻌㻿㼠㼡㼐㼑㼚㼠㻌㻭㼐㼙㼕㼟㼟㼕㼛㼚㼟䠄㻱㼚㼓㼘㼕㼟㼔㻙㼎㼍㼟㼑㼐㻌㻼㼞㼛㼓㼞㼍㼙䠅㻵㼚㼒㼛㼞㼙㼍㼠㼕㼛㼚㻿㼏㼕㼑㼚㼏㼑㻌㼍㼚㼐㻱㼚㼓㼕㼚㼑㼑㼞㼕㼚㼓㻺㼛㼠㼑㼟㻼㻚㻌㻞㻟䡚

䠄㻿㼑㼜㼠㼑㼙㼎㼑㼞㻌㻞㻜㻞㻟㻱㼚㼞㼛㼘㼘㼙㼑㼚㼠㻕㻭㼡㼓㼡㼟㼠

㻰㼑㼏㼑㼙㼎㼑㼞

㻶㼡㼘㼥㻵㼚㻙㼁㼚㼕㼢㼑㼞㼟㼕㼠㼥㻌㻭㼐㼢㼍㼚㼏㼑㼙㼑㼚㼠㻌㻭㼐㼙㼕㼟㼟㼕㼛㼚㼟䠄㻱㼚㼓㼘㼕㼟㼔㻙㼎㼍㼟㼑㼐㻌㻼㼞㼛㼓㼞㼍㼙䠅㻲㼑㼎㼞㼡㼍㼞㼥
䠄㻿㼑㼜㼠㼑㼙㼎㼑㼞㻌㻞㻜㻞㻠㻱㼚㼞㼛㼘㼘㼙㼑㼚㼠㻕䛆㻴㼛㼣㻌㼠㼛㻌㼞㼑㼍㼐㻌㼠㼔㼑㻌㼒㼞㼛㼚㼠㻌㼏㼛㼢㼑㼞㻌㼜㼍㼓㼑䛇㽢䈈㼀㼔㼛㼟㼑㻌㼒㼛㼞㻌㼣㼔㼕㼏㼔㻌㼠㼔㼑㻌㼑㼚㼠㼞㼍㼚㼏㼑㻌㼑㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻌㼝㼡㼑㼟㼠㼕㼛㼚㼟㻌㼣㼑㼞㼑㻌㼚㼛㼠㻌㼏㼞㼑㼍㼠㼑㼐㻌㼐㼡㼑㻌㼠㼛㻌㼞㼑㼍㼟㼛㼚㼟㻌㼟㼡㼏㼔㻌㼍㼟㻌㼠㼔㼑㻌㼑㼚㼠㼞㼍㼚㼏㼑䚷䚷䚷㼑㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻌㼚㼛㼠㻌㼎㼑㼕㼚㼓㻌㼏㼛㼚㼐㼡㼏㼠㼑㼐㻘㻌㼛㼞㻌㼠㼔㼛㼟㼑㻌㼒㼛㼞㻌㼣㼔㼕㼏㼔㻌㼠㼔㼑㻌㼑㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻌㼝㼡㼑㼟㼠㼕㼛㼚㼟㻌㼍㼞㼑㻌㼚㼛㼠㻌㼐㼕㼟㼏㼘㼛㼟㼑㼐㻚㻰㼕㼍㼓㼛㼚㼍㼘㻌㼘㼕㼚㼑䈈㼀㼔㼑㻌㼠㼑㼟㼠㻌㼐㼑㼟㼕㼓㼚㼑㼐㻌㼎㼥㻌㼑㼍㼏㼔㻌㼏㼛㼡㼟㼑㻔㼍㻌㼣㼞㼕㼠㼠㼑㼚㻌㼠㼑㼟㼠㻕㻌㼔㼍㼟㻌㼚㼛㼠㻌㼎㼑㼑㼚㻌㼏㼛㼚㼐㼡㼏㼠㼑㼐㻚㻾㼕㼠㼟㼡㼙㼑㼕㼗㼍㼚㻌㼁㼚㼕㼢㼑㼞㼟㼕㼠㼥㻌㻳㼞㼍㼐㼡㼍㼠㼑㻌㻿㼏㼔㼛㼛㼘㻭㼅㻞㻜㻞㻟㻌㻱㼚㼠㼞㼍㼚㼏㼑㻌㻱㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻰㼛㼏㼠㼛㼞㼍㼘㻌㻼㼞㼛㼓㼞㼍㼙㻳㼞㼍㼐㼡㼍㼠㼑㻌㻿㼏㼔㼛㼛㼘㻌㼛㼒㻵㼚㼒㼛㼞㼙㼍㼠㼕㼛㼚㻌㻿㼏㼕㼑㼚㼏㼑㻌㼍㼚㼐㻌㻱㼚㼓㼕㼚㼑㼑㼞㼕㼚㼓㻭㼐㼢㼍㼚㼏㼑㼐㻌㻵㼚㼒㼛㼞㼙㼍㼠㼕㼛㼚㻌㻿㼏㼕㼑㼚㼏㼑㻌㼍㼚㼐㻌㻱㼚㼓㼕㼚㼑㼑㼞㼕㼚㼓㻌㻹㼍㼖㼛㼞㼃㼞㼕㼠㼠㼑㼚㻌㻱㼤㼍㼙㼕㼚㼍㼠㼕㼛㼚㻌㼕㼟㻌㼚㼛㼠㻌㼏㼛㼚㼐㼡㼏㼠㼑㼐㻌㼒㼛㼞㻌㼠㼔㼑㻌㻰㼛㼏㼠㼛㼞㼍㼘㻌㻼㼞㼛㼓㼞㼍㼙㻚公開用 P.1

August 2023 Admissions

AY2024 Examination Questions for the Graduate School ofInformation Science and Engineering, Ritsumeikan University(Master’s Program) Major in Information Science and Engineering
Information Science and Engineering Course࠙ How to answer questionsࠚPlease follow the instructions below and answer the questions.
Choose two questions from the common subjects and choose either the Computer Science sectionor the Human Information Science section.
In case choosing the Computer Science sectio n, answer three questions from question մ ~չ .
In case choosing the Human Information Science section, choose one question either պ  or ջ .
There will be two blank answer sheets in case choosing the Human Information Science section.

CommonSubjects

ձ Linear Algebraղ Probability and Statisticsճ Data Structure and Algorithms
մ Computer Architectureյ Operating Systemն Software Engineering
Computer Science

Specializedշ Computer Networks
ո Databases

Subjects

չ Artificial Intelligence
Human Information Scienceպ Image Processingջ Artificial Intelligence࠙ Examination timeࠚ
9:30-11:30 (120minutes)
ͤ Leaving the examination venue is not allowed during the examination time.
ͤ In case you feel sick or need to go to th e bathroom, let examination supervisors know
by raising your hand.

࠙ Notesࠚ
(1) Use one answer sheet for one question.
(2) Fill out your examination number and name for all the answer sheets. Also, make sureto fill out all the other necessary sections such as the questions number column.
(3) Do not remove the staple of your answer sheets.
(4) Answer sheets with no names will be invalid. Do not take the question sheets andanswer sheets with you after the examination.

公開用 P.2







&RPPRQ6XEMHFWVձ/LQHDU$OJHEUDղ3UREDELOLW\DQG6WDWLVWLFVճ 'DWD6WUXFWXUHDQG$OJRULWKPV













&KRRVHWZRTXHVWLRQVIURPWKHDERYH









公開用 P.3
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjectsձ Linear Algebra
Answer all the questions below with the derivation process.
Question 1. Find the real numbers, , , andin the equation

൅

through three points P ሺ1,3,5ሻ, P ሺ 3,0,1ሻ, and P ሺ6,2, 4ሻ.
Question 2. Solve the following system of equations.
5 ൅4 ൅3 ൌ1
2 ൅ ൌ 11
2
3 ൅
2 ൌ9

Question 3. Answer the following, given(1) Find.

(2) Find.

(3) Find

൅7

3

.

ൌ

1
1

3
.
2

൅

൅

ൌ 0 that represents the plane passing

公開用 P.4
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjectsղ Probability and Statistics
Answer all of the following questions with all calculation processes and ideas.
Question 1. Answer the following questions for two continuous random variables X and Y.
(1) Explain the following statement mathematically.
"Random variables

andare mutually independent".

(2) Explain the following statement mathematically.
"Random variables

andare uncorrelated".

(3) For each of the following statements, if it is correct, prove it.
If not, give one example that follows it and one example that does not.
ձ "If random variables X and Y are mutually independent, they are uncorrelated."ղ "If random variables X and Y are uncorrelated, they are mutually independent."
Question 2. Answer the following questions for two continuous random variables, X and Y, which follow a standard normal
distribution, and are mutually independent.
(1) Find the probability density function of the random variableൌ൅ .

(2) Find the probability density function of the random variableൌ.

(3) Find the probability density function of the random variable

ൌ /

ൌ /

.

公開用 P.5
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjectsճ Data Structure and Algorithm
This section consists of 2 pages. Answer all the questions below.

Question 1.
Figure 1 presents the pseudo-code for an insert function, which is
responsible for adding a given integer value in a binary search tree.
Additionally, it also includes a visit function, which traverses each nodeof the binary search tree and displays the value stored within each node.
In this context, the create() function is utilized to create a node with thegiven value in the binary search tree, while the print() function is
employed to display the stored value in a specific node. The value stored
in the node can be accessed through node.value, and node.left andnode.right correspond to the left child and right child of the node,
respectively. Answer the following questions.
(1) Illustrate the final resulting binary search tree, following the notation
for a binary search tree in Figure 2, created when the sequence S = {3,7, 1, 5} is given to the insert function in order.
(2) Show the order of the values displayed when the node corresponding
to the root of the binary search tree in Figure 2 is given to the visit
function.
(3) The time complexity of the insert function depends on the order of the

1: function insert(Node node, int key):2:

if node = null thenreturn create(key)

3:
4:

end

5:

else if key < node.key then6:

node.left

insert(node.left, key)

7:

end

8:

else if key > node.key then9:10:

node.rightinsert(node.right, key)end

11: end13:
14: function visit(Node node):15:

if node != null then16:

print(node.key)

17:

visit(node.left)

18:
19:

visit(node.right)
end

10: endFigure 1: Pseudo-codes related to a binary
search tree

data in the given sequence. Answer the best-case and worst-case time5complexities for any data in order notation using the number of datan.
3(4) Rotation is a proposed operation to convert the tree structure so thatthe difference in height between the left and right subtrees of all nodes

2

6
4

in a binary search tree is within 1. Illustrate the binary search tree
obtained by making a single rotation to the right of the root for thebinary search tree in Figure 2.













1

Figure 2: An example of a binary search tree

公開用 P.6
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
Question 2.
Given an array A that contains n integer values, answer the following questions regarding the algorithm for sorting in ascendingorder according to steps 1 to 3. The array has n elements, and each element at the i-th index can be referenced as A[i], where iranges from 0 to n-1.
Step 1: Repeat Steps 2 and 3 for i = 0 to n-1
Step 2: Find the index p of the element with the smallest value among A[i], … , A[n-1]Step 3: Swap A[i] with A[p](1) Illustrate the entire process of sorting the array A = {3, 4, 2, 1}.
(2) Answer the name of this algorithm.
(3) Answer average-case and worst-case time complexities for any array in order notation using the number of elements n.
(4) When sorting data with two or more elements that have the same value, a sorting algorithm that preserves the order of theelements before and after sorting is called stable sort. Answer “yes” if this algorithm is a stable sort, and “no” otherwise.
(5) Answer a name of the sorting algorithm that has a lower worst-case time complexity than this algorithm.

公開用 P.7







6SHFLDOL]HG6XEMHFWV&RPSXWHU6FLHQFHմ&RPSXWHU$UFKLWHFWXUHյ2SHUDWLQJ6\VWHP
ն6RIWZDUH(QJLQHHULQJ
շ&RPSXWHU1HWZRUNVո'DWDEDVHV
չ$UWLILFLDO,QWHOOLJHQFH














,QFDVHFKRRVLQJWKH&RPSXWHU6FLHQFH
VHFWLRQDQVZHUWKUHHTXHVWLRQVIURPTXHVWLRQմ㹼չ公開用 P.8
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceմ Computer Architecture
Answer all the questions below.
Question.

7DEOH

Answer the following questions about a RISC
processor.

,QVWUXFWLRQ$VVHPEO\&RGLQJ

)XQFWLRQDOLW\

Here, ISE2023, in the following$''$''5G5V5W

5G 5V5W

questions, is a fictitious RISC processor.

$'',$'',5G5VLPP

5G 5VLPP

%1(%1(5VODEHO%UDQFKWRODEHOLI5V /,/,5GLPP

5G LPPISE2023 has general-purpose registers R1 to R2,
and has the instruction set shown in Table 1. In
the table, “Rd”, “Rs”, and “Rt” are arbitrary

registers among R1 to R2, “imm” is an immediate operand (signed integer), and “label” is a label pointing to an address ofarbitrary instruction word.
(1) Briefly describe the relationship between the initial value of R1 and the obtained valuein R2 in the program given by the assembly code for ISE2023 shown in Fig. 1. Here,
we assume that the initial value of R1 is a positive integer and that no overflow occurs
during the calculation.

%(*,1/,5
/223$''555$'',55
%1(5/223
(1'(2) Find the number of cycles required to execute the program in Fig. 1 and the CPI (cycles)LJ

per instruction) for this case (Find the CPI down to one decimal place). Here, the numberof cycles required for the BNE instruction is always four, and that needed for every other
instruction is one. Let the initial value of R1 be ten.
(3) Find the number of required cycles and the CPI value when the program in Fig. 2 is
executed under the same conditions as (2).
(4) State the condition of the initial value of R1 with which the same result as the programin Fig. 1 can be obtained with the program in Fig. 2.
(5) What is it called when the program in Fig. 1 is replaced with the program in Fig. 2?

%(*,1/,5
/223$''555$'',55
$''555$'',55
%1(5/223
(1'
)LJ

公開用 P.9
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceյ Operating System
Answer all the questions related to virtual memory below.
Question 1.
Explain what virtual memory is and describe its possible merits.
Question 2.
Suppose two processes are running on different virtual address spaces and they would exchange some data. Describe a method
related to address spaces to achieve this, and also describe why this method is not needed when different threads that belong to
the same process exchange data.
Question 3.
Let us translate a 4-byte virtual address in base 16, 0x1234ABCD, into the corresponding physical address. The first 3 bytes are
the block number, and the last 1 byte is the offset. Describe the process of this translation, including which part is done by software
and which part is done by hardware. Note that we assume a single-layer structure for the address translation table. If you needsome additional values that are not written in the question, you may assume they are arbitrary.

公開用 P.10
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceն Software Engineering
Answer all the questions below.
Question 1. Explain the shortcomings of the waterfall model.
Question 2. Explain the difference between stubs and drivers in software testing.
Question 3. Explain the difference between branch coverage and conditional coverage in software testing.
Question 4. Explain message passing in object-oriented programming.

公開用 P.11
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceշ Computer Networks
Answer all the questions below.
Question 1.
Using Dijkstra’s algorithm, find the shortest path for routing packets from node A to every other node in the network below.
The number near the link denotes the distance for the link. Complete the table below, showing each step of the algorithm. In thesecond column of the table, write the shortest path set S of nodes to which the algorithm has the shortest path and (destinationnode, next node, distance). Here, the destination node is the new node in the shortest path set, the next node is the next-hop
node from node A to reach the destination node, and the distance is the shortest path distance from node A to the destination
node.

Step

S, (Destination node, predecessor, distance)

1

S={A}, (A, -, 0)2

S={A,B}, (B,A,1)

3
4
5
6
7

Question 2.
For each description regarding computer networks, in the answer sheet write T if it is true and F if it is false.
(1) In the DNS, the record which specifies a mail server to handle a domain's email is called an NS record.
(2) One weakness in Link State (LS) routing algorithms is the "count-to-infinity" problem.
(3) Every datalink layer protocol requires a MAC channel access protocol.
(4) One new feature supported in IPv6, but not IPv4, is IP fragmentation.
(5) On the Internet, each Autonomous System (AS) communicates with other ASs using BGP.
(6) A bridge is a link-layer (layer 2) device.
(7) Cyclic Redundancy Check (CRC) is a powerful error correction code.
(8) The Routing Information Protocol (RIP) uses the Bellman-Ford algorithm.
(9) DHCP is an application-layer protocol.
(10) 10.13.159.125 is a private IP address.

公開用 P.12
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceո Databases
This section consists of 2 pages. Answer all the questions below.
Question 1. For the following explanations on database design, choose the most appropriate word from the choice list and answer
with the symbols shown as letters [A] – [L].

Note that some unrelated options are included.

Assume that when the same

number is enclosed in the box, the answer corresponds to the same letter.
Database design is done in the following process:1st stage(1): We identify the purpose of the database, the business information targeted by the database, and we extract andorganize the
2nd stage(2)(3)

from users.
schema design: We describe the information structure of the database, assuming an ideal future information

system and database, independently of the data model and schema used in the actual database.
3rd stage(4)

schema design: We describe a(4)schema which is the(4)

structure of the informationneeded to build a database in the database management system we use.
4th stage(5)

schema design: We describe the(5)structures required to store and manage the database data.

Choice list
[A] conceptual definition[B] requirement definition [C] purpose[D] requirement[E] work[F] knowledge[G] requirement[H] conceptual[I] database[J] logical[K] information[L] physical
Question 2. Select all among the following (a) – (f) that have a functional dependency between the attributes of the relation R
consisting of the 6 tuples.
   Relation R
X

Y

Z

10

AAA

4

10

AAA

4

20

BBB

2

20

BBB

2

30

BBB

6

30

BBB

6





D

X Ѝ Y

E

X Ѝ Z

F

Y Ѝ Z

G

Y Ѝ X

H

Z Ѝ X

I

Z Ѝ Y

公開用 P.13
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
Question 3. Describe the result of the join operation P
P
A

B

-1

1

0

3

1

2

C

D

E

2

3

1

2

2

4

3

3

4

Q





 3 %&4

 3 % '4

B<C Q and P



B=D Q for the two relations P and Q below.

公開用 P.14
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Scienceչ Artificial IntelligenceThis section consists of 2 pages. Answer all the questions below.
Question. For the following explanations of Artificial Intelligence (AI) from (i) to (v), choose the most suitable word or number
for the boxes (1) to (15) from the options shown below each explanation and answer with the symbols shown in alphabetic letters.
Note that some unrelated options are included. Assume that when the same number is enclosed in the box, the answer corresponds
to the same letter.
(i) Consider three algorithms, the optimal search (Dijkstra’s algorithm), the best-first search, and the A* algorithm, that solve
the shortest path problem from an initial node to a destination node. These algorithms have different criteria for sorting thenodes to be explored in order to determine the next node to be explored. Letandሺ ሻbe the sum of the costs on the optimalሺ ሻ be the sum of the costs on the optimal path from node

path from the initial node to node ,to the destination node,ሺ ሻሺൌ ሺ ሻ ൅ ሺ ሻሻ be the cost of the optimal path through node . In this case, the nodes to be explored are sorted

in order of decreasing  (1) 

in the optimal search,   (2) 

in the best-first search, and   (3) 

A* algorithm. Note that the symbol ^ denotes an estimated value and, for example,

in theሺ ሻ denotes the estimated value offunction ሺ ሻ.
࠙Options for (i)ࠚ
a

ሺ ሻ

b

ሺ ሻ

c

ሺ ሻሺൌ ሺ ሻ ൅ ሺ ሻሻ

d

ሺ ሻ

ሺ ሻ

e

ሺ ሻ

f

ሺ ሻ

g

ሺ ሻሺൌ ሺ ሻ ൅ ሺ ሻሻ

h

ሺ ሻ

ሺ ሻ

(ii) Consider using dynamic programming to find the edit distance between two strings. In this case, the edit distance to thesubstrings of the target strings is  (4) 

for recording and used in the following calculations. The edit distance fromstring "abebc" to string "babbe" is   (5) , and the number of "replace" operations in this edit operation is  (6)  . Note that the edit distance is the minimum number of editing operations required to transform one string into
the other, with each editing operation being the insertion, deletion, or replacement of one character.
࠙Options for (ii)ࠚ
a

0

b

1

c

2

d 3

e

4

f

memorizedgmaximizedhdecentralized公開用 P.15
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
(iii) Clustering is the classification of a collection of data into several groups according to the similarity between the data, and iscategorized as   (7) 

in machine learning. In the   (8)   , one of the deterministic clustering methods,

classification is performed by repeatedly classifying data based on the distance to each cluster representative point andupdating the coordinates of each cluster representative point. In this method, the objective function, expressed as the sum of
the squared distances between each cluster representative point and the data belonging to that cluster, is  (9)  , sothat eventually the classification into each cluster will not change.
࠙Options for (iii)ࠚ
amonotonically decreasingb

monotonically increasingcgenerative modeldunsupervised learningesupervised learningfreinforcement learningg

k-means methodhEM algorithm(iv) Q-learning is a reinforcement learning technique that estimates the value of   (10) 

as a Q value. In the updating

equation in Q learning, the Q value is updated to the value of the product of   (11) 
current Q value. The   (11) 

learning to make the value of   (11)   (11) 

and   (12) 

plus thederives from the non-convergence of the Q values during learning so Q-learning iscloser to 0. The   (12) 

represents the degree of reflection of thein the Q value and the momentum of approaching the equilibrium state.

࠙Options for (iv)ࠚ
aleast-squares errorbTemporal Difference errorcstate-value function

d optimal action-value functioneBellman equationf

rewardglearning rate

h discount rate(v) Given a premise by a formulaand a conclusion by a formulabe   (13) . Then, ൓

the   (15) 

to the clause set of ൓from the two clauses  (14) 

and

൓

b

൓

, consider proving

is satisfied, andൌሺሻ. That is,proves to be   (13) 

and deriving an empty clause. Note that the   (15) 
for literalis to obtain.

࠙Options for (v)ࠚ
൓

a
e



൓

f

resolution principle

proves toby repeatedly applyingctautology

d contradictiongunificationhclause form

公開用 P.16







6SHFLDOL]HG6XEMHFWV+XPDQ,QIRUPDWLRQ6FLHQFHպ,PDJH3URFHVVLQJջ$UWLILFLDO,QWHOOLJHQFH













,Q FDVH FKRRVLQJ WKH +XPDQ,QIRUPDWLRQ 6FLHQFH VHFWLRQ FKRRVH
RQHTXHVWLRQHLWKHUպRUջ
公開用 P.17
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University
Human Information Scienceպ Image Processing
This section consists of 4 pages. Answer all the questions below.
Question 1.
(1) By using the tone curve in Figure 1, perform a pixel-wise tone mapping. When the pixel values of the input image are , which description is most appropriate for the output image?
distributed throughout the range ‫ۑ‬
Figure㸯࠙Optionsࠚ
(a). The intensity histogram of the output image is flattened.
(b). The blur of the input image is restored in the output image.
(c). The output image becomes brighter than the input image.
(d). The output image has higher contrast than the input image.
(e). The edges of the input image are enhanced in the output image.

(2) When a 3x3 pixel median filter is applied to the input image in Figure 2, what will be the output value corresponding to the
pixels within the thick border in Figure 2?
                 Figure 2
࠙OptionsࠚD 

E 

F 

G 

H 

公開用 P.18
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 4 pages.
Question 2.
To transform the parallelogram shown in Figure 3 into a square with side length 1 as shown in Figure 4, which coordinates should
be used? Let's denote the coordinates before the transformation as ሺ , ሻ and the coordinates after the transformation as ሺ , ሻ.


Figure 3

ሻ

ൌ
ൌ

1


Figure 4

ሻ

ൌ
ൌ

൅



ሻ

ൌ
ൌ



ሻ

ൌ
ൌ

1
൅



Question 3.
In the image

ሺx, yሻ, the density values at coordinates ሺ1, 1ሻ, ሺ1, 2ሻ, ሺ1, 3ሻ, ሺ2, 1ሻ, ሺ2, 2ሻ, ሺ2, 3ሻ, ሺ3, 1ሻ, ሺ3, 2ሻ, ሺ3, 3ሻ are

ሺ1, 1ሻ ൌ 50  ሺ1, 2ሻ ൌ 60  ሺ1, 3ሻ ൌ 70  ሺ2, 1ሻ ൌ 80  ሺ2, 2ሻ ൌ 90  ሺ2, 3ሻ ൌ 100  ሺ3, 1ሻ ൌ 110  ሺ3, 2ሻ ൌ120 ሺ3, 3ሻ ൌ 130. Calculate the values ofሺ1.3, 1.6ሻ using the nearest neighbor and bilinear interpolation methods. 公開用 P.19
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 4 pages.
Question 4.
ሺ1ሻ A 2D Fourier transform was performed on the image shown in Figure 5. Which one of the following options in theanswer group represents the resulting power spectrum? In the power spectrum, the center represents the DC component,
and the higher values are represented by whiter areas.

Figure 5࠙Answer groupࠚ

D 

E 

F 

G 

H 

公開用 P.20
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 4 pages.
ሺ2ሻ Apply a 2D Fourier transform to the image in Figure 6 and obtain the power spectrum. Next, using the mask shown in
Figure 7, preserve only the non-central part of this power spectrum. Which one of the following images in the answer
group represents the resulting image obtained by inverse Fourier transforming the preserved power spectrum? Please
note that the options provided represent the black rectangular waveframe surrounding the images and not the actual
result of the inverse Fourier transform.


Figure 6
Figure 7࠙Answer groupࠚ




D 

E 


F 


G 

公開用 P.21
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University
Human Information Scienceջ Artificial IntelligenceThis section consists of 2 pages. Answer all the questions below.
Question 1.
Consider the following graph:

Perform a depth-first search on this graph starting from node A, with priority given to the left side. Among the following sevensteps, fill in the open list and the closed list at Step 4 and Step 7.
6WHS

2SHQ/LVW

&ORVHG/LVW



>$@

>@















D 

E 















F 

G 

Question 2.
A store sells only two types of laptops, X and Y. A certain ratio of both types is known to be defective. The probability that alaptop purchased at the same store is defective is 0.125 when the laptop is of type X. Which of the following choices is correct?
(a) The ratio of X sold in the same store is 0.8, the defective ratio of X is 0.4, and the defective ratio of Y is 0.7.
(b) The ratio of X sold in the same store is 0.6, the defective ratio of X is 0.4, and the defective ratio of Y is 0.7.
(c) The ratio of X sold in the same store is 0.4, the defective ratio of X is 0.4, and the defective ratio of Y is 0.7.
(d) The ratio of X sold in the same store is 0.2, the defective ratio of X is 0.4, and the defective ratio of Y is 0.7.
(e) The ratio of X sold in the same store is 0.1, the defective ratio of X is 0.4, and the defective ratio of Y is 0.7.

公開用 P.22
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
Question 3.
Answer the words or phrases suitable for the following blanks.
ձ In the K-means method, data are assigned to the  nearest(a)cluster, and thenthe representative(b)point of each cluster

is updated.
ղ The Bellman equation in reinforcement learning defines the state value ofand the value ofthe current(c) statewith only the next reward(d)state.
the next

ճ In the steepest descent method (or gradient method), the parameters are modified by calculating
the error function so that the error becomes

smaller and(f)smaller.

the partial
derivative(e)of公開用 P.23

February 2024 Admissions

AY2024 Examination Questions for the Graduate School ofInformation Science and Engineering, Ritsumeikan University(Master’s Program) Major in Information Science and Engineering
Information Science and Engineering Course࠙ How to answer questionsࠚPlease follow the instructions below and answer the questions.
1) Choose two questi ons from question ձ ~ճ for Common Subjects.
2) Choose either the Computer Science section or the Human Information Science section forSpecialized Subjects.
࣭ In case choosing the Computer Science sectio n, answer three questions from question մ ~չ .
࣭ In case choosing the Human Information Science section, choose one question either պ orջ .
* T h e r e wi l l b e t wo b l a n k a n s we r s h e e t s i n c a s e c h o o s i n g t h e Hu m a n I n f o r m a t i o n S c i e n c e s e c t i o n .

CommonSubjects

ձ Linear Algebraղ Probability and Statisticsճ Data Structure and Algorithms
մ Computer Architectureյ Operating System
Computer Science

Specializedն Software Engineeringշ Computer Networks
ո Databases

Subjects

չ Artificial Intelligence
Human Information Scienceպ Image Processingջ Artificial Intelligence࠙ Examination timeࠚ
9:30-11:30 (120minutes)
ͤ L e a v i n g t h e e x a m i n a t i o n v e n u e i s n o t a l l o we d d u r i n g t h e e x a m i n a t i o n t i m e .
ͤ I n c a s e y o u f e e l s i c k o r n e e d t o g o t o t h e b a t h r o o m , l e t e x a m i n a t i o n s u p e r v i s o r s kn o w b y r a i s i n g y o u rhand.

࠙ Notesࠚ
(1) Use one answer sheet for one question.
(2) Fill out your examination number and name for all the answer sheets. Also, make sureto fill out all the other necessary sections such as the questions number column.
(3) Do not remove the staple of your answer sheets.
(4) Answer sheets with no names will be invalid. Do not take the question sheets andanswer sheets with you after the examination.

公開用 P.24







&RPPRQ6XEMHFWVձ/LQHDU$OJHEUDղ3UREDELOLW\DQG6WDWLVWLFVճ 'DWD6WUXFWXUHDQG$OJRULWKPV













&KRRVHWZRTXHVWLRQVIURPWKHDERYH









公開用 P.25
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjects ձ Linear Algebra
Answer all the questions below with the derivation process.
Question 1. Find the point P that internally divides the line segment XY connecting points Xሺ4, 1,3ሻ and Yሺ2,0, 5ሻ in theratio 2: 3, and the point Q that externally divides it.
Question 2. When four points Aሺ3, 2,5ሻ, Bሺ 3, 2,1ሻ, Cሺ0,2, 4ሻ, and Dሺ1,1,0ሻ are given, answer the following questions.
(1) Find the cross product AB ൈ AC.
(2) Find the real numbers, , , and

൅in the equation൅൅

ൌ 0 that represents the plane passing through threepoints A, B, and C.
(3) Calculate the area of triangle ABC.
(4) Calculate the volume of tetrahedron ABCD.
Question 3. When the matrices

and

(0 ൏

are given, find the integer
ൌ

1

1
2 1

1
,
1

ൌ

1
2

3
1

൏ 30) that satisfies
1
3



ൌ

.

公開用 P.26
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjects ղ Probability and Statistics
Answer all of the following questions. Provide detailed explanations of all calculations and thought processes.
ሺ , ሻ of two continuous random variables

Question 1. Given the joint probability density function
ሺ , ሻൌ
(with(1) Find

ሺ ൅ ሻ
2

exp

ሺ

ሻ
2

and as

൐ 0 ൐ 0), answer the following questions.
ሺ ሻൌ, and determine the marginal distributions
ሺYou may use

ሻ

ൌ

ሺ , ሻ

ሺ |

ሺ , ሻ



ሺ | ൌ ሻ(3) Show the condition under which two general random variables
probability density function

ሺ ሻൌ



(2) Find the conditional probability density function(4) Determine the condition for

and

and

are independent using the conditionalሻൌwhere the random variables

Question 2. For a Poisson distribution with parameterand are independent.

,ሺ ൌ ሻൌ

!

,answer the following questions.
(1) Find the mean of the Poisson distribution.
(2) Find the variance of the Poisson distribution.
(3) Assume that a population following a Poisson distribution yields 10 independent samples
log-likelihood function(4) Find the value ofሺ ሻ using

,

,

,



that maximizes the log-likelihood functionሺ ሻ from (3).

,

,

,

 Express the公開用 P.27
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityCommon Subjects ճData Structure and Algorithm
Answer all the questions below.
Question 1. Fig. 1 shows an example of a connected directed graphൌ ሺ , ሻ, where the circle indicates vertices and the numberin the circle indicates its vertex number. Fig. 2 shows the pseudocode for the breadth first search (BFS) algorithm from a vertex
of a connected directed graph. Assume any graph G’ with | | ൌ

and | | ൌ

. Answer the following questions(1)-(5).

1

1: function BFS(G, s):

2

3

4




5



Fig. 1: Example of directed graph

6
.

2:

create an empty queue Q

3:mark vertex s as visited

4:

ENQUEUE(Q, s)

5:while Q is not empty

6:u

DEQUEUE(Q)7:

for each adj vertex v of vertex u do



8:



9:

mark vertex v as visited

10:

ENQUEUE(Q, v)

if v is not visited themFig. 2: Pseudocode of a Breadth First Search (BFS).

(1) When graph’ is represented using an adjacency matrix, answer the time complexity required to determine whether two

vertices are adjacent, in order notation.
(2) When graphis represented using an adjacency list, answer the space complexity in order notation.

(3) Given a graphin Fig. 1 and a vertex 1 asin the algorithm of BFS in Fig. 2, shows the order of all visited vertices,

starting from 1. Order the adjacent vertices of each vertex according to increasing vertex number.
(4) Given any graph G’ in the algorithm of BFS in Fig. 2, answer space complexity of the queue Q in order notation.
(5) Briefly answer what needs to be changed in the processing regarding the queue when the pseudocode in Fig. 2 is changed tothe depth first search (DFS) algorithm.
Question 2. Answer the most appropriate word or equation in the following blanks [ (1) ] to [ (10) ] regarding sort algorithms.
When sorting data consisting oftime complexity ofelements, if the range of numbers to be sorted is known in advance, fast algorithms with aሺ ሻ, such as a [ (1) ], can be used. On the other hand, “selection sort”, “merge sort”, and “quick sort” aremore general sorting algorithms. When sorting in ascending order, the selection sort repeats the processes of selecting the elementwith [ (2) ] from the unsorted part of the data and swapping it with the first element of the unsorted part, and has average andworst-case time complexities of([ (4) ]). Merge sort works by recursively dividing data into two parts, and merging the divided

element while sorting each other sorting, and has an average-case time complexity ofof([ (5) ]) and a worst-case time complexity([ (6) ]). Quick sort recursively repeats the process of dividing the data based on a criterion called [ (7) ], and has an average-case time complexity of([ (8) ]) and a worst-case time complexity ofstable and unstable, merge sort is a [ (10) ] sort.

([ (9) ]). When sorting algorithms are distinguished as公開用 P.28







6SHFLDOL]HG6XEMHFWV&RPSXWHU6FLHQFHմ&RPSXWHU$UFKLWHFWXUHյ2SHUDWLQJ6\VWHP
ն6RIWZDUH(QJLQHHULQJ
շ&RPSXWHU1HWZRUNVո'DWDEDVHV
չ$UWLILFLDO,QWHOOLJHQFH














,QFDVHFKRRVLQJWKH&RPSXWHU6FLHQFH
VHFWLRQDQVZHUWKUHHTXHVWLRQVIURPTXHVWLRQմ㹼չ公開用 P.29
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science մ Computer Architecture
Answer all the questions below.
In the following, "ADD $1, $2, $3" means an instruction that adds the values stored in Register 2 and Register 3, and stores theresult of the addition into Register 1.
Question 1.
Consider the execution of the following four instruction sequences: i1, i2, i3, and i4.
i1: ADD $1, $2, $3
i2: ADD $4, $1, $5
i3: ADD $6, $3, $5
i4: ADD $7, $5, $6
Explain which instructions are executed during each clock cycle for both out-of-order execution and in-order execution of thefour instructions above in a CPU capable of executing two ADD instructions simultaneously in one clock cycle.
Question 2.
Consider the execution of the following five instruction sequences: i1, i2, i3, i4, and i5, in a CPU capable of executing two ADD
instructions simultaneously in one clock cycle. If two ADD instructions can be executed in one clock cycle, all executions should
be completed within three clock cycles. However, we cannot complete the following five instruction sequences in three clock
cycles. Explain the reason.
i1: ADD $1, $9, $3
i2: ADD $3, $1, $2
i3: ADD $5, $3, $7
i4: ADD $3, $9, $8
i5: ADD $4, $3, $2
Question 3.
As a method to resolve the situation in Question 2, there is a technique called “register renaming.” Explain how register renaming
allows for the parallel execution of the five instructions in Question 2.











公開用 P.30
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science յ Operating System
When a program is started, it is managed by the OS as a process. Moreover, it is executed with transitions of some states dependingon the program code and in relation to other processes. Answer all the questions below about the state transitions of this process:
Question 1.
Explain what kind of states a process can have.
Question 2.
Explain under what circumstances the state of process transitions occur using a state transition diagram.

公開用 P.31
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science ն Software Engineering
Answer all the questions below.
Question 1.
Software development processes include the waterfall model and evolutionary prototyping. Describe the differences between
them from the perspective of managing the risk of not being able to define requirements specifications completely at the initialdevelopment phase.
Question 2.
Explain the module strength (or cohesion), which is a criterion for measuring module independence.
Question 3.
Describe why a “stub” is needed in top-down integration testing.
Question 4.
Describe the advantages of introducing version control as a software development practice.

公開用 P.32
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science շ Computer Networks
Answer all the questions below.
Question 1.
The routing tables for routers X, Y, and Z in the network below were constructed using the distance vector algorithm. Please
complete the three routing tables below. Write the answers in the answer sheet.

Question 2.
An image, characterized by a resolution of 5120×2880 pixels (5K) and employing true color (utilizing 3 Bytes per pixel for color
information), is subjected to transmission over a 2.5 Gb/s Ethernet connection. What is the duration required for the transmissionof the uncompressed image?
Question 3.
For the descriptions regarding computer networks, write T if it is true or F if it is false in the answer sheet.
(1) Ethernet is a LAN, so it is placed in the second layer of the OSI reference model.
(2) UDP provides connectionless service and delivers packets quickly. In case of packet loss, UDP does not provide
retransmission.
(3) DNS performs the translation of a hostname to its corresponding MAC address.
(4) UDP is preferred over TCP for real-time transmission of voice over IP networks.
(5) Framing is an essential requirement in frequency division multiplexing.
(6) Circuit switching networks require signaling and control for establishing circuits.
(7) One of the ways to reduce transmission delay is to use a higher-speed transmission system.
(8) With longer frames or shorter propagation time, higher utilization (efficiency) can be achieved in Ethernet LANs.
(9) HTTP (Hyper Text Transfer Protocol) operates on top of UDP.
(10) In a bus topology, each station on the network is interconnected with two other stations, forming a loop or ring.

公開用 P.33
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science ո Databases
This section consists of 2 pages. Answer all the questions below.
Question 1.
Relation “sales” in the first normal form is as shown below, and the primary key is {slip_num, product_code}.
sales (slip_num, store_ID, store_name, store_address, sales_date, product_code, product_name, unit_price, quantity, subtotal)
In this relationship, the following partial functional dependencies exist.
{slip_num}Ѝ{store_ID, store_name, store_address, sales_date}{product_code}Ѝ{product_name, unit_price}Show the normalization results of this relation into second normal form and underline key attributes.

Question 2.
Describe the definitions that apply to [A] and [B] in the following description about database failure recovery, and answer thequestions below (1) and (2).
Database failure recovery is performed using checkpoints and logs. The DBMS can cancel operations on transactions that could
not be committed due to a failure. This process of using logs to return to the state before the start of the transaction is called [A].
7ransactions committed from the checkpoint to the time of failure are reproduced by reflecting the processing written in the log
in the data. This kind of processing is called [B].

(1) List all transactions that require processing A in the diagram above.
(2) List all transactions that require processing B in the diagram above.
公開用 P.34
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
Question 3.
Write the following queries (1) and (2) in SQL regarding the following relational tables ‘Student’ and ‘Student club’.
Relation: Student
stu_NO

name

sex

GPA

dep_num

1001

Hiromi Yasuda

women

3.3

3

1002

Katsumi Kimura

men

4.1

1

1003

Shinji Sakurai

men

4.3

2

1004

Takashi Irie

men

3.2

3

1005

Shinichi Tamura

men

3.7

1

1006

Noriko Ichikawa

women

3.4

2

Relation: Student club
stu_NO

student_club_name joining_date1001

tea ceremony

2023-4-1

1003

football2022-4-1

1005

golf

2023-10-1

1006

table tennis

2022-5-1(1) Output the department numberand highest GPA for each department in order of department number.
(2) Output the names of students who have belonged to student clubs since April 2023 and the names of the student club they
belong to.
公開用 P.35
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan UniversityComputer Science չ Artificial IntelligenceThis question consists of 2 pages. Answer all the questions below.
Question. For the following explanations of Artificial Intelligence (AI) from (i) to (v), choose the most suitable word or number
for the boxes (1) to (15) from the options shown below each explanation, and answer with the symbols shown in alphabetic letters.
Note that some unrelated options are included. Assume that the same word is enclosed in the box with the same number.
(i) All comments are classified as either positive or negative content, and we consider using a   (1) 
whether a given comment is positive or negative. The   (1) 

is a classifier based on a   (2) 

to determine. It assumes

that there is no interdependence or correlation in the generation of words, and classifies documents based on Bayes' theorem.
The occurrence probabilities of the three words in each type of content are shown in Table 1, and the occurrence of eachword is assumed to be independent of each other. When positive content is posted with probability 0.6, the probability thata comment containing "recommend" and "performance" and not containing "return" is positive is  (3) .

Table 1: The occurrence probabilities of the three words“recommend”“return”“performance”

Positive content

0.70

0.10

0.50

Negative content

0.30

0.25

0.40

࠙Options for (i)ࠚ
a

SVM

b

naive Bayes filtercdiscriminative modeldprobabilistic generative modelen-gram model

f

0.189

g

0.652

h

0.840

(ii) A game in which the sum of the players' payoffs is zero is called a   (4) . Table 2 shows a payoff matrix for thatgame, and the values in the table are the payoffs of Player 1. A strategy where a player assumes that they will only receive
the minimum possible payoff for their actions and, among these, choose the action that maximizes their own payoff is called  (5) . If Player 1 follows this strategy, Player 1 chooses action  (6) 

in the game shown in Table 2.

Table 2㸸Payoff matrix
Player 2

Player 1











4

3

3



1

5

2



3

2

4

࠙Options for (ii)ࠚ
ae

minimax strategybfmaximin strategycgextensive-form gamedNash gamehzero-sum game

公開用 P.36
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This question consists of 2 pages.
(iii) Letbe the state at time ,be the action taken at time ,be the result of the observation at time , andሺ ሻ

at time . In this case, the Bayesian filter, an algorithm for self-location estimation,

be the probability that the state is

performs the following calculation at each time . Fill in the blanks in the formula.
1.

For all, calculateሺ ሻ  ሺ7ሻ 

2.

For all, calculate

ሺ ሻ

ሺ ሻ/

Also, the process performed in 2. is  (9)   ሺ8ሻ ሺሻ, andሺ ሻ,.

࠙Options for (iii)ࠚ
a

ሺ ሻ

e

ሺ |

ሻ

,

(iv)   (10) 

b

ሺ | ሻ

c

ሺ | ሻ

d

ሺ |

ሻ

f

Generalizationg

ResamplinghNormalization

are widely used neural networks in image recognition. In   (10)  , the pooling layer plays a role in

reducing the dimensions of the input vector. Additionally,   (11)  are neural networks that can learn to predict output
values for sequential data arranged in time by having internal variables that retain contextual information. In the learning
process of   (11)  , there is a method called  (12) , which is an extension of the backpropagation methodthat unfolds in the time direction.
࠙Options for (iv)ࠚ
aWard’s methodbkernel methodc

BPTT method

d recurrent neural networksek-means clustering

f

BERT

g

simple perceptron

h convolutional neural networks(v) In natural language processing, the division of sentences into their smallest grammatical units and the estimation of parts ofspeech is called  (13) 
language is called  (14) , and the process of analyzing grammatical structures according to the grammar of a given. In  (14) 

based on context-free grammar, assuming phrase structure grammar,

the results of the analysis are represented in a structure known as a  (15) .

࠙Options for (v)ࠚamorphological analysisb

syntactic analysiscsemantic analysisdcontext analysiseontologyfsyntactic treegword latticehsemantic network公開用 P.37







6SHFLDOL]HG6XEMHFWV+XPDQ,QIRUPDWLRQ6FLHQFHպ,PDJH3URFHVVLQJջ$UWLILFLDO,QWHOOLJHQFH













,Q FDVH FKRRVLQJ WKH +XPDQ,QIRUPDWLRQ 6FLHQFH VHFWLRQ FKRRVH
RQHTXHVWLRQHLWKHUպRUջ
公開用 P.38
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University
Human Information Science պ Image Processing
This section consists of 2 pages. Answer all the questions below.
Question 1.
 40

 60

 50

 70

is a 2 by 2 image, where the coordinates of the 4 pixels are (0,0),(1,0),(0,1),(1,1) and the pixel values are I(0,0)=40,
I(1,0)=60, I(0,1)=50, I(1,1)=70. Determine the subpixel value I(0.3,0.6) by bilinear interpolation.

Question 2.
ሺ ሻൌ ሺ

ሻexpሺ

ሻ is the first derivative of a Gaussian function, where A is a positive integer. We are to design a digital filter

representing this function F(x), where each point has a filter value of 8 bits ranging from -128 to 127.
(1) Determine the coordinate x1 for the point which has the maximal value of F.
(2) Determine the coordinate x2 for the point which has the minimal value of F.
(3) Determine A as an integer.
(4) Determine U as an integer where (2U+1) is the filter size.
For your convenience, exp(-1/2)Ҹ0.6, exp(-2)Ҹ0.135 , exp(-9/2)Ҹ0.0111, exp(-8)Ҹ0.0003.

Question 3.
The figure shows a parallel stereo, where the distance between the two cameras is 100mm, and the point on the left image (500pixels,100 pixels) corresponds to the point on the right image (300 pixels,100 pixels). Determine X, Y and Z. It is known that inparallel stereo, axis u and axis u’ are collinear and parallel to axis X, and axis v and axis v’ are parallel to axis Y. The origin of (u,v)
is on the Z axis, and two cameras have exactly the same intrinsic parameters and f =1000 pixels.

    

公開用 P.39
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University* This section consists of 2 pages.
Question 4.
After rotating the image clockwise by 60 degrees as shown in the figure, it is further translated by 30 in horizontal direction and -10
in the vertical direction. The new coordinates can be expressed by    ൌDetermine a, b, c, d, e and f.

     ൅公開用 P.40
Master’s Program, Information Science and Engineering Course,
Graduate School of Information Science and Engineering,
Ritsumeikan University
Human Information Science ջ Artificial Intelligence
Answer all the questions below.
as follows. Cluster them using the k-means method with k=3.

(1) There are seven data points inൌ ሼሺ0,0ሻ, ሺ0,1ሻ, ሺ0,2ሻ, ሺ3,0ሻ, ሺ6,0ሻ, ሺ6,1ሻ, ሺ6,2ሻሽ
With the initial set of centroidsasൌ ሼሺ0,4ሻ, ሺ3,0ሻ, ሺ6,4ሻሽ

perform the k-means clustering until convergence and show the entire process. Regarding the process, show the changes in thecoordinates of the centroids at each step, and the allocation of each data point to the clusters.

(2) Find the Skolem normal form of the following predicate logic formula and represent it in clause set form.
ሾ ሺ ሻሺ , ሻሿ

൓ሺ

ሾ ሺ ሻ

ሺ ሻሿሻ

(3)
(3-1) Explain the difference between Nash equilibrium and dominant strategy equilibrium in game theory.
(3-2) What is a Gaussian Mixture Model (GMM)? Explain.
(3-3) What is an n-gram model in natural language processing? Explain it with an example.
(3-4) Explain the differences between supervised learning, reinforcement learning, and unsupervised learning.