{"id":34082,"date":"2020-04-25T05:31:34","date_gmt":"2020-04-25T00:01:34","guid":{"rendered":"http:\/\/www.kopykitab.com\/blog\/?p=34082"},"modified":"2021-07-10T19:12:36","modified_gmt":"2021-07-10T13:42:36","slug":"rtu-syllabus-computer-science-engineering-4th-semester","status":"publish","type":"post","link":"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/","title":{"rendered":"RTU Syllabus Computer Science Engineering 4th Semester"},"content":{"rendered":"<p><strong>RTU Syllabus Computer Science Engineering 4th Semeste<\/strong>r: With the latest RTU Syllabus Computer Science Engineering 4th Semester students get to know the chapters and concepts to be covered in all subjects.<\/p>\n<p>The Syllabus for RTU Computer Science engineering 4th Semester gives students a clear understanding of the course structure and its objectives.<\/p>\n<p>Based on the score in Computer Science Engineering degree, you can apply for better career opportunities.<\/p>\n<ul>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-for-computer-science-engineering\/\" target=\"_blank\" rel=\"noopener noreferrer\">Check RTU Computer Science Engineering Syllabus For All Semesters<\/a><\/li>\n<\/ul>\n<p>In the depth knowledge in every topic of Computer Science Engineering 4th Semester will also helpful to crack the various competitive exams like Gate.<\/p>\n<p>Here we are providing you the complete guide on RTU Syllabus Computer Science Engineering 4th Semester 2020 and Marking Scheme.<\/p>\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_47_1 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"ez-toc-toggle-icon-1\"><label for=\"item-69d008704b934\" aria-label=\"Table of Content\"><span style=\"display: flex;align-items: center;width: 35px;height: 30px;justify-content: center;direction:ltr;\"><svg style=\"fill: #000000;color:#000000\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #000000;color:#000000\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/label><input  type=\"checkbox\" id=\"item-69d008704b934\"><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 eztoc-visibility-hide-by-default' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#rtu-syllabus-computer-science-engineering-4th-semester-2020\" title=\"RTU Syllabus Computer Science Engineering 4th Semester 2020\">RTU Syllabus Computer Science Engineering 4th Semester 2020<\/a><ul class='ez-toc-list-level-3'><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#rtu-kota-highlights\" title=\"RTU Kota Highlights:\">RTU Kota Highlights:<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#discrete-mathematics-structure\" title=\"Discrete Mathematics Structure\">Discrete Mathematics Structure<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#managerial-economics-and-financial-accounting\" title=\"Managerial Economics and Financial Accounting\">Managerial Economics and Financial Accounting<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#microprocessor-interfaces\" title=\"Microprocessor &amp; Interfaces\">Microprocessor &amp; Interfaces<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#database-management-system\" title=\"Database Management System\">Database Management System<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#theory-of-computation\" title=\"Theory Of Computation\">Theory Of Computation<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#data-communication-and-computer-networks\" title=\"Data Communication and Computer Networks\">Data Communication and Computer Networks<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#microprocessor-interfaces-lab\" title=\"Microprocessor &amp; Interfaces Lab\">Microprocessor &amp; Interfaces Lab<\/a><ul class='ez-toc-list-level-3'><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#list-of-experiments\" title=\"List of Experiments:\">List of Experiments:<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#database-management-system-lab\" title=\"Database Management System Lab\">Database Management System Lab<\/a><ul class='ez-toc-list-level-3'><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#list-of-experiments-2\" title=\"List of Experiments:\">List of Experiments:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#data-base-designing-project\" title=\"Data Base Designing Project:\">Data Base Designing Project:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-14\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#some-example-of-data-base-design-project-like\" title=\"Some example of data base design project like:\">Some example of data base design project like:<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-15\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#network-programming-lab\" title=\"Network Programming Lab\">Network Programming Lab<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-16\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#linux-shell-programming-lab\" title=\"Linux Shell Programming Lab\">Linux Shell Programming Lab<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-17\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#java-lab\" title=\"Java Lab\">Java Lab<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-18\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/#all-semester-syllabus-for-rtu-computer-science-engineering\" title=\"All Semester Syllabus for RTU Computer Science Engineering\">All Semester Syllabus for RTU Computer Science Engineering<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"rtu-syllabus-computer-science-engineering-4th-semester-2020\"><\/span>RTU Syllabus Computer Science Engineering 4th Semester 2020<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>4th semester is an important stage for Computer Science Engineering. It is important to score more in Computer Science engineering for future opportunities.<\/p>\n<p>To boost your semester exam preparation, you should have Computer Science 4th Semester books &amp; study materials, Previous years questions paper along with the latest RTU<span data-sheets-value=\"{&quot;1&quot;:2,&quot;2&quot;:&quot;rtu 4th sem syllabus&quot;}\" data-sheets-userformat=\"{&quot;2&quot;:14337,&quot;3&quot;:{&quot;1&quot;:1},&quot;14&quot;:{&quot;1&quot;:3,&quot;3&quot;:1},&quot;15&quot;:&quot;Arial&quot;,&quot;16&quot;:10}\"> 4th Sem Syllabus<\/span><\/p>\n<p>Before starting the complete guide on <span data-sheets-value=\"{&quot;1&quot;:2,&quot;2&quot;:&quot;4th sem rtu syllabus&quot;}\" data-sheets-userformat=\"{&quot;2&quot;:14337,&quot;3&quot;:{&quot;1&quot;:1},&quot;14&quot;:{&quot;1&quot;:3,&quot;3&quot;:1},&quot;15&quot;:&quot;Arial&quot;,&quot;16&quot;:10}\">4th Sem RTU Syllabus<\/span> 2020, let\u2019s check the highlights of RTU from the table below.<\/p>\n<h3><span class=\"ez-toc-section\" id=\"rtu-kota-highlights\"><\/span>RTU Kota Highlights:<span class=\"ez-toc-section-end\"><\/span><\/h3>\n<div>\n<div>\n<table border=\"1\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td>Establishment<\/td>\n<td>2006<\/td>\n<\/tr>\n<tr>\n<td>Formation<\/td>\n<td>Govt. of Rajasthan<\/td>\n<\/tr>\n<tr>\n<td>Type of University<\/td>\n<td>State<\/td>\n<\/tr>\n<tr>\n<td>Approvals<\/td>\n<td>UGC<\/td>\n<\/tr>\n<tr>\n<td>Admission through:<\/td>\n<td>Merit-Based<\/td>\n<\/tr>\n<tr>\n<td>Affiliations<\/td>\n<td>AICTE<\/td>\n<\/tr>\n<tr>\n<td>University Location<\/td>\n<td>Rajasthan Technical University,<br \/>\nRawathbhata Road Kota-324010, Rajasthan, India.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<p>Check the latest syllabus for RTU<span data-sheets-value=\"{&quot;1&quot;:2,&quot;2&quot;:&quot;rtu 4 sem syllabus&quot;}\" data-sheets-userformat=\"{&quot;2&quot;:14337,&quot;3&quot;:{&quot;1&quot;:1},&quot;14&quot;:{&quot;1&quot;:3,&quot;3&quot;:1},&quot;15&quot;:&quot;Arial&quot;,&quot;16&quot;:10}\"> 4 Sem Syllabus<\/span> from below.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"discrete-mathematics-structure\"><\/span>Discrete Mathematics Structure<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"41\"><strong>SN<\/strong><\/td>\n<td width=\"607\"><strong>Contents<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>1<\/strong><\/td>\n<td width=\"607\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>2<\/strong><\/td>\n<td width=\"607\"><strong>Set Theory: <\/strong>Definition of sets, countable and uncountable sets, Set operations, Partition of set, Cardinality (Inclusion-Exclusion &amp; Addition Principles) Venn Diagrams, proofs of some general identities on sets.<\/p>\n<p><strong>Relation: <\/strong>Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem.<\/p>\n<p><strong>Function: <\/strong>Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">induction, Proof by contradiction. Composition of Functions. The Pigeonhole and Generalized Pigeonhole Principles.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>3<\/strong><\/td>\n<td width=\"607\"><strong>Propositional Logic: <\/strong>Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. 2 way predicate logic.<\/p>\n<p>Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">recognizers.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>4<\/strong><\/td>\n<td width=\"607\"><strong>Posets, Hasse Diagram and Lattices: <\/strong>Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices.<\/p>\n<p><strong>Combinatorics: <\/strong>Introduction, Permutation and combination, Binomial Theorem, Multimodal Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms, linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions, Generating functions, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Solution by method of generating functions.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>5<\/strong><\/td>\n<td width=\"607\"><strong>Algebraic Structures: <\/strong>Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">results, Rings and Fields: definition and standard results.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>6<\/strong><\/td>\n<td width=\"607\"><strong>Graph Theory: <\/strong>Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">coloring, chromatic number, Isomorphism and Homomorphism of graphs, matching, vertex\/edge covering.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"managerial-economics-and-financial-accounting\"><\/span>Managerial Economics and Financial Accounting<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"42\"><strong>SN<\/strong><\/td>\n<td width=\"568\"><strong>CONTENTS<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>1<\/strong><\/td>\n<td width=\"568\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>2<\/strong><\/td>\n<td width=\"568\"><strong>Basic economic concepts-<\/strong><\/p>\n<p>Meaning, nature and scope of economics, deductive vs inductive methods, static and dynamics, Economic problems: scarcity and choice, circular flow of economic activity, national income-concepts <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">and measurement.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>3<\/strong><\/td>\n<td width=\"568\"><strong>Demand and Supply analysis-<\/strong><\/p>\n<p>Demand-types of demand, determinants of demand, demand function, elasticity of demand, demand forecasting \u2013purpose, determinants and methods, Supply-determinants of supply, supply function, elasticity of <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">supply.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>4<\/strong><\/td>\n<td width=\"568\"><strong>Production and Cost analysis-<\/strong><\/p>\n<p>Theory of production- production function, law of variable proportions, laws of returns to scale, production optimization, least cost combination of inputs, isoquants. Cost concepts-explicit and implicit cost, fixed and variable cost, opportunity cost, sunk costs, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">cost function, cost curves, cost and output decisions, cost estimation.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>5<\/strong><\/td>\n<td width=\"568\"><strong>Market structure and pricing theory-<\/strong><\/p>\n<p>Perfect competition, Monopoly, Monopolistic competition, Oligopoly.<\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>6<\/strong><\/td>\n<td width=\"568\"><strong>Financial statement analysis-<\/strong><\/p>\n<p>Balance sheet and related concepts, profit and loss statement and related concepts, financial ratio analysis, cash-flow analysis, funds- flow analysis, comparative financial statement, analysis and interpretation of financial statements, capital budgeting techniques.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Technical Communication<\/strong><\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"42\"><strong>SN<\/strong><\/td>\n<td width=\"568\"><strong>CONTENTS<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>1<\/strong><\/td>\n<td width=\"568\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>2<\/strong><\/td>\n<td width=\"568\"><strong>Introduction to Technical Communication- <\/strong>Definition of technical communication, Aspects of technical communication, forms of technical communication, importance of technical communication, technical communication skills (Listening, speaking, writing, reading <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">writing), linguistic ability, style in technical communication.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>3<\/strong><\/td>\n<td width=\"568\"><strong>Comprehension of Technical Materials\/Texts and Information Design &amp; development- <\/strong>Reading of technical texts, Reading and comprehending instructions and technical manuals, Interpreting and summarizing technical texts, Note-making. Introduction of different kinds of technical documents, Information collection, factors affecting <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">information and document design, Strategies for organization, Information design and writing for print and online media.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>4<\/strong><\/td>\n<td width=\"568\"><strong>Technical Writing, Grammar and Editing<\/strong>&#8211; Technical writing process, forms of technical discourse, Writing, drafts and revising, Basics of grammar, common error in writing and speaking, Study of advanced grammar, Editing strategies to achieve appropriate technical style, Introduction to advanced technical communication. Planning, drafting and writing Official Notes, Letters, E-mail, Resume, Job <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Application, Minutes of Meetings.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"42\"><strong>5<\/strong><\/td>\n<td width=\"568\"><strong>Advanced Technical Writing<\/strong>&#8211; Technical Reports, types of technical reports, Characteristics and formats and structure of technical reports. Technical Project Proposals, types of technical proposals, Characteristics and formats and structure of technical proposals. Technical Articles, types of technical articles, Writing strategies, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">structure and formats of technical articles.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"microprocessor-interfaces\"><\/span>Microprocessor &amp; Interfaces<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"41\"><strong>SN<\/strong><\/td>\n<td width=\"577\"><strong>Contents<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>1<\/strong><\/td>\n<td width=\"577\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>2<\/strong><\/td>\n<td width=\"577\">Introduction to Microprocessors, microcontroller; 8085 Microprocessor Architecture, pin description, Bus concept and organization; concept of multiplexing and de-multiplexing of buses; concept of static and <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">dynamic RAM, type of ROM, memory map.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>3<\/strong><\/td>\n<td width=\"577\">Software architecture registers and signals, Classification of instruction, Instruction set, addressing modes, Assembly Language Programming and Debugging, Programming Technique, instruction <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Format and timing.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>4<\/strong><\/td>\n<td width=\"577\">Advance Assembly Language Programming, Counter and time delay; types of Interrupt and their uses, RST instructions and their uses, 8259 programmable interrupt controller; Macros, subroutine; Stack-<span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">implementation and uses with examples; Memory interfacing.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>5<\/strong><\/td>\n<td width=\"577\">8085 Microprocessor interfacing:, 8255 Programmable Peripheral Interface, 8254 programmable interval timer, interfacing of <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Input\/output device, 8279 Key board\/Display interface.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>6<\/strong><\/td>\n<td width=\"577\">Microprocessor Application: Interfacing scanned multiplexed display and liquid crystal display, Interfacing and Matrix Keyboard, MPU <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Design; USART 8251, RS232C and RS422A, Parallel interface-Centronics and IEEE 488.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"database-management-system\"><\/span>Database Management System<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"41\"><strong>SN<\/strong><\/td>\n<td width=\"577\"><strong>Contents<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>1<\/strong><\/td>\n<td width=\"577\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>2<\/strong><\/td>\n<td width=\"577\"><strong>Introduction to database systems: <\/strong>Overview and History of DBMS. File System v\/s DBMS.Advantage of DBMS Describing and Storing Data in a DBMS.Queries in DBMS.Structure of a DBMS.<\/p>\n<p><strong>Entity Relationship model: <\/strong>Overview of Data Design Entities, Attributes and Entity Sets, Relationship and Relationship Sets. Features of the ER Model- Key Constraints, Participation Constraints, Weak Entities, Class Hierarchies, Aggregation, Conceptual Data Base, and Design with ER Model- Entity v\/s Attribute, Entity vs Relationship Binary vs Ternary Relationship and Aggregation v\/s ternary <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Relationship Conceptual Design for a Large Enterprise.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>3<\/strong><\/td>\n<td width=\"577\"><strong>Relationship Algebra and Calculus: <\/strong>Relationship Algebra Selection and Projection, Set Operations, Renaming, Joints, Division, Relation Calculus, Expressive Power of Algebra and Calculus.<\/p>\n<p><strong>SQL queries programming and Triggers: <\/strong>The Forms of a Basic SQL Query, Union, and Intersection and Except, Nested Queries, Correlated Nested Queries, Set-Comparison Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">and Active Databases.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>4<\/strong><\/td>\n<td width=\"577\"><strong>Schema refinement and Normal forms: <\/strong>Introductions to Schema Refinement, Functional Dependencies, Boyce-Codd Normal Forms, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Third Normal Form, Normalization-Decomposition into BCNF Decomposition into 3-NF.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>5<\/strong><\/td>\n<td width=\"577\"><strong>Transaction Processing: <\/strong>Introduction-Transaction State, Transaction properties, Concurrent Executions. Need of Serializability, Conflict vs. View Serializability, Testing for Serializability, Recoverable Schedules, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Cascadeless Schedules.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>6<\/strong><\/td>\n<td width=\"577\"><strong>Concurrency Control: Implementation of Concurrency: <\/strong>Lock-based protocols, Timestamp-based protocols, Validation-based protocols, Deadlock handling,<\/p>\n<p><strong style=\"font-size: inherit; font-family: inherit;\">Database Failure and Recovery: <\/strong><span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Database Failures, Recovery Schemes: Shadow Paging and Log-based Recovery, Recovery with<\/span><span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Concurrent transactions.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"theory-of-computation\"><\/span>Theory Of Computation<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"41\"><strong>SN<\/strong><\/td>\n<td width=\"577\"><strong>Contents<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>1<\/strong><\/td>\n<td width=\"577\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>2<\/strong><\/td>\n<td width=\"577\">Finite Automata &amp; Regular Expression: Basic machine, Finite state machine, Transition graph, Transition matrix, Deterministic and non- deterministic finite automation, Equivalence of DFA and NDFA, Decision properties, minimization of finite automata, Mealy &amp; Moore machines.<\/p>\n<p>Alphabet, words, Operations, Regular sets, relationship and conversion between Finite automata and regular expression and vice versa, designing regular expressions, closure properties of regular sets, Pumping lemma and regular sets, Myhill- Nerode theorem , Application <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">of pumping lemma, Power of the languages.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>3<\/strong><\/td>\n<td width=\"577\">Context Free Grammars (CFG), Derivations and Languages, Relationship between derivation and derivation trees, leftmost and rightmost derivation, sentential forms, parsing and ambiguity, simplification of CFG, normal forms, Greibach and Chomsky Normal form , Problems related to CNF and GNF including membership <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">problem.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>4<\/strong><\/td>\n<td width=\"577\">Nondeterministic PDA, Definitions, PDA and CFL, CFG for PDA, Deterministic PDA, and Deterministic PDA and Deterministic CFL , The pumping lemma for CFL\u2019s, Closure Properties and Decision properties <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">for CFL, Deciding properties of CFL.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>5<\/strong><\/td>\n<td width=\"577\">Turing Machines: Introduction, Definition of Turing Machine, TM as language Acceptors and Transducers, Computable Languages and functions, Universal TM &amp; Other modification, multiple tracks Turing Machine.<\/p>\n<p>Hierarchy of Formal languages: Recursive &amp; recursively enumerable languages, Properties of RL and REL, Introduction of Context sensitive <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">grammars and languages, The Chomsky Hierarchy.<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>6<\/strong><\/td>\n<td width=\"577\">Tractable and Untractable Problems: P, NP, NP complete and NP hard <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">problems, Un-decidability, examples of these problems like vertex cover problem, Hamiltonian path problem, traveling sales man problem.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"data-communication-and-computer-networks\"><\/span>Data Communication and Computer Networks<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<table>\n<tbody>\n<tr>\n<td width=\"41\"><strong>SN<\/strong><\/td>\n<td width=\"577\"><strong>Contents<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>1<\/strong><\/td>\n<td width=\"577\"><strong>Introduction: <\/strong>Objective, scope and outcome of the course.<\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>2<\/strong><\/td>\n<td width=\"577\">Introductory Concepts: Network hardware, Network software, topologies, Protocols and standards, OSI model, TCP model, TCP\/IP model, Physical Layer: Digital and Analog Signals, Periodic Analog Signals, Signal Transmission, Limitations of Data Rate, Digital Data Transmission, Performance Measures, Line Coding, Digital Modulation, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Media and Digital Transmission System<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>3<\/strong><\/td>\n<td width=\"577\">Data Link Layer: Error Detection and Correction, Types of Errors, Two dimensional parity check, Detection verses correction, Block Coding, Linear Block Coding, Cyclic Codes, Checksum, Standardized Polynomial Code, Error Correction Methods, Forward Error Correction, Protocols: Stop and wait, Go-back-N ARQ, Selective Repeat ARQ, Sliding window, Piggy backing, Pure ALOHA, Slotted ALOHA, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">CSMA\/CD, CSMA\/CA<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>4<\/strong><\/td>\n<td width=\"577\">Network Layer: Design issues, Routing algorithms: IPV4, IPV6, Address mapping: ARQ, RARQ, Congestion control, Unicast, Multicast, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">Broadcast routing protocols, Quality of Service, Internetworking<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>5<\/strong><\/td>\n<td width=\"577\">Transport Layer: Transport service, Elements of transport protocols, User Datagram Protocol, Transmission Control Protocol, Quality of <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">service, Leaky Bucket and Token Bucket algorithm<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"41\"><strong>6<\/strong><\/td>\n<td width=\"577\">Application Layer<strong>: <\/strong>WWW, DNS, Multimedia, Electronic mail, FTP, <span style=\"font-size: inherit; font-family: inherit; font-weight: inherit;\">HTTP, SMTP, Introduction to network security<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2><span class=\"ez-toc-section\" id=\"microprocessor-interfaces-lab\"><\/span>Microprocessor &amp; Interfaces Lab<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<h3><span class=\"ez-toc-section\" id=\"list-of-experiments\"><\/span><strong>List of Experiments:<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<ol>\n<li>Add the contents of memory locations XX00 &amp;XX01 &amp; place the result in memory location<\/li>\n<li>Add the 16 bit numbers stored in memory location &amp; store the result in another memory<\/li>\n<li>Transfer a block of data from memory location XX00 to another memory location XX00 in forward &amp; reverse<\/li>\n<li>Write a program to swap two blocks of data stored in<\/li>\n<li>Write a program to find the square of a<\/li>\n<li>Write a main program and a conversion subroutine to convert Binary to its equivalent BCD.<\/li>\n<li>Write a program to find largest &amp; smallest number from a given<\/li>\n<li>Write a program to Sort an array in ascending &amp; descending<\/li>\n<li>Write a program to multiply two 8 bit numbers whose result is 16<\/li>\n<li>Write a program of division of two 8 bit<\/li>\n<li>Generate square wave from SOD pin of 8085 &amp; observe on<\/li>\n<li>Write a program to perform traffic light control<\/li>\n<li>Write a program to control the speed of a motor.<\/li>\n<\/ol>\n<h2><span class=\"ez-toc-section\" id=\"database-management-system-lab\"><\/span>Database Management System Lab<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<h3><span class=\"ez-toc-section\" id=\"list-of-experiments-2\"><\/span><strong>List of Experiments:<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<ol>\n<li>Design a Database and create required tables. For e.g. Bank, College Database<\/li>\n<li>Apply the constraints like Primary Key, Foreign key, NOT NULL to the<\/li>\n<li>Write a SQL statement for implementing ALTER,UPDATE and<\/li>\n<li>Write the queries to implement the<\/li>\n<li>Write the query for implementing the following functions: MAX (), MIN (), AVG () and COUNT ().<\/li>\n<li>Write the query to implement the concept of Integrity<\/li>\n<li>Write the query to create the<\/li>\n<li>Perform the queries for<\/li>\n<li>Perform the following operation for demonstrating the insertion , updation and deletion<\/li>\n<li>Using the referential integrity constraints.<\/li>\n<li>Write the query for creating the users and their role.<\/li>\n<\/ol>\n<h3><span class=\"ez-toc-section\" id=\"data-base-designing-project\"><\/span><strong>Data Base Designing Project:<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p>For better understanding students (group of 3-4 students) should design data base for any data base project, understand the requirement and design methodology of project by its own.<\/p>\n<h3><span class=\"ez-toc-section\" id=\"some-example-of-data-base-design-project-like\"><\/span><strong>Some example of data base design project like:<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n<p>College management system, Inventory management system and Hospital management system.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"network-programming-lab\"><\/span>Network Programming Lab<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><strong>List of Experiments:<\/strong><\/p>\n<ol>\n<li>Study of Different Type of LAN&amp; Network<\/li>\n<li>Study and Verification of standard Network topologies i.e. Star, Bus, Ring<\/li>\n<li>LAN installations and<\/li>\n<li>Write a program to implement various types of error correcting<\/li>\n<li>Write a program to implement various types of framing<\/li>\n<li>Write two programs in C: hello_client and hello_server\n<ol>\n<li>The server listens for, and accepts, a single TCP connection; it reads all the data it can from that connection, and prints it to the screen; then it closes the connection<\/li>\n<li>The client connects to the server, sends the string \u201cHello, world!\u201d, then closes the connection<\/li>\n<\/ol>\n<\/li>\n<li>Write an Echo_Client and Echo_server using TCP to estimate the round trip time from client to the server. The server should be such that it can accept multiple connections at any given<\/li>\n<li>Repeat Exercises 6 &amp; 7 for<\/li>\n<li>Repeat Exercise 7 with multiplexed I\/O<\/li>\n<li>Simulate Bellman-Ford Routing algorithm in<\/li>\n<\/ol>\n<h2><span class=\"ez-toc-section\" id=\"linux-shell-programming-lab\"><\/span>Linux Shell Programming Lab<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><strong>List of Experiments:<\/strong><\/p>\n<ol>\n<li>Use of Basic Unix Shell Commands: ls, mkdir, rmdir, cd, cat, banner, touch, file, wc, sort, cut, grep, dd, dfspace, du,<\/li>\n<li>Commands related to inode, I\/O redirection and piping, process control commands, mails.<\/li>\n<li>Shell Programming: Shell script based on control structure- <strong>If-then-fi, if-then- else-if, nested if-else, to find:<\/strong>\n<ul>\n<li>Greatest among three<\/li>\n<li>To find a year is leap year or not.<\/li>\n<li>To input angles of a triangle and find out whether it is valid triangle or<\/li>\n<li>To check whether a character is alphabet, digit or special<\/li>\n<li>To calculate profit or<\/li>\n<\/ul>\n<\/li>\n<li>Shell Programming &#8211; Looping- while, until, for loops\n<ul>\n<li>Write a shell script to print all even and odd number from 1 to<\/li>\n<li>Write a shell script to print table of a given number<\/li>\n<li>Write a shell script to calculate factorial of a given<\/li>\n<li>Write a shell script to print sum of all even numbers from 1 to<\/li>\n<li>Write a shell script to print sum of digit of any<\/li>\n<\/ul>\n<\/li>\n<li>Shell Programming &#8211; case structure, use of break\n<ul>\n<li>Write a shell script to make a basic calculator which performs addition, subtraction,<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<p>Multiplication, division<\/p>\n<ul>\n<li>Write a shell script to print days of a<\/li>\n<li>Write a shell script to print starting 4 months having 31<\/li>\n<\/ul>\n<ol start=\"6\">\n<li>Shell Programming &#8211; Functions\n<ul>\n<li>Write a shell script to find a number is Armstrong or<\/li>\n<li>Write a shell script to find a number is palindrome or<\/li>\n<li>Write a shell script to print Fibonacci<\/li>\n<li>Write a shell script to find prime<\/li>\n<li>Write a shell script to convert binary to decimal and decimal to binary<\/li>\n<\/ul>\n<\/li>\n<li>Write a shell script to print different shapes- Diamond, triangle, square, rectangle, hollow square<\/li>\n<li>Shell Programming \u2013 Arrays\n<ul>\n<li>Write a C program to read and print elements of<\/li>\n<li>Write a C program to find sum of all array<\/li>\n<li>Write a C program to find reverse of an<\/li>\n<li>Write a C program to search an element in an<\/li>\n<li>Write a C program to sort array elements in ascending or descending<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<h2><span class=\"ez-toc-section\" id=\"java-lab\"><\/span>Java Lab<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p><strong>List of Experiment:<\/strong><\/p>\n<ol>\n<li>Develop an in depth understanding of programming in Java: data types, variables, operators, operator precedence, Decision and control statements, arrays, switch statement, Iteration Statements, Jump Statements, Using break, Using continue,<\/li>\n<li>Write Object Oriented programs in Java: Objects, Classes constructors, returning and passing objects as parameter, Inheritance, Access Control, Using super, final with inheritance Overloading and overriding methods, Abstract classes, Extended classes.<\/li>\n<li>Develop understanding to developing packages &amp; Interfaces in Java: Package, concept of CLASSPATH, access modifiers, importing package, Defining and implementing interfaces.<\/li>\n<li>Develop understanding to developing Strings and exception handling: String constructors, special string operations, character extraction, searching and comparing strings, string Buffer class. Exception handling fundamentals, Exception types, uncaught exceptions, try, catch and multiple catch statements. Usage of throw, throws and<\/li>\n<li>Develop applications involving file handling: I\/O streams, File I\/O.<\/li>\n<li>Develop applications involving concurrency: Processes and Threads, Thread Objects, Defining and Starting a Thread, Pausing Execution with Sleep, Interrupts, Joins, and<\/li>\n<\/ol>\n<p><strong>Indicative List of exercises:<\/strong><\/p>\n<ol start=\"7\">\n<li>Programs to demonstrate basic concepts e.g. operators, classes, constructors, control &amp; iteration statements, recursion etc. such as complex arithmetic, matrix arithmetic, tower of Hanoi problem<\/li>\n<li>Development of programs\/projects to demonstrate concepts like inheritance, exception handling, packages, interfaces etc. such as application for electricity department, library management, ticket reservation system, payroll system<\/li>\n<li>Development of a project to demonstrate various file handling<\/li>\n<li>Develop applications involving Applet: Applet Fundamentals, using paint method and drawing polygons. It is expected that each laboratory assignments to given to the students with an aim to In order to achieve the above objectives.<\/li>\n<\/ol>\n<ul>\n<li><a href=\"http:\/\/www.rtu.ac.in\/RTU\/wp-content\/uploads\/2018\/11\/Syllabus-CS.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">Download RTU Computer Science 4th Sem Syllabus 2020<\/a><\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"all-semester-syllabus-for-rtu-computer-science-engineering\"><\/span><span id=\"other-important-study-materials-for-ugc-net-exam\"><span id=\"other-important-study-materials-for-cbse-class-10-maths\">All Semester Syllabus for RTU Computer Science Engineering<\/span><\/span><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>You should have the following syllabus to boost your exam preparation for the\u00a0<a title=\"RTU\" href=\"http:\/\/www.rtu.ac.in\/\" target=\"_blank\" rel=\"noopener noreferrer\">RTU<\/a> Computer Science Engineering.<\/p>\n<p>Click on the link to access all semester syllabus related to Computer Science Engineering.<\/p>\n<ul>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-3rd-semester\/\" target=\"_blank\" rel=\"noopener noreferrer\">3rd Semester Computer Science Syllabus &amp; Marking Scheme<\/a><\/li>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-5th-semester\/\" target=\"_blank\" rel=\"noopener noreferrer\">5th Semester Computer Science Syllabus\u00a0&amp; Marking Scheme<\/a><\/li>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-6th-semester\/\" target=\"_blank\" rel=\"noopener noreferrer\">6th Semester Computer Science Syllabus\u00a0&amp; Marking Scheme<\/a><\/li>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-7th-semester\/\" target=\"_blank\" rel=\"noopener noreferrer\">7th Semester Computer Science Syllabus\u00a0&amp; Marking Scheme<\/a><\/li>\n<li><a href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-8th-semester\/\" target=\"_blank\" rel=\"noopener noreferrer\">8th Semester Computer Science Syllabus\u00a0&amp; Marking Scheme<\/a><\/li>\n<\/ul>\n<p>We have covered the complete guide on RTU Syllabus Computer Science Engineering 4th Semester 2020. feel free to ask us any questions in the comment section below.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>RTU Syllabus Computer Science Engineering 4th Semester: With the latest RTU Syllabus Computer Science Engineering 4th Semester students get to know the chapters and concepts to be covered in all subjects. The Syllabus for RTU Computer Science engineering 4th Semester gives students a clear understanding of the course structure and its objectives. Based on the &#8230; <a title=\"RTU Syllabus Computer Science Engineering 4th Semester\" class=\"read-more\" href=\"https:\/\/www.kopykitab.com\/blog\/rtu-syllabus-computer-science-engineering-4th-semester\/\" aria-label=\"More on RTU Syllabus Computer Science Engineering 4th Semester\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":50393,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"fifu_image_url":"","fifu_image_alt":""},"categories":[1],"tags":[67526,759],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/posts\/34082"}],"collection":[{"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/comments?post=34082"}],"version-history":[{"count":5,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/posts\/34082\/revisions"}],"predecessor-version":[{"id":103680,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/posts\/34082\/revisions\/103680"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/media\/50393"}],"wp:attachment":[{"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/media?parent=34082"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/categories?post=34082"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kopykitab.com\/blog\/wp-json\/wp\/v2\/tags?post=34082"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}