{"id":959,"date":"2016-11-13T18:29:21","date_gmt":"2016-11-13T18:29:21","guid":{"rendered":"http:\/\/www.inspirenignite.com\/anna-university\/?p=959"},"modified":"2019-07-17T13:21:09","modified_gmt":"2019-07-17T13:21:09","slug":"anna-university-b-tech-ece-r13-3rd-sem-digital-electronics-detailed-syllabus","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-ece-r13-3rd-sem-digital-electronics-detailed-syllabus\/","title":{"rendered":"Anna University B.Tech ECE (R13) 3rd Sem Digital Electronics Detailed Syllabus"},"content":{"rendered":"<p>Digital Electronics Syllabus for B.Tech 3rd sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n<p>The detailed syllabus for Digital Electronics B.Tech (R13) thirdsem is as follows<\/p>\n<p><strong>OBJECTIVES:<\/strong><\/p>\n<ul>\n<li>To introduce basic postulates of Boolean algebra and shows the correlation between Boolean expressions<\/li>\n<li>To introduce the methods for simplifying Boolean expressions<\/li>\n<li>To outline the formal procedures for the analysis and design of combinational circuits<\/li>\n<li>and sequential circuits<\/li>\n<li>To introduce the concept of memories and programmable logic devices.<\/li>\n<li>To illustrate the concept of synchronous and asynchronous sequential circuits<\/li>\n<\/ul>\n<p><strong>UNIT I : MINIMIZATION TECHNIQUES AND LOGIC GATES<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 [9 hours]<\/p>\n<p>Minimization Techniques: Boolean postulates and laws \u2013 De-Morgan\u201fs Theorem &#8211; Principle of Duality &#8211; Boolean expression &#8211; Minimization of Boolean expressions \u2013\u2013 Minterm \u2013 Maxterm &#8211; Sum of Products (SOP) \u2013 Product of Sums (POS) \u2013 Karnaugh map Minimization \u2013 Don\u201ft care conditions \u2013 Quine &#8211; Mc Cluskey method of minimization. Logic Gates: AND, OR, NOT, NAND, NOR, Exclusive\u2013OR and Exclusive\u2013NOR Implementations of Logic Functions using gates, NAND\u2013NOR implementations \u2013 Multi\u00a0level gate implementations- Multi output gate implementations. TTL and CMOS Logic and their characteristics \u2013 Tristate gates<\/p>\n<p><strong>UNIT II : COMBINATIONAL CIRCUITS<\/strong> \u00a0 \u00a0\u00a0[9 hours]<\/p>\n<p>Design procedure \u2013 Half adder \u2013 Full Adder \u2013 Half subtractor \u2013 Full subtractor \u2013 Parallel binary adder, parallel binary Subtractor \u2013 Fast Adder &#8211; Carry Look Ahead adder \u2013 Serial Adder\/Subtractor &#8211; BCD adder \u2013 Binary Multiplier \u2013 Binary Divider &#8211; Multiplexer\/ Demultiplexer \u2013 decoder &#8211; encoder \u2013 parity checker \u2013 parity generators \u2013 code converters &#8211; Magnitude Comparator.<\/p>\n<p><strong>UNIT III : SEQUENTIAL CIRCUITS<\/strong> \u00a0 \u00a0 \u00a0\u00a0[9 hours]<\/p>\n<p>Latches, Flip-flops &#8211; SR, JK, D, T, and Master-Slave \u2013 Characteristic table and equation \u2013Application table \u2013 Edge triggering \u2013 Level Triggering \u2013 Realization of one flip flop using other flip flops \u2013 serial adder\/subtractor- Asynchronous Ripple or serial counter \u2013 Asynchronous Up\/Down counter &#8211; Synchronous counters \u2013 Synchronous Up\/Down counters \u2013 Programmable counters \u2013 Design of Synchronous counters: state diagram- State table \u2013State minimization \u2013State assignment &#8211; Excitation table and maps-Circuit implementation &#8211; Modulo\u2013n counter, Registers \u2013 shift registers &#8211; Universal shift registers \u2013 Shift register counters \u2013 Ring counter \u2013 Shift counters &#8211; Sequence generators.<\/p>\n<p style=\"text-align: center\"><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><strong>Download iStudy\u00a0Android\u00a0App for complete Anna University syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.<\/strong><\/a><\/p>\n<p><strong>TOTAL: 45 PERIODS <\/strong><\/p>\n<p><strong>OUTCOMES:<\/strong> Students will be able to:<\/p>\n<ul>\n<li>Analyze different methods used for simplification of Boolean expressions.<\/li>\n<li>Design and implement Combinational circuits.<\/li>\n<li>Design and implement synchronous and asynchronous sequential circuits.<\/li>\n<li>Write simple HDL codes for the circuits.<\/li>\n<\/ul>\n<p><strong>TEXT BOOK:<\/strong><\/p>\n<ul>\n<li>M. Morris Mano, \u201cDigital Design\u201d, 4th Edition, Prentice Hall of India Pvt. Ltd., 2008 \/ Pearson Education (Singapore) Pvt. Ltd., New Delhi, 2003.<\/li>\n<\/ul>\n<p><strong>REFERENCES:<\/strong><\/p>\n<ul>\n<li>John F.Wakerly, \u201cDigital Design\u201d, Fourth Edition, Pearson\/PHI, 2008<\/li>\n<li>John.M Yarbrough, \u201cDigital Logic Applications and Design\u201d, Thomson Learning, 2006.<\/li>\n<li>Charles H.Roth. \u201cFundamentals of Logic Design\u201d, 6th Edition, Thomson Learning, 2013.<\/li>\n<li>Donald P.Leach and Albert Paul Malvino, \u201cDigital Principles and Applications\u201d, 6th Edition, TMH, 2006. AULibrary.com<\/li>\n<li>5. Thomas L. Floyd, \u201cDigital Fundamentals\u201d, 10th Edition, Pearson Education Inc, 2011<\/li>\n<li>Donald D.Givone, \u201cDigital Principles and Design\u201d, TMH, 2003.<\/li>\n<\/ul>\n<p>For all other B.Tech ECE 3rd sem syllabus go to <a href=\"http:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-electronics-and-communication-engineering-3rd-sem-course-structure-for-r13-batch\/\">Anna University B.Tech Electronics and Communication Engineering (ECE) 3rd Sem Course Structure for (R13) Batch<\/a>.All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Digital Electronics Syllabus for B.Tech 3rd sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course. The [&hellip;]<\/p>\n","protected":false},"author":2259,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-959","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/959","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=959"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/959\/revisions"}],"predecessor-version":[{"id":10830,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/959\/revisions\/10830"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=959"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=959"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=959"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}