<?xml version="1.0" encoding="UTF-8" standalone="no"?><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:blogger="http://schemas.google.com/blogger/2008" xmlns:gd="http://schemas.google.com/g/2005" xmlns:georss="http://www.georss.org/georss" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/" xmlns:thr="http://purl.org/syndication/thread/1.0" version="2.0"><channel><atom:id>tag:blogger.com,1999:blog-827629162194270719</atom:id><lastBuildDate>Thu, 05 Sep 2024 09:15:53 +0000</lastBuildDate><category>Artificial Intelligence (CS409)</category><category>Design and Analysis of Algorithms(CS302)</category><category>Server side Web Programming(CS310)</category><category>AI</category><category>prolog</category><title>Computer Science</title><description></description><link>http://csfos.blogspot.com/</link><managingEditor>noreply@blogger.com (CSFOS)</managingEditor><generator>Blogger</generator><openSearch:totalResults>11</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><language>en-us</language><itunes:explicit>no</itunes:explicit><itunes:subtitle/><itunes:category text="Education"><itunes:category text="Higher Education"/></itunes:category><itunes:owner><itunes:email>noreply@blogger.com</itunes:email></itunes:owner><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-5973407005085368269</guid><pubDate>Tue, 01 Feb 2011 18:59:00 +0000</pubDate><atom:updated>2011-02-01T12:58:40.793-08:00</atom:updated><title>Tutorial &amp;amp; Answers-Design Patterns(CS407)</title><atom:summary type="text">1. Software designing is hard and good designing is even hard. Explain why?&amp;#160;&amp;#160;&amp;#160;&amp;#160;&amp;#160;&amp;#160; In this Problem we are asked two things.1) Why Hard&amp;#160; 2) What is good design&amp;#160; According to the Design Patten book by gang of four     Designing object-oriented software is hard, and designing reusable object-oriented software is even harder. You must find pertinent objects, </atom:summary><link>http://csfos.blogspot.com/2011/02/tutorial-answers-design-patternscs407.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-5857124225926550466</guid><pubDate>Sun, 30 Jan 2011 14:10:00 +0000</pubDate><atom:updated>2011-01-30T06:55:52.321-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><title>Prolog Exercising control (AI,CS409)</title><atom:summary type="text">Code window  &amp;#160;   steps    </atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-exercising-control-cs409ai.html</link><author>noreply@blogger.com (CSFOS)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEivBwm-2tQJYwsuFN1YFlevHCmQoGAOFPo6ZMH5e1wiOYlNVOtrI4y-35YSzoXZa1Pc7MriuUFJjAY5lls300g3RURiIM31AJEDNYqCGPw1n8-9U_01cKbVRRbXdXHiNmuMurhRKWjwnw/s72-c?imgmax=800" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-198523316366804446</guid><pubDate>Wed, 12 Jan 2011 05:58:00 +0000</pubDate><atom:updated>2011-01-11T09:46:40.393-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><title>Prolog Examples II(AI,CS409)</title><atom:summary type="text">Towers of Hanoi Problem    you have N rings of increasing size and three pegs. Initially the three rings are    stacked in order of decreasing size on the ﬁrst peg. You can move them between pegs but you must never stack a big ring onto a smaller one. What is the sequence of moves to move from all the rings from the ﬁrst to the the third peg.  answers:  hanoi( N ):-&amp;#160; &amp;#160;&amp;#160;&amp;#160;&amp;#160;</atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-examples-iiaics409.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-5341737344649344301</guid><pubDate>Tue, 11 Jan 2011 20:10:00 +0000</pubDate><atom:updated>2011-01-11T12:10:00.531-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><title>Prolog Examples (AI,CS409)</title><atom:summary type="text">monkeys banana problem  There is a monkey at the door into a room. In the middle of the room a banana is hanging from the ceiling. The monkey is hungry and wants to get the banana, but he cannot stretch high enough from the floor. At the window of the room there is a box the monkey may use.  The monkey can perform the following actions:&amp;#160;   Walk on the floor    Climb the box     Push the box </atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-examples-aics409_8512.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-4811971970668489812</guid><pubDate>Tue, 11 Jan 2011 19:24:00 +0000</pubDate><atom:updated>2011-01-11T11:24:00.341-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><title>Prolog Examples (AI,CS409)</title><atom:summary type="text">monkeys banana problem  There is a monkey at the door into a room. In the middle of the room a banana is hanging from the ceiling. The monkey is hungry and wants to get the banana, but he cannot stretch high enough from the floor. At the window of the room there is a box the monkey may use.  The monkey can perform the following actions:&amp;#160;   Walk on the floor    Climb the box     Push the box </atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-examples-aics409_11.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-703487757195968868</guid><pubDate>Tue, 11 Jan 2011 08:23:00 +0000</pubDate><atom:updated>2011-01-11T00:23:25.584-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">AI</category><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><category domain="http://www.blogger.com/atom/ns#">prolog</category><title>Prolog Examples (AI,CS409)</title><atom:summary type="text">monkeys banana problemThere is a monkey at the door into a room. In the middle of the room a banana  is hanging from the ceiling. The monkey is hungry and wants to get the banana,  but he cannot stretch high enough from the floor. At the window of the room  there is a box the monkey may use.
The monkey can perform the following actions:&amp;nbsp; 
Walk on the floor 
Climb the box 
Push the box around</atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-examples-aics409.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-313444461833832214</guid><pubDate>Sat, 08 Jan 2011 11:54:00 +0000</pubDate><atom:updated>2011-01-08T03:57:08.429-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence (CS409)</category><title>Prolog Introduction-I(AI ,CS409)</title><atom:summary type="text">&amp;nbsp; &amp;nbsp; Hi guys after very long time I’m posting for this blog because My Computer so speed to do blogging or web developing [you know what i mean:) ]. &amp;nbsp; Any way I came to know this SW with AI lecture&amp;nbsp; series.First I thought it will be boring one as it has text editor with hard compiling manner but after doing some exercise it makes some sense. That would be the reason why I’m </atom:summary><link>http://csfos.blogspot.com/2011/01/prolog-introduction-ai-cs409.html</link><author>noreply@blogger.com (CSFOS)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgYVsenMU6xP55xTlLsVDhwoyDhDCEqwOH_tbYXvx60JNZwCwRf5F3hdewr4LzNzkN4rIU8yEIMMUNDHgSp8aLOuikqECnXHiFV5R15sbva9PW5ouzcrCetnJGUDQjsx8UBPGVdcsjNYA/s72-c?imgmax=800" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-1343725287314930231</guid><pubDate>Sat, 17 Oct 2009 08:47:00 +0000</pubDate><atom:updated>2009-10-17T01:47:34.192-07:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Design and Analysis of Algorithms(CS302)</category><title>Tutorial &amp;amp; Answers- Design and Analysis of Algorithms I</title><atom:summary type="text">1.     a. Define the term Algorithm in your own words.    Algorithm is finite set of well defined instructions for accomplishing some task given an initial state that will terminate in a defined end state.    source:http://www.newworldencyclopedia.org/entry/Algorithm          b. What are the important properties of an algorithm?         Finiteness&amp;#160; &amp;#160;&amp;#160;&amp;#160; :- an algorithm </atom:summary><link>http://csfos.blogspot.com/2009/10/tutorial-design-and-analysis-of_10.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-1575853659398776846</guid><pubDate>Sat, 17 Oct 2009 06:08:00 +0000</pubDate><atom:updated>2009-10-17T01:37:47.317-07:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Design and Analysis of Algorithms(CS302)</category><title>Tutorial - Design and Analysis of Algorithms II</title><atom:summary type="text">1.) Greedy Algorithms works by making the decision that seems most promising at any moment; it never reconsiders this decision, whatever situation may arise later.
Consider the problem of "Making Change".
Coins that are available are:
· dollars (100 cents) 
· quarters (25 cents) 
· dimes (10 cents) 
· nickels (5 cents) 
· pennies (1 cent) 
Problem&amp;nbsp; :&amp;nbsp; Make a change of a given amount </atom:summary><link>http://csfos.blogspot.com/2009/10/tutorial-design-and-analysis-of_3773.html</link><author>noreply@blogger.com (CSFOS)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-5862966930080534749</guid><pubDate>Thu, 15 Oct 2009 18:50:00 +0000</pubDate><atom:updated>2009-10-17T00:55:13.929-07:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Server side Web Programming(CS310)</category><title>Tutorial-Server side Web Programming(CS310)</title><atom:summary type="text">&amp;#160;     Create a web page as the home page for the Department of Statistics and Computer Science.                                You may use your own creative ideas to create the web page         Use an External Cascading Style Sheet to apply the style properties.         When the user move the mouse pointer over a menu option it should be emphasized with different styles. (use: hover element)</atom:summary><link>http://csfos.blogspot.com/2009/10/tutorial-server-side-web.html</link><author>noreply@blogger.com (CSFOS)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg1_umVAole8g_vcX-QdN923RuMyNV_B6-o6NuMNvMYoRq8E3F0UJV5YZeXo_WVczRn1oJIE5zwgMhyphenhyphenUtQ68dI6PonFV311j3wEKx-NlaH1hvlFNef_y_EXylfU4-Bitq2pahdVjdSIwQ/s72-c?imgmax=800" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-827629162194270719.post-173214747002026836</guid><pubDate>Wed, 14 Oct 2009 19:48:00 +0000</pubDate><atom:updated>2009-10-17T01:36:07.963-07:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">Server side Web Programming(CS310)</category><title>Answer-Server side Web Programming tute1-Q1</title><atom:summary type="text">Answer for Question 1:
&amp;lt;html&amp;gt;    
&amp;lt;head&amp;gt;     
&amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;lt;title&amp;gt;Home Page&amp;lt;/title&amp;gt;     
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;lt;style&amp;gt;     
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; .gray{background-color:#CCCCCC;font-weight:bold;}     
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; .white {color: #FFFFFF;}     
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp</atom:summary><link>http://csfos.blogspot.com/2009/10/answer-server-side-web-programming-tut1.html</link><author>noreply@blogger.com (CSFOS)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhItAofvXi-r2hj09yjpw2i2x-V_hi3h8ii1L2-RC3ulwagGkiHI_5gCLa1lauGh1sVy-p-r1557fzmlgaK6_wQ4Xyfgzyu8HuJUh4dnjgJPgFbcnhkdlfsK1bwXz31XGpME6GjhyphenhypheniPjg/s72-c?imgmax=800" width="72"/><thr:total>0</thr:total></item></channel></rss>