<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/" xmlns:blogger="http://schemas.google.com/blogger/2008" xmlns:georss="http://www.georss.org/georss" xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr="http://purl.org/syndication/thread/1.0" version="2.0"><channel><atom:id>tag:blogger.com,1999:blog-7544684674467029764</atom:id><lastBuildDate>Tue, 10 Sep 2024 02:34:28 +0000</lastBuildDate><category>ECE</category><category>CSE</category><category>EEE</category><category>MECH</category><category>Material</category><category>Network Security</category><category>lab-programs</category><category>Artificial Intelligence</category><category>Nano Technology</category><category>DAA</category><category>Data Mining</category><category>Energy Technology</category><category>Networks Technology</category><category>Wireless Networks</category><category>Data-Storage Technology</category><category>Grid Computing</category><category>Robotics</category><category>Smart Technology</category><category>Wireless Technologies</category><category>4G Technology</category><category>CD</category><category>Neural Networks</category><category>Biometrics Technology</category><category>Image Processing</category><category>Mobile Computing</category><category>Wireless Sensor Networks</category><category>Cloud Computing</category><category>Digital Watermarking</category><category>Projects</category><category>Adhoc Networks</category><category>Augmented Reality</category><category>Embedded Systems</category><category>Information Security</category><category>Operating System</category><category>Aeronautical</category><category>Birds Eye View</category><category>Brain Finger Printing</category><category>Cryogenics</category><category>DNA Computing</category><category>Global Positioning System</category><category>Hacking</category><category>Haptic Technology</category><category>Microwave Receiver Front-End</category><category>Miniaturization</category><category>Optical Networks</category><category>PHP</category><category>Parallel Computing</category><category>Quantum Technology</category><category>Semantic Web</category><category>Virtual Reality</category><category>VoWiFi</category><category>Voice Oriented Technology</category><category>Wearable Computing</category><category>Wireless Fiber Optics</category><category>Wireless Power Transmission</category><category>3D Machine Systems</category><category>5G Technology</category><category>6G Technology</category><category>Affective Computing</category><category>Agricultural Technology</category><category>Antennas Technology</category><category>Big Data</category><category>Bio Computing</category><category>Bio-Technology</category><category>Blue Eyes Technology</category><category>Computer Forensics</category><category>Data Analytics</category><category>Fog Computing</category><category>Hi-Fi Technology</category><category>Hybrid Electric Bus</category><category>IRIS Recognition System</category><category>Information Technology</category><category>Internet Of Things</category><category>JAVA</category><category>JavaScript</category><category>Leap Motion Control</category><category>Magnetic Levitation</category><category>Millipede Storage System</category><category>Mind Uploading</category><category>Optical Camouflage</category><category>Optical Computing</category><category>Optical Strip Waveguides</category><category>Programming Languages</category><category>Quantum Computing</category><category>Session Lock Protocol</category><category>Slient Sound Technology</category><category>Software Technology</category><category>Spintronics</category><category>Surface Computing</category><category>Teleportation</category><category>Testing Methodologies</category><category>Tongue Drive System</category><category>Ubiquitous Computing</category><category>VANET</category><category>VLSI</category><category>Virtual Brain</category><category>Virtual Surgery Technology</category><category>Washable Computing</category><category>Wavelet Transform</category><category>WiMAX</category><category>Wibree</category><title>Paper Presentations e-Books free </title><description>Latest cse ece eee mech technical topics paper presentations ppts Engineering Materials, previuos papers, Seminar Paper Presentations topics, Projects, download free, study material,ppts</description><link>http://download-ppts.blogspot.com/</link><managingEditor>noreply@blogger.com (Unknown)</managingEditor><generator>Blogger</generator><openSearch:totalResults>351</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-8136903044383958257</guid><pubDate>Mon, 08 Jun 2020 07:19:00 +0000</pubDate><atom:updated>2020-06-08T12:50:05.340+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>CSE BTech MTech subject wise lab programs manuals with output</title><description>&lt;style type=&#39;text/css&#39;&gt;
#related-posts {display:none}
#related-posts1 {margin: 0px 5px;}
#related-posts1 a {font-size: 1.1em;color:#970E0E;text-transform: capitalize;}
#related-posts1 a:hover {text-decoration: none;color: #555;}
#related-posts1 ul {list-style-type: none;padding: 0px;color: #000000;}
#related-posts1 li {padding: 0.5em 1em;border-bottom: 1px solid #E2E2E2;background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat;}
#related-posts1 li:hover {background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat #E7F0FF;}
.post-body ul li::before{display:none;}
.post h3{font-size:15px;}
.post-body h2{margin:0px;}
&lt;/style&gt;

&lt;div id=&quot;related-posts1&quot;&gt;
&lt;h2&gt;B.Tech M.Tech CSE Subject wise Computer science lab programs output CSE lab programs, CSE programs manual, CSE subject programs and lab manuals &lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;C Programming-C Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;Compiler Design-CD Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;/2020/05/daa-subject-lab-programs-with-output-c-java-language.html&quot;&gt;Design and Analysis of Algorithms-DAA Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;Operating Systems-OS Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;Java Programming-JAVA Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;Linux Programming-Linux Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;Software Engineering-SE Lab&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;

&lt;/ul&gt;&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/06/cse-subject-wise-lab-programs-manuals-output-btech-mtech.html</link><author>noreply@blogger.com (Unknown)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-8553216984334367370</guid><pubDate>Mon, 08 Jun 2020 06:59:00 +0000</pubDate><atom:updated>2020-06-08T12:32:15.905+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><category domain="http://www.blogger.com/atom/ns#">EEE</category><category domain="http://www.blogger.com/atom/ns#">MECH</category><title>B.Tech M.Tech CSE ECE EEE MECH lab programs output </title><description>&lt;style type=&#39;text/css&#39;&gt;
#related-posts {display:none}
#related-posts1 {margin: 0px 5px;}
#related-posts1 a {font-size: 1.1em;color:#970E0E;text-transform: capitalize;}
#related-posts1 a:hover {text-decoration: none;color: #555;}
#related-posts1 ul {list-style-type: none;padding: 0px;color: #000000;}
#related-posts1 li {padding: 0.5em 1em;border-bottom: 1px solid #E2E2E2;background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat;}
#related-posts1 li:hover {background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat #E7F0FF;}
.post-body ul li::before{display:none;}
.post h3{font-size:15px;}
.post-body h2{margin:0px;}
&lt;/style&gt;

