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 ...
随机推荐
- 实战三种方式部署 MySQL5.7
作者:北京运维 常见的 MySQL 安装方式有如下三种: RPM 包方式:这种方式安装适合对数据库要求不太高的场合,安装速度快: 通用二进制包方式:安装速度相较于源码方式快,可以自定义安装目录. 源码 ...
- 快速安装Docker
Docker需要操作系统的内核3.0以上,如低于3.0,需先升级内核,才能安装docker: 1.查看内核版本号 [root@daojia ~]# uname -r 3.10.0-693.el7.x8 ...
- 远心镜头(Telecentric lens)原理介绍
远心镜头(Telecentric lens)原理介绍 远心镜头(Telecentric lens),是为纠正传统镜头视差而设计,它可以在一定的物距范围内,使得到的图像放大倍率不会变化,简单的说这种镜头 ...
- 3-1 实现简单的shell sed替换功能
1.需求 程序1: 实现简单的shell sed替换功能 file1 的内容copy到file2 输入参数./sed.py $1 $2 $1替换成$2 (把a替换成% ) 2.个人思路 open ...
- Kubernetes学习之路(十)之资源清单定义
一.Kubernetes常用资源 以下列举的内容都是 kubernetes 中的 Object,这些对象都可以在 yaml 文件中作为一种 API 类型来配置. 类别 名称 工作负载型资源对象 Pod ...
- OpenStack入门篇(十九)之网络虚拟化基础
1.Linux Bridge的基本概念 假设宿主机有 1 块与外网连接的物理网卡 eth0,上面跑了 1 个虚机 VM1,现在有个问题是: 如何让 VM1 能够访问外网?① 给 VM1 分配一个虚拟网 ...
- SQL Server 跨库查询
1. 开启Ad Hoc Distributed Queries组件,在sql查询编辑器中执行如下语句: reconfigure reconfigure 2. 跨库查询操作 select * from ...
- .net core中使用缓存(cache)
官方文档:https://docs.microsoft.com/en-us/aspnet/core/performance/caching/memory?view=aspnetcore-2.2#use ...
- [NOI2007]货币兑换 cdq分治,斜率优化
[NOI2007]货币兑换 LG传送门 妥妥的\(n \log n\)cdq做法. 这题用cdq分治也可以\(n \log n\)但是在洛谷上竟然比一些优秀的splay跑得慢真是见了鬼了看来还是人丑常 ...
- P3707 [SDOI2017]相关分析
P3707 [SDOI2017]相关分析 线段树裸题?但是真的很麻烦QAQ 题目给的式子是什么不用管,大力拆开,就是\(\frac{\sum x_iy_i-\overline xy_i-\overli ...