4주차 Discussion

[chloe-codes1]

📢 책을 읽으면서 궁금한 점들을 자유롭게 적고 대답해주세요

4주차 진행 방식

1. 복습: 2.1 문제 풀어오기 - 1 ~ 8, 10, 12 (10문제)
2. 진도: 2.2까지 읽어오고 정리 & 의견 나누기
3. 미래 정하기: 2.2 에서 풀 문제 정하기

[iborymagic]

function make_segment(p1, p2) {
  return pair(p1, p2);
}

function start_segment(segment) {
  return head(segment);
}

function end_segment(segment) {
  return tail(segment);
}

function make_point(x, y) {
  return pair(x, y);
}

function x_point(point) {
  return head(point);
}

function y_point() {
  return tail(point);
}

function midpoint_segment(p1, p2) {
  return make_point(
    x_point(start_segment(p1)) + x_point(end_segment(p2)) / 2,
    y_point(start_segment(p1)) + y_point(end_segment(p2)) / 2
  );
}

[hanana1253]

// 2.2

// 2.2-1

function make_segment(startPoint, endPoint) {
  return pair(startPoint, endPoint);
}

function start_segment(segment) {
  return head(segment);
}
function end_segment(segment) {
  return tail(segment);
}

// 2.2-2

function make_point(x, y) {
  return pair(x, y);
}

function x_point(point) {
  return head(point);
}

function y_point(point) {
  return tail(point);
}

// 2.2-3

function midpoint_segment(segment) {
  return make_point(
    (x_point(start_segment(segment)) + x_point(end_segment(segment))) / 2,
    (y_point(start_segment(segment)) + y_point(end_segment(segment))) / 2
  );
}

[chloe-codes1]

2.03

2.02의 선분을 고려하지 않고 푼 문제

function makeRectangle(height, width) {
  return {
    height,
    width,
  };
}

function getPerimeter(rect) {
  return 2 * (rect.width + rect.height);
}

function getArea(rect) {
  return rect.width * rect.height;
}

[thgr8ganzi]

// 2.5
// pair
function pairCons(a, b) {
    return Math.pow(2, a) * Math.pow(3, b);
}
// head
function headCar(x) {
    function headCarIter(x, count) {
        if (x % 2 === 0) {
            return headCarIter(x / 2, count + 1);
        } else {
            return count;
        }
    }
    return headCarIter(x, 0);
}
// tail
function tailCdr(x) {
    function tailCdrIter(x, count) {
        if (x % 3 === 0) {
            return tailCdrIter(x / 3, count + 1);
        } else {
            return count;
        }
    }
    return tailCdrIter(x, 0);
}
console.log(pairCons(2, 3));
console.log(headCar(pairCons(2, 3)));
console.log(tailCdr(pairCons(2, ### ### 3)));