<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Rukia0213的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Rukia0213</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Rukia0213]]></copyright><item><title><![CDATA[408考研之计算机网络—网络层 网络层功能概述]]></title><link>https://blog.csdn.net/Rukia0213/article/details/131032309</link><guid>https://blog.csdn.net/Rukia0213/article/details/131032309</guid><author>Rukia0213</author><pubDate>Sun, 04 Jun 2023 15:02:29 +0800</pubDate><description><![CDATA[网络层概要]]></description><category></category></item><item><title><![CDATA[2018年408真题数据结构选择题部分]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130935925</link><guid>https://blog.csdn.net/Rukia0213/article/details/130935925</guid><author>Rukia0213</author><pubDate>Mon, 29 May 2023 21:30:53 +0800</pubDate><description><![CDATA[2018年考研数据结构选择题部分]]></description><category></category></item><item><title><![CDATA[2019年408真题数据结构选择题部分]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130926892</link><guid>https://blog.csdn.net/Rukia0213/article/details/130926892</guid><author>Rukia0213</author><pubDate>Mon, 29 May 2023 14:22:47 +0800</pubDate><description><![CDATA[数据结构408真题选择题部分]]></description><category></category></item><item><title><![CDATA[2020年408真题数据结构选择题部分]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130819125</link><guid>https://blog.csdn.net/Rukia0213/article/details/130819125</guid><author>Rukia0213</author><pubDate>Tue, 23 May 2023 17:15:00 +0800</pubDate><description><![CDATA[2.对空栈 S 进行Push与Pop 操作，入栈序列 a,b,c，d,e 经过Push，Push，Pop,Push，Pop，Push，Push，Pop 操作后得到的出栈序列是 ( )。4.已知森林 F 及与之对应的二叉树 ，若 F 的先根遍历序列是 a，b，c，d，e，f，中根遍历序列是 b，a，d，f，e，c 则 T 的后根遍历序列是 ( )。10.依次将关键字 5，6，9，13，8,2，12，15 插入初始为空的 4 阶 B 树后，根节点中包含的关键字是( )。(4)堆中的次大值一定在根的下一层;]]></description><category></category></item><item><title><![CDATA[2021年408真题数据结构选择题部分]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130807322</link><guid>https://blog.csdn.net/Rukia0213/article/details/130807322</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 15:01:08 +0800</pubDate><description><![CDATA[408真题数据结构选择题部分]]></description><category></category></item><item><title><![CDATA[20230523考研日志]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130802886</link><guid>https://blog.csdn.net/Rukia0213/article/details/130802886</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 11:07:21 +0800</pubDate><description><![CDATA[5（未来一月计划），6月份需要刷：组成原理习题/真题选择题，操作系统视频课（完成一刷），并掌握组原和操作系统的选择题以及部分大题，以历年真题复印下来闭卷做法的形式，做完真题并打印下来供后续使用。4，计算机组成原理剩余专业课课程王道视频需观看完毕，然后1刷课后习题/真题，以选择题为主，达到90%左右的题型熟悉并掌握，下个月专攻组成原理选择题难题以及大题难点。顺序查找，折半查找；6月下半月-6月底结束前，需要完成专业课408之全部选择题，要求：达成90%题目的选择题正确率，并补充剩下的新知识点。]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的查找——散列查找]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130802614</link><guid>https://blog.csdn.net/Rukia0213/article/details/130802614</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 10:51:29 +0800</pubDate><description><![CDATA[哈希查找]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的查找——B+树]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130802346</link><guid>https://blog.csdn.net/Rukia0213/article/details/130802346</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 10:43:36 +0800</pubDate><description><![CDATA[B+树查找]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的查找——B树]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130801381</link><guid>https://blog.csdn.net/Rukia0213/article/details/130801381</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 10:37:22 +0800</pubDate><description><![CDATA[B树]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的查找——折半查找和分块查找]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130801136</link><guid>https://blog.csdn.net/Rukia0213/article/details/130801136</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 10:02:45 +0800</pubDate><description><![CDATA[查找]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的查找——查找的概念&顺序查找]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130800776</link><guid>https://blog.csdn.net/Rukia0213/article/details/130800776</guid><author>Rukia0213</author><pubDate>Mon, 22 May 2023 09:42:20 +0800</pubDate><description><![CDATA[查找]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——外部排序]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130771089</link><guid>https://blog.csdn.net/Rukia0213/article/details/130771089</guid><author>Rukia0213</author><pubDate>Fri, 19 May 2023 17:25:20 +0800</pubDate><description><![CDATA[408考研之数据结构的排序——外部排序]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——归并排序和基数排序]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130750246</link><guid>https://blog.csdn.net/Rukia0213/article/details/130750246</guid><author>Rukia0213</author><pubDate>Fri, 19 May 2023 10:49:35 +0800</pubDate><description><![CDATA[归并排序和基数排序]]></description><category></category></item><item><title><![CDATA[20230518考研日志]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130739087</link><guid>https://blog.csdn.net/Rukia0213/article/details/130739087</guid><author>Rukia0213</author><pubDate>Thu, 18 May 2023 09:43:03 +0800</pubDate><description><![CDATA[0518考研日志]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——简单选择排序&堆排序（heapsort）]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130730958</link><guid>https://blog.csdn.net/Rukia0213/article/details/130730958</guid><author>Rukia0213</author><pubDate>Wed, 17 May 2023 17:30:38 +0800</pubDate><description><![CDATA[简单选择排序&堆排序（heapsort）]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——快速排序的算法]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130725710</link><guid>https://blog.csdn.net/Rukia0213/article/details/130725710</guid><author>Rukia0213</author><pubDate>Wed, 17 May 2023 14:47:23 +0800</pubDate><description><![CDATA[快速排序代码]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——冒泡排序和快速排序]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130724256</link><guid>https://blog.csdn.net/Rukia0213/article/details/130724256</guid><author>Rukia0213</author><pubDate>Wed, 17 May 2023 13:59:22 +0800</pubDate><description><![CDATA[数据结构的交换排序。]]></description><category></category></item><item><title><![CDATA[408考研之数据结构的排序——插入排序和希尔排序]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130723673</link><guid>https://blog.csdn.net/Rukia0213/article/details/130723673</guid><author>Rukia0213</author><pubDate>Wed, 17 May 2023 13:24:04 +0800</pubDate><description><![CDATA[数据结构排序章节的插入和希尔排序]]></description><category></category></item><item><title><![CDATA[MAR位数和MDR位数代表的含义]]></title><link>https://blog.csdn.net/Rukia0213/article/details/130402273</link><guid>https://blog.csdn.net/Rukia0213/article/details/130402273</guid><author>Rukia0213</author><pubDate>Thu, 27 Apr 2023 11:15:12 +0800</pubDate><description><![CDATA[MAR位数和MDR位数代表的含义]]></description><category></category></item><item><title><![CDATA[Tomcat部署]]></title><link>https://blog.csdn.net/Rukia0213/article/details/124042288</link><guid>https://blog.csdn.net/Rukia0213/article/details/124042288</guid><author>Rukia0213</author><pubDate>Fri, 08 Apr 2022 15:52:18 +0800</pubDate><description><![CDATA[Tomcat部署]]></description><category></category></item></channel></rss>