&lt;div id=&quot;related-posts1&quot;&gt;
&lt;h2&gt;B.Tech M.Tech CSE ECE EEE MECH lab programs output CSE lab programs, ece programs, eee programs and other subject programs and lab manuals &lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;CSE Lab Programs&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;ECE Lab Programs&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;EEE Lab Programs&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;li&gt;&lt;h3&gt;&lt;a href=&quot;#&quot;&gt;MECH Lab Programs&lt;/a&gt;&lt;/h3&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/06/btech-mtech-cse-ece-eee-mech-lab-programs-manual-download.html</link><author>noreply@blogger.com (Unknown)</author></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-6871793066317258932</guid><pubDate>Tue, 26 May 2020 15:49:00 +0000</pubDate><atom:updated>2020-05-26T21:19:51.431+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence</category><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><title>Natural Language Processing using AI seminar ppt</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: justify;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt; Artificial Intelligence Natural Language Processing Paper Presentation, AI Natural Language Processing pdf,  Artificial intelligence Natural Language Processing ppt ( Seminar Paper Presentations Materials Projects )&lt;/h2&gt;
&lt;b&gt;Abstract:&lt;/b&gt;Natural Language Processing, usually shortened as NLP, is a branch of artificial intelligence that deals with the interaction between computers and humans using the natural language. The ultimate objective of NLP is to read, decipher, understand, and make sense of the human languages in a manner that is valuable.Most NLP techniques rely on machine learning to derive meaning from human languages.
&lt;br&gt; &lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/natural-language-processing-using-ai-ppt-seminar-topic.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/natural-language-processing-using-ai-ppt-seminar-topic.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjgReUsekqO_qwYEEgLe4m3wbVRYBeHUwtLEgblI_sOlnA3xVBo7g7IUYlej2Z-RbubwumpykNOOO5r4V40uhSpyAMN4g2w5zI8asJcyR5Ir1kEhsp1qBnMb3bHAlz4OUC7ck42ZkFUYXP/s72-c/download_icon.gif" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-2315204111683551627</guid><pubDate>Mon, 25 May 2020 08:17:00 +0000</pubDate><atom:updated>2020-05-25T13:47:34.205+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><category domain="http://www.blogger.com/atom/ns#">EEE</category><category domain="http://www.blogger.com/atom/ns#">MECH</category><title>Latest Technical Seminar Topics download</title><description>&lt;style type=&#39;text/css&#39;&gt;
#related-posts {display:none}
#related-posts1 {margin: 0px 5px;}
#related-posts1 a {font-size: 1.1em;color:#970E0E;text-transform: capitalize;}
#related-posts1 a:hover {text-decoration: none;color: #555;}
#related-posts1 ul {list-style-type: none;padding: 0px;color: #000000;}
#related-posts1 li {padding: 0.5em 1em;border-bottom: 1px solid #E2E2E2;background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat;}
#related-posts1 li:hover {background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat #E7F0FF;}
.post-body ul li::before{display:none;}
.post h3{font-size:15px;margin-top:-10px;}
.post-body h2{margin:0px;}
&lt;/style&gt;

&lt;div id=&quot;related-posts1&quot;&gt;
&lt;h2&gt;Latest 3G 4G 5G 6G Technology Seminar topics Paper Presentations download ppts free- latest CSE trends&lt;/h2&gt;
&lt;ul&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2011/11/seminar-presentations-on-4g-technology.html&quot;&gt;4G Technology-Paper-1&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2018/07/paper-presentation-on-4g-technology.html&quot;&gt;4G Technology-Paper-2&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2011/10/4g-technology-seminar-papers-download.html&quot;&gt;4G Technology-Paper-3&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2012/05/4g-wireless-and-mobile-communications.html&quot;&gt;4G Wireless and Mobile Communications&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2012/06/long-term-evolution-lte-4g-technology.html&quot;&gt;4G-Long Term Evolution(LTE)&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2011/10/4g-broadband-paper-presentation-4g-wi.html&quot;&gt;4G Wi-Fi Broadband&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2012/07/5g-wireless-mobile-internet-technology.html&quot;&gt;5G Wi-Fi Mobile Internet&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2016/07/6g-internet-communication-mobile-tech-full-paper-download.html&quot;&gt;6G Internet Technology&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;/ul&gt;&lt;/div&gt;

</description><link>http://download-ppts.blogspot.com/2020/05/latest-paper-presentations-download-ppts-com.html</link><author>noreply@blogger.com (Unknown)</author></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-1165585573562451945</guid><pubDate>Sat, 23 May 2020 13:26:00 +0000</pubDate><atom:updated>2020-05-24T13:26:39.935+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>DAA Subject Lab Programs with Output</title><description>&lt;style type=&#39;text/css&#39;&gt;
#related-posts {display:none;}
#related-posts1 {margin: 0px 5px;}
#related-posts1 a {font-size: 1.1em;color:#970E0E;text-transform: capitalize;}
#related-posts1 a:hover {text-decoration: none;color: #555;}
#related-posts1 ul {list-style-type: none;padding: 0px;color: #000000;}
#related-posts1 li {padding: 0.5em 1em;border-bottom: 1px solid #E2E2E2;background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat;}
#related-posts1 li:hover {background: url(https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhsEItTRmRXrdSWRy0zrQnq6TbOZ869O1eZ0IVdfSGg6JUEpQ07FIRSHJFCQ5oV8EGlOWbcTT3bvFfC3FAsZ2Eg41NHvNrbevFvpkwbxlOkzDfliANp1tvc7aAqiQ8zmYfBs1dMe8qEsDA/s1600/Arrow.png).2em 1em no-repeat #E7F0FF;}
.post-body ul li::before{display:none;}
.post h3{font-size:15px;margin-top:-10px;}
.post-body h2{margin:0px;}
&lt;/style&gt;

