Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question
Problem 1
Write a function
count 123 : int list -> int * int * int
that takes in an int list 1 and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in 1. For example, count123 [3; 4;2;1;3]
= (1,1,2), and
count123 [4; 4; 1; 2; 1]
(2,1,0).
In [] let count 123 1 =
(* YOUR CODE HERE *)
In [ ]: assert (count123 [3; 4; 2; 1;3]
=
=
(1,1,2))
expand button
Transcribed Image Text:Problem 1 Write a function count 123 : int list -> int * int * int that takes in an int list 1 and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in 1. For example, count123 [3; 4;2;1;3] = (1,1,2), and count123 [4; 4; 1; 2; 1] (2,1,0). In [] let count 123 1 = (* YOUR CODE HERE *) In [ ]: assert (count123 [3; 4; 2; 1;3] = = (1,1,2))
Expert Solution
Check Mark
Still need help?
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Could you implement this in OCAML:

Here's the question again: 

Write a function: count123:intlist->int*int*int

that takes in an int list l and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in l. For example, count123 [3;4;2;1;3] = (1,1,2), and count123 [4;4;1;2;1] = (2,1,0).

In [ ]:
letcount123l=(* YOUR CODE HERE *)
In [ ]:
assert (count123 [3;4;2;1;3] = (1,1,2)).
 
The code in Python is in the attached image, which needs to be implemented in OCAML.
Thanks!
count123.py > ...
1 def count123(1st):
NP
2
3
4
5
6
7
8
9
10
11
SE
one_count = 0
two_count = 0
three_count
for i in 1st:
if i == 1:
elif i
= 0
one_count += 1
2:
two_count += 1
elif i
12
13
14
15
16
17
print(count123([3,4,2,1,3]))
18
19 print(count123([4,4,1,2,1]))
20
3:
three_count += 1
return (one_count, two_count, three_count)
86 A 90 Live Share
==
Ln 20, Col 1 Spaces: 4 UTF-8 CRLF {Python
3.10.4 64-bit
B.
M
N
Go Live Q
expand button
Transcribed Image Text:count123.py > ... 1 def count123(1st): NP 2 3 4 5 6 7 8 9 10 11 SE one_count = 0 two_count = 0 three_count for i in 1st: if i == 1: elif i = 0 one_count += 1 2: two_count += 1 elif i 12 13 14 15 16 17 print(count123([3,4,2,1,3])) 18 19 print(count123([4,4,1,2,1])) 20 3: three_count += 1 return (one_count, two_count, three_count) 86 A 90 Live Share == Ln 20, Col 1 Spaces: 4 UTF-8 CRLF {Python 3.10.4 64-bit B. M N Go Live Q
Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Could you implement this in OCAML:

Here's the question again: 

Write a function: count123:intlist->int*int*int

that takes in an int list l and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in l. For example, count123 [3;4;2;1;3] = (1,1,2), and count123 [4;4;1;2;1] = (2,1,0).

In [ ]:
letcount123l=(* YOUR CODE HERE *)
In [ ]:
assert (count123 [3;4;2;1;3] = (1,1,2)).
 
The code in Python is in the attached image, which needs to be implemented in OCAML.
Thanks!
count123.py > ...
1 def count123(1st):
NP
2
3
4
5
6
7
8
9
10
11
SE
one_count = 0
two_count = 0
three_count
for i in 1st:
if i == 1:
elif i
= 0
one_count += 1
2:
two_count += 1
elif i
12
13
14
15
16
17
print(count123([3,4,2,1,3]))
18
19 print(count123([4,4,1,2,1]))
20
3:
three_count += 1
return (one_count, two_count, three_count)
86 A 90 Live Share
==
Ln 20, Col 1 Spaces: 4 UTF-8 CRLF {Python
3.10.4 64-bit
B.
M
N
Go Live Q
expand button
Transcribed Image Text:count123.py > ... 1 def count123(1st): NP 2 3 4 5 6 7 8 9 10 11 SE one_count = 0 two_count = 0 three_count for i in 1st: if i == 1: elif i = 0 one_count += 1 2: two_count += 1 elif i 12 13 14 15 16 17 print(count123([3,4,2,1,3])) 18 19 print(count123([4,4,1,2,1])) 20 3: three_count += 1 return (one_count, two_count, three_count) 86 A 90 Live Share == Ln 20, Col 1 Spaces: 4 UTF-8 CRLF {Python 3.10.4 64-bit B. M N Go Live Q
Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education