计算机专业基础知识点pdf

weixin_42104154计算机专业基础.zip 7.43MB

资源文件列表:

计算机专业基础.zip 大约有5个文件

计算机专业基础/
计算机专业基础/操作系统总结及知识网图.pdf 1.5MB
计算机专业基础/数据结构总结与知识网图.pdf 3.3MB
计算机专业基础/计算机组成原理总结及知识网图.pdf 1.3MB
计算机专业基础/计算机网络知识总结及知识网图.pdf 1.79MB

资源介绍:

计算机专业基础知识点pdf

<html xmlns="http://www.w3.org/1999/xhtml"><meta charset="utf-8"><meta name="generator" content="pdf2htmlEX"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><link rel="stylesheet" href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/base.min.css"><link rel="stylesheet" href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/fancy.min.css"><link rel="stylesheet" href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/raw.css"><script src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/js/compatibility.min.js"></script><script src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/js/pdf2htmlEX.min.js"></script><script>try{pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({});}catch(e){}</script><div id="sidebar" style="display: none"><div id="outline"></div></div><div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/bg1.jpg"><div class="c x0 y1 w0 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0"> <span class="_ _0"></span>@<span class="fc1">TOC</span></div><div class="t m0 x1 h4 y3 ff2 fs1 fc0 sc0 ls0 ws0">相关课程链接<span class="_ _1"> </span><span class="ff3 fc1"> </span></div><div class="t m0 x2 h5 y4 ff4 fs0 fc1 sc0 ls0 ws0">数据结构总结与知识网图<span class="ff1 fc2"> </span>计算机网络知识总结及知识网图<span class="ff1 fc2"> </span>操作系统总结及知识网图<span class="ff1 fc2"> </span>计算机组成原理总结及</div><div class="t m0 x2 h5 y5 ff4 fs0 fc1 sc0 ls0 ws0">知识网图</div><div class="t m0 x1 h4 y6 ff2 fs1 fc0 sc0 ls0 ws0">第一章<span class="ff3"> </span>绪论<span class="_ _2"> </span><span class="ff3 fc1"> </span></div><div class="t m0 x1 h6 y7 ff2 fs2 fc0 sc0 ls0 ws0">知识网图<span class="_ _3"> </span><span class="ff3 fc1"> </span></div></div><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a></div><div class="pi" data-data='{"ctm":[1.613445,0.000000,0.000000,1.613445,0.000000,0.000000]}'></div></div></html><div id="pf2" class="pf w0 h0" data-page-no="2"><div class="pc pc2 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/bg2.jpg"><div class="c x0 y1 w0 h2"><div class="t m0 x1 h4 y8 ff2 fs1 fc0 sc0 ls0 ws0">第二章<span class="ff3"> </span>线性表<span class="_ _4"> </span><span class="ff3 fc1"> </span></div><div class="t m0 x1 h6 y9 ff2 fs2 fc0 sc0 ls0 ws0">知识网图<span class="_ _3"> </span><span class="ff3 fc1"> </span></div></div><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a></div><div class="pi" data-data='{"ctm":[1.613445,0.000000,0.000000,1.613445,0.000000,0.000000]}'></div></div><div id="pf3" class="pf w0 h0" data-page-no="3"><div class="pc pc3 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/bg3.jpg"><div class="c x0 ya w0 h7"><div class="t m0 x1 h6 yb ff2 fs2 fc0 sc0 ls0 ws0">顺序表和链表的比较<span class="_ _5"> </span><span class="ff3 fc1"> </span></div><div class="t m0 x2 h5 yc ff3 fs0 fc2 sc0 ls0 ws0">1<span class="ff2">）存取方式<span class="ff1"> <span class="ff4">顺序表可以顺序存取，也可随机存取，链表只能从表头顺序存取元素</span> </span></span>2<span class="ff2">）逻辑结构与物理结构</span></div><div class="t m0 x2 h5 yd ff4 fs0 fc2 sc0 ls0 ws0">采用顺序存储时，逻辑上相邻的元素，对应的物理存储位置也相邻。采用链式存储时，逻辑上相邻的元素，</div><div class="t m0 x2 h5 ye ff4 fs0 fc2 sc0 ls0 ws0">物理存储位置不一定相邻，对应的逻辑关系通过指针链接来表示。<span class="ff1"> <span class="ff3">3<span class="ff2">）查找、插入和删除操作</span></span> </span>对于<span class="ff2">按值查</span></div><div class="t m0 x2 h5 yf ff2 fs0 fc2 sc0 ls0 ws0">找<span class="ff4">，顺序表无序时，两者的时间复杂度均为<span class="ff1">O(1)</span>，顺序表有序时，可采用折半查找，时间复杂度为<span class="ff1">O(log2n).</span></span></div></div><a class="l"><div class="d m1"></div></a></div><div class="pi" data-data='{"ctm":[1.613445,0.000000,0.000000,1.613445,0.000000,0.000000]}'></div></div><div id="pf4" class="pf w0 h0" data-page-no="4"><div class="pc pc4 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/bg4.jpg"><div class="c x0 y10 w0 h8"><div class="t m0 x2 h5 y11 ff4 fs0 fc2 sc0 ls0 ws0">对于<span class="ff2">按序号查找</span>，顺序表支持随机访问，时间复杂度为<span class="ff1">O(1),</span>而链表的平均时间复杂度为<span class="ff1">O(n). </span>对于<span class="ff2">插入、删</span></div><div class="t m0 x2 h5 y12 ff2 fs0 fc2 sc0 ls0 ws0">除<span class="ff4">操作，顺序表需要移动半个表长的元素，而链表只需修改相关结点的指针域即可。</span></div><div class="t m0 x1 h4 y13 ff2 fs1 fc0 sc0 ls0 ws0">第三章<span class="_ _6"> </span><span class="ff3 fc1"> </span></div><div class="t m0 x1 h6 y14 ff2 fs2 fc0 sc0 ls0 ws0">知识网图<span class="_ _3"> </span><span class="ff3 fc1"> </span></div></div><a class="l"><div class="d m1"></div></a><a class="l"><div class="d m1"></div></a></div><div class="pi" data-data='{"ctm":[1.613445,0.000000,0.000000,1.613445,0.000000,0.000000]}'></div></div><div id="pf5" class="pf w0 h0" data-page-no="5"><div class="pc pc5 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/85783343/bg5.jpg"></div><div class="pi" data-data='{"ctm":[1.613445,0.000000,0.000000,1.613445,0.000000,0.000000]}'></div></div>