&lt;div id=&quot;related-posts1&quot;&gt;
&lt;h2&gt;DAA lab programs Design and Analysis of Algorithms lab programs in C language, Java language daa programs output, daa c programs, daa java programs Design and Analysis of Algorithms&lt;/h2&gt;
&lt;ul&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/selection-sort-daa-program-c-language-lab-manual.html&quot;&gt;Selection Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/daa-program-perform-insertion-sorting-c-language.html&quot;&gt;Insertion Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/heap-sort-daa-lab-program-manual-c-language.html&quot;&gt;Heap Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/quick-sort-c-program-daa-lab-manual-language.html&quot;&gt;Quick Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/counting-sort-program-c-language-daa-lab.html&quot;&gt;Counting Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/merge-sorting-daa-program-c-language-daa-lab-manual.html&quot;&gt;Merge Sort Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/radix-sort-daa-lab-c-language-program-sorting-manual-output.html&quot;&gt;Radix Sorting Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/knapsack-problem-using-greedy-solution-c-lang-program.html&quot;&gt;Knapsack Problem using Greedy Solution in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/travelling-salesman-problem-daa-lab-program-c-lang.html&quot;&gt;Travelling Salesman Program in C&lt;/a&gt;&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;2020/05/minimum-spanning-tree-using-kruskal-algorithm-c-program.html&quot;&gt;Minimum Spanning Tree using Kruskal’s Algorithm daa C program &lt;/a&gt;
&lt;/li&gt;&lt;/h3&gt;
&lt;h3&gt;&lt;li&gt;&lt;a href=&quot;/2020/05/n-queen-problem-using-backtracking-daa-lab-c-program.html&quot;&gt;N Queen Problem using Backtracking program in C&lt;/a&gt;
&lt;/li&gt;&lt;/h3&gt;
&lt;/ul&gt;&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/daa-subject-lab-programs-with-output-c-java-language.html</link><author>noreply@blogger.com (Unknown)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4888336483865018849</guid><pubDate>Wed, 20 May 2020 06:01:00 +0000</pubDate><atom:updated>2020-05-23T18:58:16.956+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Program to find whether String is Constant or not C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
Find string is a constant or not Compiler Design subject lab programs, string is a constant or not c program,  string is a constant or not CD lab programs, Program to implement string is a constant or not in C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/ce29fbd9438c62b44aa4345d3042182a.js&quot;&gt;&lt;/script&gt;
&lt;h4 style=&quot;text-align: left;&quot;&gt;
&lt;span style=&quot;color: red;&quot;&gt;OUTPUT&lt;/span&gt;&lt;/h4&gt;
&lt;h2&gt;
&lt;span style=&quot;color: #333333; font-family: arial, verdana;&quot;&gt;&lt;span style=&quot;font-size: 14px;&quot;&gt;enter the string:return&amp;nbsp;&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;span style=&quot;color: #333333; font-family: arial, verdana;&quot;&gt;&lt;span style=&quot;font-size: 14px;&quot;&gt;it is a keyword&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;span style=&quot;color: #333333; font-family: arial, verdana;&quot;&gt;&lt;span style=&quot;font-size: 14px;&quot;&gt;enter the string:hello&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;span style=&quot;color: #333333; font-family: arial, verdana;&quot;&gt;&lt;span style=&quot;font-size: 14px;&quot;&gt;&amp;nbsp;it is &amp;nbsp;not a keyword&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;span style=&quot;color: #333333; font-family: arial, verdana;&quot;&gt;&lt;span style=&quot;font-size: 14px;&quot;&gt;&lt;u&gt;&lt;br /&gt;&lt;/u&gt;&lt;/span&gt;&lt;/span&gt;&amp;nbsp;&lt;/h2&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/c-program-to-find-whether-string-is-contant-not.html</link><author>noreply@blogger.com (Unknown)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-7430138130497919075</guid><pubDate>Tue, 19 May 2020 08:42:00 +0000</pubDate><atom:updated>2020-05-23T18:58:39.926+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>SLR Parser CD program in C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
SLR Parser Compiler Design subject lab programs, SLR Parser c program,  SLR Parser CD lab programs, Program to implement SLR Parser in C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/278e467ea2da2e4a504d31099d9f6f59.js&quot;&gt;&lt;/script&gt;
&lt;div style=&quot;text-align: left;&quot;&gt;
&lt;b&gt;Input File For SLR Parser:&lt;/b&gt;&lt;br /&gt;
&lt;br /&gt;
S S+T&lt;br /&gt;
S T&lt;br /&gt;
T T*F&lt;br /&gt;
T F&lt;br /&gt;
F (S)&lt;br /&gt;
F t &lt;/div&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/slr-parser-cd-program-in-c-lang-compiler-design-lab.html</link><author>noreply@blogger.com (Unknown)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-6713379283470820732</guid><pubDate>Tue, 19 May 2020 08:29:00 +0000</pubDate><atom:updated>2020-05-23T18:58:49.439+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Predictive Parser table CD lab C program</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
Predictive Parser table Compiler Design subject lab programs, Predictive Parser table c program,  Predictive Parser table CD lab programs, Program to implement Predictive Parser table in C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/874ec0f59754a8e5bb882a89c54c9af0.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIvVtpy0yM2RKiJjN6MS-4feUVsEpH0plSrddtj3d3iU429095WkJ3eAUVqHwKOn_IRXmr4AieinN8Me7QO_K7-Ty7U813hGCTrSwYOzdSrMvRQvXgEgJQeGzkYAdh4WjD40jl1gjeTw/s1600/predictive-output.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIvVtpy0yM2RKiJjN6MS-4feUVsEpH0plSrddtj3d3iU429095WkJ3eAUVqHwKOn_IRXmr4AieinN8Me7QO_K7-Ty7U813hGCTrSwYOzdSrMvRQvXgEgJQeGzkYAdh4WjD40jl1gjeTw/s1600/predictive-output.png&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/predictive-parser-cd-lab-c-program-languge.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIvVtpy0yM2RKiJjN6MS-4feUVsEpH0plSrddtj3d3iU429095WkJ3eAUVqHwKOn_IRXmr4AieinN8Me7QO_K7-Ty7U813hGCTrSwYOzdSrMvRQvXgEgJQeGzkYAdh4WjD40jl1gjeTw/s72-c/predictive-output.png" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-1367511216835173258</guid><pubDate>Tue, 19 May 2020 07:40:00 +0000</pubDate><atom:updated>2020-05-23T18:58:57.748+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>FOLLOW of a given grammer using C</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
 Follow of a given grammar Compiler Design subject lab programs, Follow of a given grammar c program,  Follow of a given grammar CD lab programs, Program to implement Follow of a given grammar C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/0209ed94b7ead92395752f227e659e61.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjbCecfBaTpWqTDM7rQgOrHspeNgNiWLLIJ703Ujzwxf1aty-cJnema7wqmqRzi76ldxVKgWdkK1OoyFbzjXu3kMCdshBbVNzx7ET5nQ7CsIkUipxT26bXW-GDY0xghx2mhpkzHssqDFG-i/s1600/kar.PNG&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjbCecfBaTpWqTDM7rQgOrHspeNgNiWLLIJ703Ujzwxf1aty-cJnema7wqmqRzi76ldxVKgWdkK1OoyFbzjXu3kMCdshBbVNzx7ET5nQ7CsIkUipxT26bXW-GDY0xghx2mhpkzHssqDFG-i/s1600/kar.PNG&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/follow-given-grammer-c-program-compiler-design.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjbCecfBaTpWqTDM7rQgOrHspeNgNiWLLIJ703Ujzwxf1aty-cJnema7wqmqRzi76ldxVKgWdkK1OoyFbzjXu3kMCdshBbVNzx7ET5nQ7CsIkUipxT26bXW-GDY0xghx2mhpkzHssqDFG-i/s72-c/kar.PNG" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-7607839112459785182</guid><pubDate>Tue, 19 May 2020 07:22:00 +0000</pubDate><atom:updated>2020-05-23T18:59:07.969+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>FIRST of given grammar Compiler design C program</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
