20162314 Experiment 1: Linear structure - experiment report.
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.9.26
Secret level: Unsecretive
Experiment time:60 minutes
Major/Elective:Major
Experiment order:5
Experiment content
- Linear-list test of Java :Process, Problem.
- Linear-list application of Java :Process, Problem.
- Implement ArrayList(Pseudocode, Productcode, Testcode): Process(Analysis, Design,implement,test),Problem.
- Implement LinkedList (Pseudocode, Productcode, Testcode): Process(Analysis, Design,implement,test),Problem.
- Analyze source code of ArrayList and LinkedList:Process,Skill.
Experiment situation
Exp1 Linear-list test of Java
- It's easy to finish this experiment.
- To start with , import to form a new Linked-list to start the experiment.
- Next , use the method list.add() to ealuation.
- Then , use the for-loop to test the Linked-list.add method respectively.
- Last , export the value of three loops respectively.
Exp2 Linear-list application of Java
- To start with , set a class by using List to creat alist and blist, make the two lists' size equally.
- Next , use the sentence while-if, value alist(i) and blist(j)
- If the alist(i) > blist(j) , then merge the first place with index i+j by bList.get(j)
- Else , take the opposite.
- Then , when the length of alist > i , merge the list with index i+j by alist.get(i)
- while the length of blist > j , do the opposite
- After the loops end , return the result of merging lists.
- Last , write a test with valuing two arraylists by using list.add() and print the result.
Exp3 Implement ArrayList
- To start with , import to form a new Array-list to start the experiment.
- Next , write the index and the first element
- Next , use the method list.add to make the array list.
- Then , output and explain the fist element.
- Then , use the method list.remove to remove a number.
- Next , use the method list.contain to check whether the number is in list right now.
- Then , use the for-loop and leam.iterator to print iter.next() .
- Next , form a new String Array to print string.
- Then , use the list.clear to clear the list number.
- Last , use the method list.isEmpty to check whether the list is empty now.
Exp4 Implement LinkedList
- The whole test is made of three methods:testLinkedListAPIs(),useLinkedListAsLIFO();,useLinkedListAsFIFO();
- Then creat a class to explain this three methods.
- import a new linkedlist
- Next, use list.add to print
- Then, use stack to pop and peek.
- Next, creat a new queue
- Use the method to add and remove ,last print.
Exp5 Analyze source code of ArrayList and LinkedList
>.
Assume when we creat a Linkedlist at the start, there is only a hearder point,as the following picture.
There is a elementA1 insert ahead the header.
Now,insert a element A2 after implementing the code as the following
Entry newEntry = new Entry(A2, header, header.previous);
//Make newEntry.next point to the header, new Entry point to header.previous(A1)
newEntry.previous.next = newEntry;
newEntry.next.previous = newEntry;
Then, the picture turn to this
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% |
20162314 Experiment 1: Linear structure - experiment report.的更多相关文章
- PCA tries to preserve linear structure, MDS tries to preserve global geometry, and t-SNE tries to preserve topology (neighborhood structure)
https://colah.github.io/posts/2014-10-Visualizing-MNIST/
- 20162314 Experiment 2 - Tree
Experiment report of Besti course:<Program Design & Data Structures> Class: 1623 Student N ...
- 20162314 Experiment 4 - Graph
Experiment report of Besti course:<Program Design & Data Structures> Class: 1623 Student N ...
- 20162314 Experiment 3 - Sorting and Searching
Experiment report of Besti course:<Program Design & Data Structures> Class: 1623 Student N ...
- 20162314 《Program Design & Data Structures》Learning Summary Of The Eighth Week
20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Eighth Week ...
- cvpr2015papers
@http://www-cs-faculty.stanford.edu/people/karpathy/cvpr2015papers/ CVPR 2015 papers (in nicer forma ...
- N-Gram
N-Gram是大词汇连续语音识别中常用的一种语言模型,对中文而言,我们称之为汉语语言模型(CLM, Chinese Language Model). 中文名 汉语语言模型 外文名 N-Gram 定 ...
- IoT experitment
Abstract: In order to solve the problems of complex experiment management, complicated teaching task ...
- 论文翻译:2021_Towards model compression for deep learning based speech enhancement
论文地址:面向基于深度学习的语音增强模型压缩 论文代码:没开源,鼓励大家去向作者要呀,作者是中国人,在语音增强领域 深耕多年 引用格式:Tan K, Wang D L. Towards model c ...
随机推荐
- U盘安装咱中国人自己的操作系统UbuntuKylin14.04LST(超具体原创图文教程)
本文仅供參考,在准备级安装过程中出现的一切意外情况均与本文作者无关!原创教程转载请注明原转载地!系统简单介绍:UbuntuKylin 是Ubuntu官方认可的衍生版,其宗旨是创建一个Ubuntu的中文 ...
- 使用java发送QQ邮件的总结
最近帮朋友做个网站,实现用邮箱订阅功能,所以现在把这个发送邮件的功能放在这里,算是这两天工作的总结吧! 首先,想要实现订阅功能,要把邮箱保存,但是这个做的是个小网站,前后台交互的太少了,所以我就直接保 ...
- mac 设置mysql开机自启动
1.编辑一个mysql启动文件. 在终端里面输入: sudo vi /Library/LaunchDaemons/com.mysql.mysql.plist 2.输入启动文件内容: <?xml ...
- git 源码学习(init-db) 提交版本号 083c516331
写在前面的废话: 学完git之后,还是感觉云里雾里的,于是乎,就想到了通过学习git源码,来加深git的熟练度,同时学习一下c语言编程. git源码学习,逐步分析 这篇帖子是逐步分析git源码的,将g ...
- 学习scalaenv
背景 最近由于工作需要, 我总是在不同的scala项目间流动开发. 这就遇到一个很棘手的问题, 这几个项目用的scala版本不一致, 老项目用的是 scala 2.11.8, 新项目用的是 scala ...
- 【转】在发布站点前,Web开发者需要关注哪些技术细节
转摘:http://www.csdn.net/article/2014-05-19/2819818-technical-details-programmer 在网站发布前,开发者需要关注有许多的技术细 ...
- JavaWeb基础—会话管理之Cookie
一.什么是会话 打开浏览器,浏览各种资源,点击各种超链接,直至关闭浏览器,整个过程称为会话 二.会话管理的两种技术 1.Cookie 基于客户端.在客户端记录信息来确认用户身份.以cookie的形式写 ...
- 多线程Java Socket编程示例
package org.merit.test.socket; import java.io.BufferedReader; import java.io.IOException; import jav ...
- WPF 自定义ComboBox样式,自定义多选控件
原文:WPF 自定义ComboBox样式,自定义多选控件 一.ComboBox基本样式 ComboBox有两种状态,可编辑和不可编辑状态.通过设置IsEditable属性可以切换控件状态. 先看基本样 ...
- WPF 播放Flash
原文:WPF 播放Flash WPF中没有直接提供播放Flash的控件. 可以使用WebBrowser来打开,代码如下: <Window x:Class="Nankang.Itacat ...