<?xml version="1.0" encoding="UTF-8"  standalone="yes" ?>
<rss version="2.0">
	<channel>
		<title>社群: 艾鍗學院 Blog - 文件區(基礎C程式&amp;資料結構)</title>
		<description>台灣數位學習數位教學平台 RSS feed provider</description>
		<language>zh-tw</language>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doclist&amp;folderID=1536</link>
	<item>
		<title>醫電班_C程式學習評量</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=12133</link>
		<description> </description>
		<pubDate>Tue, 24 Jun 2014 16:53:21 +0800</pubDate>
	</item>
	<item>
		<title>移除字串的&quot;空白字元&quot;</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=10314</link>
		<description>作業: 寫一個函式, 移除字串末端的&quot;空白字元&quot; , 並傳回移除後的字串長度作業解答:&amp;nbsp;static int rtrim(char *s){&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; int i;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; for (i = strlen(s) - 1; i &amp;gt;= 0 &amp;amp;&amp;amp; (s[i] == &#039; &#039; || s[i] == &#039;\n&#039;); i--)&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; s[i] = &#039;\0&#039;;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; return i + 2;}   </description>
		<pubDate>Thu, 28 Nov 2013 15:14:32 +0800</pubDate>
	</item>
	<item>
		<title>C講義 for ch5, ch 6</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=9416</link>
		<description>C程式-陣列與指標 from itembedded </description>
		<pubDate>Sat, 24 Nov 2012 15:16:11 +0800</pubDate>
	</item>
	<item>
		<title>[程式練功區]C程式-Homework5</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=8181</link>
		<description>The Colossus Airlines fleet consists of one plane with a 
seating capacity of 12. It makes one flight daily. Write a seating reservation 
program with the following features:

The program uses an array of 12 structures. Each structure 
should hold a seat identification number, a marker that indicates whether the 
seat is assigned, the last name of the seat holder, and the first name of the 
seat holder.

The program displays the following menu:To choose a function, enter its letter label:
a) Show number of empty seats
b) Show list of empty seats
c) Show alphabetical list of seats
d) Assign a customer to a seat assignment
e) Delete a seat assignment
f) Quit


The program successfully executes the promises of its menu. 
Choices d) and e) require additional input, and each should 
enable the user to abort entry.

After executing a particular function, the program shows the 
menu again, except for choice f).

Data is saved in a file between runs. When the program is 
restarted, it first loads in the data, if any, from the file.   </description>
		<pubDate>Mon, 02 Apr 2012 17:40:46 +0800</pubDate>
	</item>
	<item>
		<title>[程式練功區]C程式-Homework4</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=8180</link>
		<description>1) Write a program that takes two command-line arguments. The first is the name of a file; the second is &amp;nbsp;a string . The program should then search the file, printing all &amp;nbsp;lines &amp;nbsp;that contains the string&amp;nbsp;       </description>
		<pubDate>Mon, 02 Apr 2012 17:38:28 +0800</pubDate>
	</item>
	<item>
		<title>[程式練功區]C程式-Homework3</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=8162</link>
		<description>1) 寫一個show_bitmap函式可將二維陣列的值輸出，輸出方式:當bit為1時輸出’*’,0輸出空白字元’ &amp;nbsp;’，每處理完2個byte輸出換行&#039;\n&#039;&amp;nbsp;void show_bitmap(int (*a)[30],int row);char array[2][30]={0x8,0x20,0x8,0x24,0xfe,0xfe,0x8,0x20,&amp;nbsp;0x0,0x0,0x8,0x20,0x4,0x40,0x4,0x40,&amp;nbsp;0x2,0x80,0x1,0x0,0x2,0x80,0xc,0x70,&amp;nbsp;0x30,0xe,0xc0,0x4,0x0,0x0},{0x20,0x20,0x51,0xfc,0x88,0x88,0x0,0x50,0xfb,0xfe,0x22,0x22,0x22,0x22,0xf9,0xfc,0x21,0x24,0x21,0x24,0xa9,0x24,0x71,0x2c,0x20,0x20,0xf8,0x20,0x0,0x0}};         </description>
		<pubDate>Fri, 30 Mar 2012 18:34:20 +0800</pubDate>
	</item>
	<item>
		<title>[程式練功區]C程式-Homework2</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=8155</link>
		<description>1) Write and test a Fibonacci() function that uses a loop instead of recursion to calculate Fibonacci numbers.f(n)=f(n-1)+f(n-2) if n &amp;gt; 2f(n)=n &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; if &amp;nbsp;0&amp;lt;=n&amp;lt;=2&amp;nbsp;2) Write a routine that rotates the bit pattern for the character c left b bits.&amp;nbsp;&amp;nbsp;&amp;nbsp;unsigned char rotate_left(unsigned char c, unsigned char b)&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;ex. &amp;nbsp;rotate_left(0xa3,2) returns 0x8e&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;3) Write a to_base_n(int number,int base) function which prints the number that is its first argument to the number base given by the second argument.&amp;nbsp;For example, to_base_n(129,8) would display 201, the base-8 equivalent of 129.&amp;nbsp;Please implement to_base_n() function in Recursive version and Non-recursive version.           </description>
		<pubDate>Wed, 28 Mar 2012 17:39:10 +0800</pubDate>
	</item>
	<item>
		<title>[程式練功區]C程式-Homework1</title>
		<link>http://lms.xms.com.tw/board.php?courseID=143&amp;f=doc&amp;cid=8139</link>
		<description>Write &amp;nbsp;a &amp;nbsp;program &amp;nbsp;that &amp;nbsp;prints the &amp;nbsp;following &amp;nbsp;diamond &amp;nbsp;shape. &amp;nbsp;Your &amp;nbsp;program &amp;nbsp;should&amp;nbsp;
read &amp;nbsp;an &amp;nbsp;odd &amp;nbsp;number &amp;nbsp;in &amp;nbsp;the &amp;nbsp;range &amp;nbsp;1 &amp;nbsp;to &amp;nbsp;51 &amp;nbsp;to &amp;nbsp;specify &amp;nbsp;the &amp;nbsp;number &amp;nbsp;of &amp;nbsp;rows &amp;nbsp;in &amp;nbsp;the&amp;nbsp;diamond, and then display a diamond of the appropriate size. &amp;nbsp;&amp;nbsp;
You &amp;nbsp;may &amp;nbsp;use &amp;nbsp;output &amp;nbsp;statements &amp;nbsp;that &amp;nbsp;print &amp;nbsp;either &amp;nbsp;a &amp;nbsp;single &amp;nbsp;asterisk &amp;nbsp;(*) or &amp;nbsp;a &amp;nbsp;single&amp;nbsp;blank. Maximize your use of repetition (with nested for statements) and minimize&amp;nbsp;the number of output statements.

&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;***
&amp;nbsp; &amp;nbsp; &amp;nbsp; *****
&amp;nbsp; &amp;nbsp; &amp;nbsp;*******
&amp;nbsp; &amp;nbsp; *********
&amp;nbsp; &amp;nbsp;***********
&amp;nbsp; &amp;nbsp; *********
&amp;nbsp; &amp;nbsp; &amp;nbsp;******* 
&amp;nbsp; &amp;nbsp; &amp;nbsp; ***** 
&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*** 
&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *    </description>
		<pubDate>Sat, 24 Mar 2012 22:13:54 +0800</pubDate>
	</item>
	</channel>
	</rss>