First of a given grammar Compiler Design subject lab programs, first of a given grammar c program,  first of a given grammar CD lab programs, Program to implement first of a given grammar C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/736910d5faa299475a71d470caa993f1.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi_7dOb0IQkl6uZaxmhL8AK9SJafoTFmbTNEgI12pDNmima2dujGY0DLOVsZ0x_qSov27783av_2Bo8IN4LRb3JBYnw3hmfyVTlBwS2TEd49rpTsw5sFI1G5KlWPM2N-JE2GMuIKB8uD2jZ/s1600/karfirst.PNG&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi_7dOb0IQkl6uZaxmhL8AK9SJafoTFmbTNEgI12pDNmima2dujGY0DLOVsZ0x_qSov27783av_2Bo8IN4LRb3JBYnw3hmfyVTlBwS2TEd49rpTsw5sFI1G5KlWPM2N-JE2GMuIKB8uD2jZ/s1600/karfirst.PNG&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/first-of-given-grammar-compiler-design-c-program-lab.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi_7dOb0IQkl6uZaxmhL8AK9SJafoTFmbTNEgI12pDNmima2dujGY0DLOVsZ0x_qSov27783av_2Bo8IN4LRb3JBYnw3hmfyVTlBwS2TEd49rpTsw5sFI1G5KlWPM2N-JE2GMuIKB8uD2jZ/s72-c/karfirst.PNG" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4455072571201463231</guid><pubDate>Tue, 19 May 2020 06:42:00 +0000</pubDate><atom:updated>2020-05-23T18:59:16.708+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CD</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Lexical Analyzer CD program in C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
lexical Analyzer Compiler Design subject lab programs lexically Analyzer c program,  lexical Analyze CD lab programs, Program to implement lexically Analyzer C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/eb37a28865b585308955cf7269ba499b.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjRW6AXoh4Jxf-5QyzgKTNAZd1JPgJhYNqeOU69E6tMTj8l-6KBv9vEIhdHjVksGDseVDAqTBja2jp0ktyqPjXCSNmu4VqwRlN1Hq8JxZ-BnHvJiCxgN8VeckLpIBzhSpVcqANNv__DPw7C/s1600/lex.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjRW6AXoh4Jxf-5QyzgKTNAZd1JPgJhYNqeOU69E6tMTj8l-6KBv9vEIhdHjVksGDseVDAqTBja2jp0ktyqPjXCSNmu4VqwRlN1Hq8JxZ-BnHvJiCxgN8VeckLpIBzhSpVcqANNv__DPw7C/s1600/lex.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/compiler-design-c-program-lexical-analyzer-language.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjRW6AXoh4Jxf-5QyzgKTNAZd1JPgJhYNqeOU69E6tMTj8l-6KBv9vEIhdHjVksGDseVDAqTBja2jp0ktyqPjXCSNmu4VqwRlN1Hq8JxZ-BnHvJiCxgN8VeckLpIBzhSpVcqANNv__DPw7C/s72-c/lex.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-7966244269382133072</guid><pubDate>Fri, 15 May 2020 15:50:00 +0000</pubDate><atom:updated>2020-05-23T19:03:14.069+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>N Queen Problem using Backtracking daa lab C program </title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs N Queen Problem using Backtracking c program, N Queen Problem using Backtracking Daa lab programs, Program to perform N Queen Problem using Backtracking using C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/34ee2640c9d02da3aa5fd046e875090b.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjelmy8N6AL-Lp6hVB5NvvPsyvLObui25oGzlkIydZyraqfEU6c7Go9Cqgt0PqvfNkkoiCSqvX-gU5owQFnf-_vvxzD9DrzpfGJYZsu1FZ9hleNyr8HgS7VZuReBTWL7gxSIHZe8l7vqmFz/s640/h.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjelmy8N6AL-Lp6hVB5NvvPsyvLObui25oGzlkIydZyraqfEU6c7Go9Cqgt0PqvfNkkoiCSqvX-gU5owQFnf-_vvxzD9DrzpfGJYZsu1FZ9hleNyr8HgS7VZuReBTWL7gxSIHZe8l7vqmFz/s640/h.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/n-queen-problem-using-backtracking-daa-lab-c-program.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjelmy8N6AL-Lp6hVB5NvvPsyvLObui25oGzlkIydZyraqfEU6c7Go9Cqgt0PqvfNkkoiCSqvX-gU5owQFnf-_vvxzD9DrzpfGJYZsu1FZ9hleNyr8HgS7VZuReBTWL7gxSIHZe8l7vqmFz/s72-c/h.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-8933618826787718113</guid><pubDate>Fri, 15 May 2020 15:45:00 +0000</pubDate><atom:updated>2020-05-23T19:03:23.836+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Minimum Spanning Tree using Kruskal’s Algorithm daa C program </title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs Minimum Spanning Tree using Kruskal’s Algorithm c program, Minimum Spanning Tree using Kruskal’s Algorithm Daa lab programs, Program to perform Minimum Spanning Tree using Kruskal’s Algorithm using C lang&lt;/h2&gt;
&lt;script src=&quot;https://gist.github.com/Sai551/451121466ed65e8fe1472af621eddbdb.js&quot;&gt;&lt;/script&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj2CxKmhIkWZoL_LTyfgO52nMHahpd3zOFWX_Z4lHf3OxsWrqeujY0TiXhYzrr1oHzskdNbXb8zhlCkWgsxVC_cgPlrrw2rhv-gPXxMlDRonwI0aIPA0nSnOTIvV07FYYd0OyqnUXsg-I1e/s1600/h.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj2CxKmhIkWZoL_LTyfgO52nMHahpd3zOFWX_Z4lHf3OxsWrqeujY0TiXhYzrr1oHzskdNbXb8zhlCkWgsxVC_cgPlrrw2rhv-gPXxMlDRonwI0aIPA0nSnOTIvV07FYYd0OyqnUXsg-I1e/s1600/h.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/minimum-spanning-tree-using-kruskal-algorithm-c-program.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj2CxKmhIkWZoL_LTyfgO52nMHahpd3zOFWX_Z4lHf3OxsWrqeujY0TiXhYzrr1oHzskdNbXb8zhlCkWgsxVC_cgPlrrw2rhv-gPXxMlDRonwI0aIPA0nSnOTIvV07FYYd0OyqnUXsg-I1e/s72-c/h.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-3795246895050785716</guid><pubDate>Fri, 15 May 2020 15:40:00 +0000</pubDate><atom:updated>2020-05-23T19:02:55.809+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Travelling Salesman Problem daa lab program in C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs Travelling Salesman Problem c program, Travelling Salesman Problem Daa lab programs, Program to perform Travelling Salesman Problem using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
int a[10][10], visited[10], n, cost = 0;
void get() {
    int i, j;
    printf(&amp;quot;\n\nEnter Number of Cities: &amp;quot;);
    scanf(&amp;quot;%d&amp;quot;, &amp; n);
    printf(&amp;quot;\nEnter Cost Matrix: \n&amp;quot;);
    for (i = 0; i &lt; n; i++) {
        printf(&amp;quot;\n Enter Elements of Row # : %d\n&amp;quot;, i + 1);
        for (j = 0; j &lt; n; j++)
            scanf(&amp;quot;%d&amp;quot;, &amp; a[i][j]);
        visited[i] = 0;
    }
    printf(&amp;quot;\n\nThe Cost Matrix is:\n&amp;quot;);
    for (i = 0; i &lt; n; i++) {
        printf(&amp;quot;\n\n&amp;quot;);
        for (j = 0; j &lt; n; j++)
            printf(&amp;quot;\t%d&amp;quot;, a[i][j]);
    }
}&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/travelling-salesman-problem-daa-lab-program-c-lang.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/travelling-salesman-problem-daa-lab-program-c-lang.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiB2IYB4tIVFomT6LTpA-GpB9vNqilB0bzq446eb9JTjcsYaOcp-WBRxqlGORRlessyCELRhsJ9eMJiYFZGozUtE5qYGzn_64TNlhHgYwdAkdqF8ZSzJxa305ce4rNpAjsAG8Za_rblfgTC/s72-c/h.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4202706241939693893</guid><pubDate>Fri, 15 May 2020 15:35:00 +0000</pubDate><atom:updated>2020-05-23T19:02:45.718+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Knapsack Problem program using Greedy Solution daa lab in C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs Knapsack Problem using Greedy Solution c program, Knapsack Problem using Greedy Solution Daa lab programs, Program to perform Knapsack Problem using Greedy Solution using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
void knapsack(int n, float weight[], float profit[], float capacity) {
    float x[20], tp = 0;
    int i, j, u;
    u = capacity;
    for (i = 0; i &lt; n; i++)
        x[i] = 0.0;
    for (i = 0; i &lt; n; i++) {
        if (weight[i] &gt; u)
            break;
        else {
            x[i] = 1.0;
            tp = tp + profit[i];
            u = u - weight[i];
        }
    }&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/knapsack-problem-using-greedy-solution-c-lang-program.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/knapsack-problem-using-greedy-solution-c-lang-program.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjeuTY5NKvBq6eN5_a8buRJdpRjcsB3LHdhNEOdjJP-4EH-mFpWVKNNZJGiunaeiXYbDfoPQ3BhYa5pIXzai3XTa8xeUEPNxRDjnnIdOGwTg7_d-XCIWhRxC8bRY35keuTc_g7YDxMj_R2l/s72-c/h.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4513151469791186409</guid><pubDate>Fri, 15 May 2020 14:28:00 +0000</pubDate><atom:updated>2020-05-23T19:02:34.398+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Radix Sort daa lab C language program</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs radix sort c program, radix sort Daa lab programs, Program to perform radix sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
radix_sort(int array[], int n);
void main() {
    int array[100], n, i;
    clrscr();
    printf(&amp;quot;\t\t\tRadix Sort\n\n\n\n&amp;quot;);
    printf(&amp;quot;Enter the number of elements to be sorted: &amp;quot;);
    scanf(&amp;quot;%d&amp;quot;, &amp; n);
    printf(&amp;quot;\nEnter the elements to be sorted: \n&amp;quot;);
    for (i = 0; i &lt; n; i++) {
        printf(&amp;quot;\tArray[%d] = &amp;quot;, i);
        scanf(&amp;quot;%d&amp;quot;, &amp; array[i]);
    }
    printf(&amp;quot;\nArray Before Radix Sort:&amp;quot;); //Array Before Radix Sort
    for (i = 0; i &lt; n; i++) {
        printf(&amp;quot;%8d&amp;quot;, array[i]);
    }
    printf(&amp;quot;\n&amp;quot;);
    radix_sort(array, n);
    printf(&amp;quot;\nArray After Radix Sort: &amp;quot;); //Array After Radix Sort
    for (i = 0; i &lt; n; i++) {
        printf(&amp;quot;%8d&amp;quot;, array[i]);
    }
    printf(&amp;quot;\n&amp;quot;);
    getch();
}&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/radix-sort-daa-lab-c-language-program-sorting-manual-output.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/radix-sort-daa-lab-c-language-program-sorting-manual-output.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjW2-rQSQi89fsgPULjPKJkAL7OZd8NDb0LXHg_YPo36Muw0t-VVV8xW3aStXkeIEmxLp6RwaYK3Eg2DLLFAz_CkhW4lq24tEfGQCHtDQ7X3M3UeRC7jotGy1Z-lKawGXBUnuvLJdC1wX4O/s72-c/h.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-2673876041629082922</guid><pubDate>Thu, 14 May 2020 14:02:00 +0000</pubDate><atom:updated>2020-05-23T19:02:25.315+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Merge Sorting daa program in C language </title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
JNTU DAA subject lab programs merge sort c program, merge sort Daa lab programs, Program to perform merge sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
 void mergesort(int arr[], int l, int h);
void main(void)
{
int array[100],n,i = 0;
clrscr();
printf(&quot;\t\t\tMerge Sort\n\n\n\n&quot;);
printf(&quot;Enter the number of elements to be sorted: &quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;\nEnter the elements to be sorted: \n&quot;);
for(i = 0 ; i &lt; n ; i++ )
{
printf(&quot;\tArray[%d] = &quot;,i);
scanf(&quot;%d&quot;,&amp;array[i]);
}
printf(&quot;\nBefore Mergesort:&quot;);
for(i = 0; i &lt; n; i++)
{
printf(&quot;%4d&quot;, array[i]);
}
printf(&quot;\n&quot;);
mergesort(array, 0, n - 1);
printf(&quot;\nAfter Mergesort:&quot;);
for(i = 0; i &lt; n; i++)
{
printf(&quot;%4d&quot;, array[i]);
}
printf(&quot;\n&quot;);
getch();
}
void mergesort(int arr[], int l, int h)
{
int i = 0;
int length = h - l + 1;
int pivot  = 0;
int merge1 = 0;
int merge2 = 0;
int temp[100];
if(l == h)
return;
pivot  = (l + h) / 2;
mergesort(arr, l, pivot);
mergesort(arr, pivot + 1, h);
for(i = 0; i &lt; length; i++)
{
temp[i] = arr[l + i];
}
merge1 = 0;
merge2 = pivot - l + 1;
for(i = 0; i &lt; length; i++)
{
if(merge2 &lt;= h - l)
{
if(merge1 &lt;= pivot - l)
{
if(temp[merge1] &gt; temp[merge2])
{
arr[i + l] = temp[merge2++];
}
else
{
arr[i + l] = temp[merge1++];
}
}
else
{
arr[i + l] = temp[merge2++];
}
}
else
{
arr[i + l] = temp[merge1++];
}
}
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh7PTrArcyHOD0l9QcwI_V8caFTo9vE57blvtzBl-pENp8YiWwxi0O9NdIWASofN9zuW6fidVd-QHoM9nbqjnKJrqsMafyTw1BywhAxlmQd-_3B6UOpy4jNfV-e34VP-ic4-9G9cok3YFtv/s1600/j.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh7PTrArcyHOD0l9QcwI_V8caFTo9vE57blvtzBl-pENp8YiWwxi0O9NdIWASofN9zuW6fidVd-QHoM9nbqjnKJrqsMafyTw1BywhAxlmQd-_3B6UOpy4jNfV-e34VP-ic4-9G9cok3YFtv/s1600/j.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/merge-sorting-daa-program-c-language-daa-lab-manual.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh7PTrArcyHOD0l9QcwI_V8caFTo9vE57blvtzBl-pENp8YiWwxi0O9NdIWASofN9zuW6fidVd-QHoM9nbqjnKJrqsMafyTw1BywhAxlmQd-_3B6UOpy4jNfV-e34VP-ic4-9G9cok3YFtv/s72-c/j.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-2340607869761457186</guid><pubDate>Thu, 14 May 2020 13:58:00 +0000</pubDate><atom:updated>2020-05-23T19:02:13.211+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Counting Sort program in C language</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs counting sort c program, counting sort Daa lab programs, Program to perform counting sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
 void Counting_sort(int A[], int k, int n)
{
int i, j;
int B[15], C[100];
for(i = 0; i &amp;lt;= k; i++)
C[i] = 0;
for(j =1; j &lt;= n; j++)
C[A[j]] = C[A[j]] + 1;
for(i = 1; i &lt;= k; i++)
C[i] = C[i] + C[i-1];
for(j = n; j &gt;= 1; j--)
{
B[C[A[j]]] = A[j];
C[A[j]] = C[A[j]] - 1;
}
printf(&quot;\nThe Sorted array is :\n&quot;);
for(i = 1; i &lt;= n; i++)
printf(&quot;\t%d&quot;,B[i]);
}
void main()
{
clrscr();
int n,i,k = 0, A[15];
printf(&quot;\t\tCOUNTING SORT ALGORITHM\n\n\n\n&quot;);
printf(&quot;Enter the number of input : &quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;\n\nEnter the elements to be sorted :\n&quot;);
for ( i = 1; i &lt;= n; i++)
{
scanf(&quot;%d&quot;,&amp;A[i]);
if(A[i] &gt; k)
{
k = A[i];
}
}
Counting_sort(A, k, n);
getch();
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgMwwCCC1tYZ6RFdiftFpZasre54mpoz77i5BbiiczUMvgkgDojsYzNY7Lz7-K1IcMhN7sR06HdWXzCbUdBytrMP17c0Welg4jJKaukrIFwli706lfQFp99cf4hwAKrhDvd5fgsRu8ObipF/s1600/ss.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgMwwCCC1tYZ6RFdiftFpZasre54mpoz77i5BbiiczUMvgkgDojsYzNY7Lz7-K1IcMhN7sR06HdWXzCbUdBytrMP17c0Welg4jJKaukrIFwli706lfQFp99cf4hwAKrhDvd5fgsRu8ObipF/s1600/ss.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/counting-sort-program-c-language-daa-lab.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgMwwCCC1tYZ6RFdiftFpZasre54mpoz77i5BbiiczUMvgkgDojsYzNY7Lz7-K1IcMhN7sR06HdWXzCbUdBytrMP17c0Welg4jJKaukrIFwli706lfQFp99cf4hwAKrhDvd5fgsRu8ObipF/s72-c/ss.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-7570339183268361700</guid><pubDate>Thu, 14 May 2020 13:37:00 +0000</pubDate><atom:updated>2020-05-23T19:01:42.776+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Quick Sort C lang program daa lab</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject lab programs Quick sort c program, Quick sort Daa lab programs, Program to perform Quick sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
void quicksort(int [10],int,int);
void main()
{
clrscr();
int a[20],n,i;
printf(&quot;Enter size of the array:\n&quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;Enter %d elements:\n&quot;,n);
for(i=0;i&amp;lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;a[i]);
}
quicksort(a,0,n-1);
printf(&quot;Sorted elements:\n &quot;);
for(i=0;i&amp;lt;n;i++)
{
printf(&quot;\t%d&quot;,a[i]);
}
getch();
}
void quicksort(int a[10],int first,int last)
{
int pivot,j,temp,i;
if(first&amp;lt;last)
{
pivot=first;
i=first;
j=last;
while(i&amp;lt;j)
{
while(a[i]&amp;lt;=a[pivot]&amp;&amp;i&amp;lt;last)
i++;
while(a[j]&amp;gt;a[pivot])
j--;
if(i&amp;lt;j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
temp=a[pivot];
a[pivot]=a[j];
a[j]=temp;
quicksort(a,first,j-1);
quicksort(a,j+1,last);
}
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhc74_FHrRchgYh9iQzp8cwjmhTyKHqDJhLQcBir70oi0pgeAy187sO0QyOX09UeLemeuSVOijPvPHZQNMkBGBVT4xSy0t47gHBPWeCdzpnamp-lL7Uv0HiuzzBw8m0HfJ8m5zYN1SIs1i1/s1600/ss.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhc74_FHrRchgYh9iQzp8cwjmhTyKHqDJhLQcBir70oi0pgeAy187sO0QyOX09UeLemeuSVOijPvPHZQNMkBGBVT4xSy0t47gHBPWeCdzpnamp-lL7Uv0HiuzzBw8m0HfJ8m5zYN1SIs1i1/s1600/ss.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;</description><link>http://download-ppts.blogspot.com/2020/05/quick-sort-c-program-daa-lab-manual-language.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhc74_FHrRchgYh9iQzp8cwjmhTyKHqDJhLQcBir70oi0pgeAy187sO0QyOX09UeLemeuSVOijPvPHZQNMkBGBVT4xSy0t47gHBPWeCdzpnamp-lL7Uv0HiuzzBw8m0HfJ8m5zYN1SIs1i1/s72-c/ss.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-2701430582716971950</guid><pubDate>Thu, 14 May 2020 13:31:00 +0000</pubDate><atom:updated>2020-05-23T19:01:31.967+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Heap Sorting daa program in C language</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject Heap sort c program, Heap sort Daa lab programs, Program to perform Heap sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
 void heapsort(int[], int);
void heapify(int[], int);
void adjust(int[], int);
int main()
{
int array[50],n,i;
clrscr();
printf(&quot;Enter the no. of elements to be sorted:\n &quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;Enter %d elements: \n&quot;,n);
for(i=0 ; i&lt;n ; i++)
{
scanf(&quot;%d&quot;,&amp;array[i]);
}
heapsort(array,n);
printf(&quot;Sorted list in ascending order using heap sort is:\n&quot;);
for(i = 0; i &lt; n; i++)
{
printf(&quot;%d\t&quot;, array[i]);
}
printf(&quot;\n&quot;);
getch();
return 0;
}
void heapsort(int array[], int n)
{
int i,t;
heapify(array,n);
for(i=n-1 ; i&gt;0 ; i--)
{
t = array[0];
array[0] = array[i];
array[i] = t;
adjust(array,i);
}
}
void heapify(int array[], int n)
{
int item,i,j,k;
for(k=1 ; k&lt;n ; k++)
{
item = array[k];
i = k;
j = (i-1)/2;
while( (i&gt;0) &amp;&amp; (item&gt;array[j]) )
{
array[i] = array[j];
i = j;
j = (i-1)/2;
}
array[i] = item;
}
}
void adjust(int array[], int n)
{
int item,i,j;
j = 0;
item = array[j];
i = 2*j+1;
while(i&lt;=n-1)
{
if(i+1 &lt;= n-1)
if(array[i] &lt; array[i+1])
i++;
if(item &lt; array[i])
{
array[j] = array[i];
j = i;
i = 2*j+1;
}
else
break;
}
array[j] = item;
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhNCzqcLjNQwMyF35Ur1MEuxuBn8u20MWkQnGM5jgYV7hrOe-RFBRdwjtS2EegZPv545tuRcYHHR_sJLg1-6dcIAhIo6m2CBeTrjW-IAsM5zDbazBMmOJGwWxGg5tAro3k91HEY6Kx8HxPY/s1600/ss.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhNCzqcLjNQwMyF35Ur1MEuxuBn8u20MWkQnGM5jgYV7hrOe-RFBRdwjtS2EegZPv545tuRcYHHR_sJLg1-6dcIAhIo6m2CBeTrjW-IAsM5zDbazBMmOJGwWxGg5tAro3k91HEY6Kx8HxPY/s1600/ss.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/heap-sort-daa-lab-program-manual-c-language.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhNCzqcLjNQwMyF35Ur1MEuxuBn8u20MWkQnGM5jgYV7hrOe-RFBRdwjtS2EegZPv545tuRcYHHR_sJLg1-6dcIAhIo6m2CBeTrjW-IAsM5zDbazBMmOJGwWxGg5tAro3k91HEY6Kx8HxPY/s72-c/ss.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-7294990297633599832</guid><pubDate>Thu, 14 May 2020 13:26:00 +0000</pubDate><atom:updated>2020-05-23T19:01:11.307+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Selection Sort DAA Program in C language</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;
DAA subject Selection sorting c program, Selection sort Daa lab programs, Program to perform Selection sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
 void main()
{
clrscr();
int i,position,swap,a[100],d,n;
printf(&quot;Enter The No. Of Elements\n&quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;Enter %d Integers\n&quot;,n);
for(i=0;i&lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;a[i]);
}
for(i=0;i&lt;(n-1);i++)
{
position=i;
for(d=c+1;d&lt;n;d++)
{
if(array[position]&gt;array[d])
position=d;
}
if(position!=i)
{
swap=a[i];
a[i]=a[position];
a[position]=swap;
}
}
printf(&quot;Sorted List in Ascending Order is:\n&quot;);
for(i=0;i&lt;=n;i++)
{
printf(&quot;%d\t&quot;,a[i]);
}
getch();
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhPiWdVNDtf1rtkAEjz4-qUd10m-Mz4zuIzGUi3l1IoeFbqUd2UMu_6TP8SpFkUigrdIseZl-3qJXskJPFsFKTTdbp7rykPDAq-m6xIDGhBgj5MJ8RVhBrKQ69m-i44XpphvwFK5MrKVHc9/s1600/d06cdf7d-7ece-4d26-8868-c4bcc538ed17.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img alt=&quot;www.jntuhelp.com&quot; border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhPiWdVNDtf1rtkAEjz4-qUd10m-Mz4zuIzGUi3l1IoeFbqUd2UMu_6TP8SpFkUigrdIseZl-3qJXskJPFsFKTTdbp7rykPDAq-m6xIDGhBgj5MJ8RVhBrKQ69m-i44XpphvwFK5MrKVHc9/s1600/d06cdf7d-7ece-4d26-8868-c4bcc538ed17.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/selection-sort-daa-program-c-language-lab-manual.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhPiWdVNDtf1rtkAEjz4-qUd10m-Mz4zuIzGUi3l1IoeFbqUd2UMu_6TP8SpFkUigrdIseZl-3qJXskJPFsFKTTdbp7rykPDAq-m6xIDGhBgj5MJ8RVhBrKQ69m-i44XpphvwFK5MrKVHc9/s72-c/d06cdf7d-7ece-4d26-8868-c4bcc538ed17.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-6797383426508155309</guid><pubDate>Thu, 14 May 2020 07:17:00 +0000</pubDate><atom:updated>2020-05-23T19:02:01.951+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">DAA</category><category domain="http://www.blogger.com/atom/ns#">lab-programs</category><title>Insertion Sort program using C lang</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: left;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt;DAA subject Insertion sorting c program, Daa lab programs, Program to perform insertion sorting using C lang&lt;/h2&gt;
&lt;pre&gt;&lt;code&gt;#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
void main()
{
clrscr();
int i,t,a[100],d,n;
printf(&quot;Enter The No. Of Elements\n&quot;);
scanf(&quot;%d&quot;,&amp;amp;n);
printf(&quot;Enter %d Integers\n&quot;,n);
for(i=0;i&amp;lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;amp;a[i]);
}
for(i=1;i&amp;lt;=n-1;i++)
{
d=i;
while(d&amp;gt;0&amp;amp;&amp;amp;a[d]&amp;lt;a[d-1])
{
t=a[d];
a[d]=a[d-1];
a[d-1]=t;
d--;
}
}
printf(&quot;Sorted List in Ascending Order is:\n&quot;);
for(i=0;i&amp;lt;=n-1;i++)
{
printf(&quot;%d\t&quot;,a[i]);
}
getch();
}
&lt;/code&gt;&lt;/pre&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;br /&gt;
&lt;span lang=&quot;EN-IN&quot; style=&quot;font-size: 12.0pt; mso-bidi-font-size: 11.0pt;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh263cghrhiTy1b7HP4PmogshRonQk7f1AorjCFrdtsyUmju0mT5FeTuVfLvpbjwrwsHNVlgjEMi8CPU6Z_GNiCkpxjlbHBQwWtNeS1kz6JYF2_jNWzhlVk_fW5he0HhDFawG5bYuRoV8jT/s640/download.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; data-original-height=&quot;429&quot; data-original-width=&quot;640&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh263cghrhiTy1b7HP4PmogshRonQk7f1AorjCFrdtsyUmju0mT5FeTuVfLvpbjwrwsHNVlgjEMi8CPU6Z_GNiCkpxjlbHBQwWtNeS1kz6JYF2_jNWzhlVk_fW5he0HhDFawG5bYuRoV8jT/s1600/download.jpg&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;MsoNoSpacing&quot;&gt;
&lt;/div&gt;
&lt;/div&gt;
</description><link>http://download-ppts.blogspot.com/2020/05/daa-program-perform-insertion-sorting-c-language.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh263cghrhiTy1b7HP4PmogshRonQk7f1AorjCFrdtsyUmju0mT5FeTuVfLvpbjwrwsHNVlgjEMi8CPU6Z_GNiCkpxjlbHBQwWtNeS1kz6JYF2_jNWzhlVk_fW5he0HhDFawG5bYuRoV8jT/s72-c/download.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4707619955769494893</guid><pubDate>Wed, 13 May 2020 15:13:00 +0000</pubDate><atom:updated>2020-05-13T20:43:12.669+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><category domain="http://www.blogger.com/atom/ns#">Nano Technology</category><title>Transparent Conductive Carbon Nanotube films</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: justify;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt; Transparent, Conductive Carbon nanotube films Paper Presentation, Transparent Technology pdf,  Transparent invisible, Nano Electronics Conductive Carbon nano tubes films Nano technology ppt ( Seminar Paper Presentations Materials Projects )&lt;/h2&gt;
&lt;b&gt;Abstract:&lt;/b&gt;We describe a simple process for the fabrication of ultrathin, transparent,
optically homogeneous, electrically conducting films of pure single-walled
carbon nano tubes and the transfer of those films to various substrates. For
equivalent sheet resistance, the films exhibit optical transmittance comparable
to that of commercial indium tin oxide in the visible spectrum, but
far superior transmittance in the technologically relevant 2- to 5-micrometer
infrared spectral band. These characteristics indicate broad applicability
of the films for electrical coupling in photonic devices. In an example
application, the films are used to construct an electric field–activated optical
modulator, which constitutes an optical analog to the nanotube-based field
effect transistor.
&lt;br&gt; &lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/transparent-conductive-carbon-nano-tube-electronics-ppt-pdf-topics.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/transparent-conductive-carbon-nano-tube-electronics-ppt-pdf-topics.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjgReUsekqO_qwYEEgLe4m3wbVRYBeHUwtLEgblI_sOlnA3xVBo7g7IUYlej2Z-RbubwumpykNOOO5r4V40uhSpyAMN4g2w5zI8asJcyR5Ir1kEhsp1qBnMb3bHAlz4OUC7ck42ZkFUYXP/s72-c/download_icon.gif" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-6526107959077692071</guid><pubDate>Tue, 12 May 2020 14:57:00 +0000</pubDate><atom:updated>2020-05-12T20:27:48.547+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">Artificial Intelligence</category><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><title>Artificial Intelligence in Computer Games </title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: justify;&quot; trbidi=&quot;on&quot;&gt;
&lt;h2&gt; Artificial Intelligence in Computer Games Paper Presentation, AI based PC Games pdf,  Artificial intelligence games technology ppt ( Seminar Paper Presentations Materials Projects )&lt;/h2&gt;
&lt;b&gt;Abstract:&lt;/b&gt;In computer games, Artificial Intelligence generally means creating
computer players that can think rationally and also can act humanly.
First problems of game AI were solved by making challenging
computer players that play the best move. But as the games involved
more imagination, new problems emerged such as designing
humanly behaving and responding characters.
Games are traditionally played by a group of players. Few
examples are chess, hide-and-seek, football. In contrast, many
computer games are single-player. So, there is a problem of
interactivity in computer games. If the player perceives the game to
be a deterministic machine, giving predictable outcomes, it probably
will no longer feel like a game. To solve this problem, AI programmers
create rational agents in the game to give the illusion of human
players. If the player is faced by the challenge to win against
intelligent rational opponents, the game feels more like a game.
&lt;br&gt; &lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/artificial-intelligence-computer-games-cse-ppt-pdf.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/artificial-intelligence-computer-games-cse-ppt-pdf.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjgReUsekqO_qwYEEgLe4m3wbVRYBeHUwtLEgblI_sOlnA3xVBo7g7IUYlej2Z-RbubwumpykNOOO5r4V40uhSpyAMN4g2w5zI8asJcyR5Ir1kEhsp1qBnMb3bHAlz4OUC7ck42ZkFUYXP/s72-c/download_icon.gif" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7544684674467029764.post-4121708116759898286</guid><pubDate>Sat, 09 May 2020 10:54:00 +0000</pubDate><atom:updated>2020-05-25T17:25:57.531+05:30</atom:updated><category domain="http://www.blogger.com/atom/ns#">CSE</category><category domain="http://www.blogger.com/atom/ns#">ECE</category><category domain="http://www.blogger.com/atom/ns#">EEE</category><category domain="http://www.blogger.com/atom/ns#">Parallel Computing</category><title>Parallel Computing in India ppt</title><description>&lt;div dir=&quot;ltr&quot; style=&quot;text-align: justify;&quot; trbidi=&quot;on&quot;&gt;
&lt;h3&gt; Parallel computing in india Paper Presentation, Parallel processing pdf, Parallel computing technology ppt ( Seminar Paper Presentations Materials Projects )&lt;/h3&gt;
&lt;b&gt;Abstract:&lt;/b&gt;Parallel computing has been a subject of interest in the computing community over the last few decades. Ever-growing size of databases and increasing complexity of the new problems are putting great stress on the even the super-fast modern single processor computers. Now the entire computer science community all over the world is looking for some computing environment where current computational capacity can be enhanced by a factor in order of thousands. The most obvious solution is the introduction of multiple processors working in tandem i.e. the introduction of parallel computing.
Parallel computing is the simultaneous execution of the same task, split into subtasks, on multiple processors in order to obtain results faster. The idea is based on the fact that the process of solving a problem can usually be divided into smaller tasks, which may be solved out simultaneously with some coordination mechanisms.
&lt;br&gt; &lt;/div&gt;&lt;a href=&quot;http://download-ppts.blogspot.com/2020/05/parallel-processing-india-computing-cse-ece-ppts.html#more&quot;&gt;&lt;/a&gt;</description><link>http://download-ppts.blogspot.com/2020/05/parallel-processing-india-computing-cse-ece-ppts.html</link><author>noreply@blogger.com (Unknown)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjgReUsekqO_qwYEEgLe4m3wbVRYBeHUwtLEgblI_sOlnA3xVBo7g7IUYlej2Z-RbubwumpykNOOO5r4V40uhSpyAMN4g2w5zI8asJcyR5Ir1kEhsp1qBnMb3bHAlz4OUC7ck42ZkFUYXP/s72-c/download_icon.gif" height="72" width="72"/><thr:total>0</thr:total></item></channel></rss>