zoukankan      html  css  js  c++  java
  • 20162314 Experiment 3

    Experiment report of Besti

    course:《Program Design & Data Structures》

    Class: 1623

    Student Name: Wang, Yixiao

    Student Number:20162314

    Tutor:Mr.Lou、Mr.Wang

    Experiment date:2017.11.6

    Secret level: Unsecretive

    Experiment time:60 minutes

    Major/Elective:Major

    Experiment order:3

    Experiment content

    1. Searching test and Sorting test
    1. Reformat Code
    1. Add searching method and test
    1. Add Sorting method and test

    Experiment situation

    Exp1 Searching test and Sorting test

    • It's easy to finish this experiment.
    • To start with , import to form a new LinkedBinaryTree to start the experiment.
    • Next , use the method GetRight GetLeft to ealuation.
    • Then , new element "ABC".
    • Last , Assert.assertequals();

    Exp2 Reformat Code

    • To start with , use the number to replace "A B C D ....."
    • Next , new newNode
    • Then, creat BinTree to get left child and right child
    • Use three methods preOrderTraverse,inOrderTraverse,postOrderTraverse.

    Exp3 Add searching method and test

    • To start with , creat a class TwentyQuestionsPlayer
    • String the Questions and the answers as the order
    • New them
    • Write a method play(),Yes =Y , No=N .
    • Next , write a function to finish this experiment.

    Exp4 Add Sorting method and test

    Code hosting

    PSP5.1(Personal Software Process)

    Steps Time percent
    requirement 45minutes 16.7%
    design 50minutes 18.5%
    coding 1.5hours 32.2%
    test 30minutes 11.1%
    summary 55minutes 19.2%
  • 相关阅读:
    中断解析
    中断分类
    中断分类
    在iOS开发中使用FMDB
    大数据权限授权管理框架:Apache Sentry和Ranger
    Flink FileSystem的connector分析
    Flink FileSystem的connector分析
    Flink JobManager的HA原理分析
    Flink JobManager的HA原理分析
    Flink的State概述
  • 原文地址:https://www.cnblogs.com/CS162314/p/7806697.html
Copyright © 2011-2022 走看看