{"id":576,"date":"2010-07-07T23:31:18","date_gmt":"2010-07-07T18:01:18","guid":{"rendered":"http:\/\/JitendraZaa.com\/blog\/?p=576"},"modified":"2016-01-10T22:08:47","modified_gmt":"2016-01-10T22:08:47","slug":"be-3rd-sem-cse-syllabus-of-rtm-nagpur-university","status":"publish","type":"post","link":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-3rd-sem-cse-syllabus-of-rtm-nagpur-university\/","title":{"rendered":"BE 3rd sem CSE syllabus of RTM Nagpur University"},"content":{"rendered":"

33CS1: Applied Mathematics<\/h3>\n

Unit 1:<\/strong>
\nIntegral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple properties. Simple applications of Laplace transforms to-solve ordinary differential equations including simultaneous equation Application to one dimensional partial differential equations. The z-transform definition and properties, inversion, relation with Laplace transform, Application of
\nz-transform to solve difference equations with constant coefficients.<\/p>\n

Unit 2:<\/strong>
\nComplex variables Analytic function, Cauchy-Riemann conditions, conjugate, functions, singularities, Cauchy’s integral theorem and integral formula (Statement only) Taylor’s and Laurent’s theorem(statement only) Residue
\ntheorem, contour integration.<\/p>\n

Unit 3:<\/strong>
\nCalculus of Variations Maxima and Minima of functional, variation and its properties Euler’s-equation, functional dependent on first and second
\norder derivatives, simple applications.<\/p>\n

Unit 4:<\/strong>
\nFourier Series Periodic function and their Fourier expansion. Even and odd function, change of interval half range expansion. Partial Differential Equation: Partial-Differential Equation of first order first degree, i.e Langrange’s form, Linear Homogeneous P.D.E. of Nth order with constant coeffient method of separation of variables.<\/p>\n

Unit 5:<\/strong>
\nMatrices Inverse of matrix by partitioning method, Inverse of a matrix by adjoint method and its use solving – simultaneous equation, Rank of matrix, Consistency of a system of equation, Linear dependence, linear and orthogonal transformations.<\/p>\n

Unit 6:<\/strong>
\nMatrices Characteristic equation, Eigenvalues, Eigenvectors, Reduction of a diagonal form, Statement and verification of Cayley-Hamilton theorem; Sylvester’s theorem, Association of matrices with linear differential equation of second order with a constant coefficient, Determination of largest eigenvalue by iteration method.<\/p>\n

Text Books:<\/strong>
\n\u00b7 Advanced Engineering Mathematics, kreyzig
\n\u00b7 Higher Engineering Mathematics, B.S. Grewal<\/p>\n

Reference Books:<\/strong>
\n\u00b7 Mathematics of Engineers, Chandrika Prasad
\n\u00b7 Advance Mathematics for Engineers, Chandrika Prasad
\n\u00b7 Applied Mathematics for Engineers, L.A. Pipes & Harville
\n\u00b7 A Text Book of Applied Mathematics, P.N. Wartikar & J. N. Wartikar<\/p>\n

33CS2: Programming Fundamentals In “C”<\/h3>\n

UNIT-I<\/strong>
\nIntroduction to programming, programming languages, algorithms, flowcharts. C: Data types, Identifiers, Storage class, Constant, Operators, expression, Statements, console I\/O statements, Selection statements: if-else, switch, Iteration Statements: for, while, do-while, Jump statements: return, go to, break, continue, comments.<\/p>\n

UNIT-II<\/strong>
\nFunction, Call by value, Call by reference, calling functions with arrays, arguments to main(), return statements, recursion, function prototypes, inline keyword, preprocessor directives. Pointers: pointer variables, pointer operator, pointer expression, array of pointers, multiple indirection, pointers to functions, dynamic allocation functions.<\/p>\n

UNIT-III<\/strong>
\nArrays : single dimensional arrays, two dimensional arrays, multidimensional arrays, variable length arrays. Strings, array
\nof strings.
\n UNIT-IV<\/strong>
\nStructures : array of structures, passing structure to function, structure pointers, structure within structures. Unions, bitfields, enumerations, size of, type def.<\/p>\n

UNIT-V<\/strong>
\nFile I\/O : Streams and files, file system basics, fread, fwrite, fseek, random access I\/O, fprintf(), fscanf(), standard streams.<\/p>\n

UNIT \u2013 VI<\/strong>
\nAdvanced Concepts in C: Different types of pointers, ROM-BIOS functions, Elementary TSRs.<\/p>\n

Text Books:<\/strong>
\n\u00b7 The Complete Reference C ( 4th Edition) : Herbert Schildt [ TMH]
\n\u00b7 C How to Program, 4th Edition by H. M. Deitel & P. J. Deitel, Pearson Education.
\n\u00b7 Writing TSRs through C : Yashwant Kanetkar ( BPB)<\/p>\n

Reference Books :<\/strong>
\n\u00b7 The C Programming Language : Dennis Ritchie & Brain Kernighan [Pearson]
\n\u00b7 Programming with C : K.R.Venugopal & S.R.Prasad [TMH]
\n\u00b7 Let Us C : Yashwant Kanetkar [BPB]<\/p>\n

33CS3: Digital Circuits & Fundamental of Microprocessor:<\/h3>\n

UNIT-I:<\/strong>
\nMotivation for digital systems \u2013 Logic and Boolean algebra, Number System: Binary ,Hexadecimal ,Octal ,Gray. Gates & truth tables, propositions, Demorgan’s law minimization of combinational circuits using Karnaugh maps.<\/p>\n

UNIT-II:<\/strong>
\nMultiplexers, Demultiplexer , Encoders ,Decoders ,Code Converters, Adders , Subtractor (Half ,Full),BCD Adder\/Subtractor , ripple and carry look-ahead addition.<\/p>\n

UNIT-III:<\/strong>
\nStorage elements, Flip-flops and latches: D, T, J\/K, S\/R flip-flops. Master Slave Conversion of one of type of F\/F to another.<\/p>\n

UNIT-IV:<\/strong>
\nCounters, asynchronous and synchronous-design using state and excitation tables.<\/p>\n

UNIT-V:<\/strong>
\nIntroduction to mp 8085, Addressing modes, Instruction Set of mp 8085<\/p>\n

UNIT-VI:<\/strong>
\nInterrupts of 8085, Programming of mp 8085.<\/p>\n

Text books :<\/strong>
\n\u00b7 Digital Design 3rd Edition by M. Morris Mano, Pearson Education
\n\u00b7 Digital logic and Computer Design by M. Morris Mano, Pearson Education
\n\u00b7 Digital Cicuit & Design \u2013R.P.Jain
\n\u00b7 Digital circuit & design- A.P.Godse
\n\u00b7 Fundamental Of Digital Electronics- A.Anand Kumar
\n\u00b7 8 bit microprocessor & controller \u2013V.J.Vibhute
\n\u00b7 8 bit Microprocessor \u2013 Gaonkar.<\/p>\n

33CS4: Combinatorial Theories<\/h3>\n

UNIT 1:<\/strong>
\nCombinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions. Examples using ordinary power series and exponential generating functions, general properties of such functions.
\nDirichlet Series as generating functions. A general family of problems described in terms of “cards, decks and handa” with solution methods using generating
\nfunctions.<\/p>\n

UNIT II:<\/strong>
\nGenerating function proofs of the sieve formula and of various combinatorial identities. Certifying combinatorial identities. Some analytical methods and asymptotic results. Polya’s counting theorem. Basics of graph theory. Introduction to probabilistic method in combinatorics.<\/p>\n

UNIT III:<\/strong>
\nNumber Theory Examples of continued fractions. The study of the continued fractions. Alpha has infinite continued fraction if alpha is irrational.
\nFormal logic: Propositional logic: proof system, semantics, completeness, compactness. Length of proofs, polynomial size proofs, efficiency of proof systems.<\/p>\n

UNIT IV:<\/strong>
\nAlpha has periodic continued fraction if alpha is quadratic irrational.
\nApplication to approximation of irrationals by rationals. Hurwitz’s Theorem.
\nFirst order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory. Some advanced topics.<\/p>\n

UNIT V:<\/strong>
\nApplication to solutions of Pell’s equation. Proof that means cos{(p x pi)\/q},for natural numbers p and q,are irrational(apart from obvious exceptions). Example : CS application of logic, introduction to modal and temporal logics, Or formal number theory including incompleteness theorem.<\/p>\n

UNIT VI:<\/strong>
\nLiouville’s Theoram on algebraic numbers.Construction of transcendental numbers.
\nElements of proof theory including cut elimination, Or zero-one law for first order logic.<\/p>\n

Text Book:<\/strong>
\n\u00b7 Niven, Zuckerman and Montgomery, An Introduction to the Theory of Numbers, (5th edition),1991,Wiley.<\/p>\n

33CS1: Applied Mathematics<\/h3>\n

Unit 1:<\/strong>
\nIntegral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple properties. Simple applications of Laplace transforms to-solve ordinary differential equations including simultaneous equation Application to one dimensional partial differential equations. The z-transform definition and properties, inversion, relation with Laplace transform, Application of
\nz-transform to solve difference equations with constant coefficients.<\/p>\n

Unit 2:<\/strong>
\nComplex variables Analytic function, Cauchy-Riemann conditions, conjugate, functions, singularities, Cauchy’s integral theorem and integral formula (Statement only) Taylor’s and Laurent’s theorem(statement only) Residue
\ntheorem, contour integration.<\/p>\n

Unit 3:<\/strong>
\nCalculus of Variations Maxima and Minima of functional, variation and its properties Euler’s-equation, functional dependent on first and second
\norder derivatives, simple applications.<\/p>\n

Unit 4:<\/strong>
\nFourier Series Periodic function and their Fourier expansion. Even and odd function, change of interval half range expansion. Partial Differential Equation: Partial-Differential Equation of first order first degree, i.e Langrange’s form, Linear Homogeneous P.D.E. of Nth order with constant coeffient method of separation of variables.<\/p>\n

Unit 5:<\/strong>
\nMatrices Inverse of matrix by partitioning method, Inverse of a matrix by adjoint method and its use solving – simultaneous equation, Rank of matrix, Consistency of a system of equation, Linear dependence, linear and orthogonal transformations.<\/p>\n

Unit 6:<\/strong>
\nMatrices Characteristic equation, Eigenvalues, Eigenvectors, Reduction of a diagonal form, Statement and verification of Cayley-Hamilton theorem; Sylvester’s theorem, Association of matrices with linear differential equation of second order with a constant coefficient, Determination of largest eigenvalue by iteration method.<\/p>\n

Text Books:<\/strong>
\n\u00b7 Advanced Engineering Mathematics, kreyzig
\n\u00b7 Higher Engineering Mathematics, B.S. Grewal<\/p>\n

Reference Books:<\/strong>
\n\u00b7 Mathematics of Engineers, Chandrika Prasad
\n\u00b7 Advance Mathematics for Engineers, Chandrika Prasad
\n\u00b7 Applied Mathematics for Engineers, L.A. Pipes & Harville
\n\u00b7 A Text Book of Applied Mathematics, P.N. Wartikar & J. N. Wartikar<\/p>\n

33CS2: Programming Fundamentals In “C”<\/h3>\n

UNIT-I<\/strong>
\nIntroduction to programming, programming languages, algorithms, flowcharts. C: Data types, Identifiers, Storage class, Constant, Operators, expression, Statements, console I\/O statements, Selection statements: if-else, switch, Iteration Statements: for, while, do-while, Jump statements: return, go to, break, continue, comments.<\/p>\n

UNIT-II<\/strong>
\nFunction, Call by value, Call by reference, calling functions with arrays, arguments to main(), return statements, recursion, function prototypes, inline keyword, preprocessor directives. Pointers: pointer variables, pointer operator, pointer expression, array of pointers, multiple indirection, pointers to functions, dynamic allocation functions.<\/p>\n

UNIT-III<\/strong>
\nArrays : single dimensional arrays, two dimensional arrays, multidimensional arrays, variable length arrays. Strings, array
\nof strings.
\n UNIT-IV<\/strong>
\nStructures : array of structures, passing structure to function, structure pointers, structure within structures. Unions, bitfields, enumerations, size of, type def.<\/p>\n

UNIT-V<\/strong>
\nFile I\/O : Streams and files, file system basics, fread, fwrite, fseek, random access I\/O, fprintf(), fscanf(), standard streams.<\/p>\n

UNIT \u2013 VI<\/strong>
\nAdvanced Concepts in C: Different types of pointers, ROM-BIOS functions, Elementary TSRs.<\/p>\n

Text Books:<\/strong>
\n\u00b7 The Complete Reference C ( 4th Edition) : Herbert Schildt [ TMH]
\n\u00b7 C How to Program, 4th Edition by H. M. Deitel & P. J. Deitel, Pearson Education.
\n\u00b7 Writing TSRs through C : Yashwant Kanetkar ( BPB)<\/p>\n

Reference Books :<\/strong>
\n\u00b7 The C Programming Language : Dennis Ritchie & Brain Kernighan [Pearson]
\n\u00b7 Programming with C : K.R.Venugopal & S.R.Prasad [TMH]
\n\u00b7 Let Us C : Yashwant Kanetkar [BPB]<\/p>\n

33CS3: Digital Circuits & Fundamental of Microprocessor:<\/h3>\n

UNIT-I:<\/strong>
\nMotivation for digital systems \u2013 Logic and Boolean algebra, Number System: Binary ,Hexadecimal ,Octal ,Gray. Gates & truth tables, propositions, Demorgan’s law minimization of combinational circuits using Karnaugh maps.<\/p>\n

UNIT-II:<\/strong>
\nMultiplexers, Demultiplexer , Encoders ,Decoders ,Code Converters, Adders , Subtractor (Half ,Full),BCD Adder\/Subtractor , ripple and carry look-ahead addition.<\/p>\n

UNIT-III:<\/strong>
\nStorage elements, Flip-flops and latches: D, T, J\/K, S\/R flip-flops. Master Slave Conversion of one of type of F\/F to another.<\/p>\n

UNIT-IV:<\/strong>
\nCounters, asynchronous and synchronous-design using state and excitation tables.<\/p>\n

UNIT-V:<\/strong>
\nIntroduction to mp 8085, Addressing modes, Instruction Set of mp 8085<\/p>\n

UNIT-VI:<\/strong>
\nInterrupts of 8085, Programming of mp 8085.<\/p>\n

Text books :<\/strong>
\n\u00b7 Digital Design 3rd Edition by M. Morris Mano, Pearson Education
\n\u00b7 Digital logic and Computer Design by M. Morris Mano, Pearson Education
\n\u00b7 Digital Cicuit & Design \u2013R.P.Jain
\n\u00b7 Digital circuit & design- A.P.Godse
\n\u00b7 Fundamental Of Digital Electronics- A.Anand Kumar
\n\u00b7 8 bit microprocessor & controller \u2013V.J.Vibhute
\n\u00b7 8 bit Microprocessor \u2013 Gaonkar.<\/p>\n

33CS4: Combinatorial Theories<\/h3>\n

UNIT 1:<\/strong>
\nCombinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions. Examples using ordinary power series and exponential generating functions, general properties of such functions.
\nDirichlet Series as generating functions. A general family of problems described in terms of “cards, decks and handa” with solution methods using generating
\nfunctions.<\/p>\n

UNIT II:<\/strong>
\nGenerating function proofs of the sieve formula and of various combinatorial identities. Certifying combinatorial identities. Some analytical methods and asymptotic results. Polya’s counting theorem. Basics of graph theory. Introduction to probabilistic method in combinatorics.<\/p>\n

UNIT III:<\/strong>
\nNumber Theory Examples of continued fractions. The study of the continued fractions. Alpha has infinite continued fraction if alpha is irrational.
\nFormal logic: Propositional logic: proof system, semantics, completeness, compactness. Length of proofs, polynomial size proofs, efficiency of proof systems.<\/p>\n

UNIT IV:<\/strong>
\nAlpha has periodic continued fraction if alpha is quadratic irrational.
\nApplication to approximation of irrationals by rationals. Hurwitz’s Theorem.
\nFirst order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory. Some advanced topics.<\/p>\n

UNIT V:<\/strong>
\nApplication to solutions of Pell’s equation. Proof that means cos{(p x pi)\/q},for natural numbers p and q,are irrational(apart from obvious exceptions). Example : CS application of logic, introduction to modal and temporal logics, Or formal number theory including incompleteness theorem.<\/p>\n

UNIT VI:<\/strong>
\nLiouville’s Theoram on algebraic numbers.Construction of transcendental numbers.
\nElements of proof theory including cut elimination, Or zero-one law for first order logic.<\/p>\n

Text Book:<\/strong>
\n\u00b7 Niven, Zuckerman and Montgomery, An Introduction to the Theory of Numbers, (5th edition),1991,Wiley.<\/p>\n

33CS5: Principles Of Management<\/h3>\n

UNIT I<\/strong>
\nNature and Functions of Management, Management yesterday and today, Planning and Decision making.<\/p>\n

UNIT II<\/strong>
\nManagement Information System: Introduction, Conceptual Foundations, Information System Requirement.<\/p>\n

UNIT III:<\/strong>
\nMarketing Management: Marketing concept, Indian Marketing Environment, Market segmentation, Market Planning, International Marketting.<\/p>\n

UNIT IV<\/strong>
\nFinancial Management<\/p>\n

UNIT V<\/strong>
\nHuman Resource Management: Human Resource Planning, Recruitment, Selection, Training and development, Security, Safety and Health<\/p>\n

UNIT VI<\/strong>
\nOrganization Behavior: Organization Structure and design. Designing Effective Organization, Managing Job Stress, Organization Development<\/p>\n

Textbooks :<\/strong>
\n\u00b7 Principles of management , P C Tripathi and P N Reddy
\n\u00b7 Management Information System,Gordan Davis and H. Olison McGraw Hill Pub.
\n\u00b7 Human Resources and Personal Management, William Werther and Keith Davis
\n\u00b7 Marketing Management, V S Ramaswamy and S Namakumari
\n\u00b7 Organization Behavior, High Arnold and Daniel Feldman McGraw Hill
\n\u00b7 Financial Management, Khanna<\/p>\n

33CS6: Computer Workshop<\/h3>\n

Practical to be based on following topics:
\n\u00b7 Study of PC Hardware:<\/strong>
\n\u00b7 Basic computer Organization
\n\u00b7 PC construction
\n\u00b7 Study of BIOS and CMOS
\n\u00b7 Working under DOS and WINDOWS operating systems:
\n\u00b7 Internal and External DOS commands.
\n\u00b7 Basics required for working under Windows operating System
\n\u00b7 Study of control panel.<\/p>\n

. Working under UNIX \/LINUX Operating Systems:<\/strong>
\n\u00b7 Structure: Unix Architecture
\n\u00b7 Features of UNIX operating system
\n\u00b7 Layered model of UNIX operating system (study of kernel and Shell)
\n\u00b7 General file commands and Directory commands
\n\u00b7 File structure and Directory structure<\/p>\n

Introduction to Networking Accessories:<\/strong>
\n\u00b7 Study of user connections.
\n\u00b7 Study of communication channels.
\n\u00b7 Study of network architecture (topologies)
\n\u00b7 Study of Network Types.<\/p>\n

Books to Refer:<\/strong>
\n\u00b7 Computer Fundamentals \u2013 Pradeep K.Sinha
\n\u00b7 Introduction to Computer Science by ITL ESL, Pearson Education.
\n\u00b7 Introdution to UNIX and shell programming by M.G. Venkateshmurthy, Pearson Education
\n\u00b7 Unix Shell programming \u2013Yeshwant Kanetkar<\/p>\n","protected":false},"excerpt":{"rendered":"

Third semester Syllabus of computer science of RTM Nagpur University<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"jz_research_post":"","_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[8],"tags":[357],"class_list":["post-576","post","type-post","status-publish","format-standard","hentry","category-rtm-nu","tag-students"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[{"id":1082,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-3rd-sem-it-syllabus-of-rtmnu-nagpur-university-information-technology\/","url_meta":{"origin":576,"position":0},"title":"BE 3rd sem IT syllabus of RTMNU (Nagpur university – Information Technology)","author":"Jitendra","date":"September 15, 2010","format":false,"excerpt":"BE 3rd sem IT syllabus of RTMNU (Nagpur university - Information Technology)","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":2319,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-7th-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":576,"position":1},"title":"BE 7th sem CSE syllabus of RTM Nagpur University","author":"Jitendra","date":"August 3, 2011","format":false,"excerpt":"BE 7th sem CSE syllabus of RTM Nagpur University","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":1099,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-7th-sem-it-syllabus-of-rtmnu-nagpur-university-information-technology\/","url_meta":{"origin":576,"position":2},"title":"BE 7th sem IT syllabus of RTMNU (Nagpur university – Information Technology)","author":"Jitendra","date":"September 15, 2010","format":false,"excerpt":"BE 7th sem IT syllabus of RTMNU (Nagpur university - Information Technology)","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":1086,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-4th-sem-it-syllabus-of-rtmnu-nagpur-university-information-technology\/","url_meta":{"origin":576,"position":3},"title":"BE 4th sem IT syllabus of RTMNU (Nagpur university – Information Technology)","author":"Jitendra","date":"September 15, 2010","format":false,"excerpt":"BE 4th sem IT syllabus of RTMNU (Nagpur university - Information Technology)","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":1089,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-5th-sem-it-syllabus-of-rtmnu-nagpur-university-information-technology\/","url_meta":{"origin":576,"position":4},"title":"BE 5th sem IT syllabus of RTMNU (Nagpur university – Information Technology)","author":"Jitendra","date":"September 15, 2010","format":false,"excerpt":"BE 5th sem IT syllabus of RTMNU (Nagpur university - Information Technology)","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":583,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-5th-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":576,"position":5},"title":"BE 5th sem CSE syllabus of RTM Nagpur university","author":"Jitendra","date":"July 7, 2010","format":false,"excerpt":"Fifth semester Syllabus of Computer science of RTM Nagpur University","rel":"","context":"In "RTM NU"","block_context":{"text":"RTM NU","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/others\/rtm-nu\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"jetpack_likes_enabled":true,"_links":{"self":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/576","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/comments?post=576"}],"version-history":[{"count":1,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/576\/revisions"}],"predecessor-version":[{"id":5224,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/576\/revisions\/5224"}],"wp:attachment":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/media?parent=576"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/categories?post=576"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/tags?post=576"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}