UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> <\/p>\n UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOKS:<\/strong> REFERENCES:<\/strong> UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOKS:<\/strong> UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOKS:<\/strong> REFERENCES:<\/strong> UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOKS:<\/strong> UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOK:<\/strong> REFERENCES:<\/strong> UNIT-I:<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> TEXT BOOKS:<\/strong> REFERENCES:<\/strong> 1. Introduction to Networking accessories. BE 4th sem IT syllabus of RTMNU (Nagpur university – Information Technology)<\/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_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":"","jetpack_post_was_ever_published":false},"categories":[8],"tags":[357],"class_list":["post-1086","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":581,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-4th-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":1086,"position":0},"title":"BE 4th sem CSE syllabus of RTM Nagpur university","author":"Jitendra","date":"July 7, 2010","format":false,"excerpt":"fourth semester syllabus of Computer science of 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":576,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-3rd-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":1086,"position":1},"title":"BE 3rd sem CSE syllabus of RTM Nagpur University","author":"Jitendra","date":"July 7, 2010","format":false,"excerpt":"Third 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":[]},{"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":1086,"position":2},"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":585,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-6th-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":1086,"position":3},"title":"BE 6th sem CSE syllabus of RTM Nagpur University","author":"Jitendra","date":"July 7, 2010","format":false,"excerpt":"Sixth Semester Syllabus of Computer Science of 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":1086,"position":4},"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":2024,"url":"https:\/\/www.jitendrazaa.com\/blog\/java\/complete-java-collection-tutorial-for-the-beginner\/","url_meta":{"origin":1086,"position":5},"title":"Complete Java Collection tutorial for the beginner","author":"Jitendra","date":"April 15, 2011","format":false,"excerpt":"Complete JAVA Collection tutorial for the beginner","rel":"","context":"In "JAVA"","block_context":{"text":"JAVA","link":"https:\/\/www.jitendrazaa.com\/blog\/category\/java\/"},"img":{"alt_text":"Java Collection Interfaces","src":"https:\/\/i0.wp.com\/jitendrazaa.com\/blog\/wp-content\/uploads\/2011\/04\/Java-Collection-Interfaces.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]}],"jetpack_likes_enabled":true,"_links":{"self":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/1086","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=1086"}],"version-history":[{"count":1,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/1086\/revisions"}],"predecessor-version":[{"id":5219,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/1086\/revisions\/5219"}],"wp:attachment":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/media?parent=1086"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/categories?post=1086"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/tags?post=1086"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nMathematical Logic and Set Theory: Statement and Notation, Negotiation, Conjunction, Disjunction, Tautologies, Truth tables, Basic concepts of set theory, Inclusion and equality of sets, The power set, Ordered pairs and n-tuples.<\/p>\n
\nRelations and Functions: Relation and ordering, Properties of Binary Relations in a set Relation Matrix and the Graphs a Relation, Partition and Covering of a set. Equivalence relation, Partial ordering, Partially ordered set, Functions (definition and introduction), Composition of functions, Inverse functions, Characteristics function of a set.<\/p>\n
\nGroup Theory: Semigroups and Monoids(defininitions and examples), Homomorphism of semigroups and monomoids, Subsemi groups and submonoids, Groups(definitions and examples) Subgroups and Homomorphisms, Cosets and Lanranges theorem, Normal
\nsubgroups, Codes and group codes.<\/p>\n
\nRings(definition and examples): Integral domains ring homomorphisms, Ideas of Ring polynomial.<\/p>\n
\nGraph Theory: Basic concepts of Graph Theory, Basic definitions, Paths and circuits. Rechability and connectedness, Matrix representation of graphs, Trees and their representation and operations, Rooted trees, Path lengths in rooted trees, Multi graphs and weighted graphs, Shortest paths in weighted graphs.<\/p>\n
\n1. Discrete Mathematics Structures with application to Computer Science by J. P.
\nTremblay & R. Manohar.
\n2. Discrete Maths for Computer Scientists & Mathematicians. (Chapter 2, 5, 7) by J. L. Mott, A. Kandel, T. P. Baker<\/p>\n
\nElements of Discrete Mathematics by C. L. Liu.
\nDiscrete Mathematics by Lipschutz
\nDiscrete Mathematics by R.Johnsonbaugh.<\/p>\n4IT23 ALGORITHM AND DATA STRUCTURES<\/h3>\n
\nIntroduction to algorithm: Analysis of algorithms. The asymptotic notations, Features of structured program, Recursion, Top down and bottom-up programming techniques, Divide and conquer strategy. Stacks and Queues: Fundamentals, Evaluation of expressions, Polish expressions and their compilation,
\nApplication of stacks, Multiple stacks and queues, Priority queues.<\/p>\n
\nLinked list: Single linked list, linked stacks and queues, The polynomial addition, Example on linked list, Equivalence relation, Circular linked list, Doubly linked list and Generalized list.<\/p>\n
\nSorting Methods: Internal and external sort, bubble sort, exchange, insertion, selection, merge, heap, radix and quick sort, Comparision with respect to their efficiency. Searching Methods: Sequential, binary, indexed search, Hashing techniques and collision handling mechanism.<\/p>\n
\nTrees: Definition and terminology, Representation, Tree traversal examples on trees, Threaded trees, Binary tree, Binary search tree, Operation on multi-way trees, B trees and B+ trees.<\/p>\n
\nGraph and their applications: Computer representation of Graphs, Traversal techniques like Breadth first search, Depth first search, Greedy algorithms-study with respect to shortest path, minimum cost spanning tree.
\nPRACTICALS based on above syllabus.<\/p>\n
\n1. An introduction to Data structures with Applications by Trembley J.P. & Sorenson P. G.
\n2. Algorithm, Data Structures & Programs by Niclaus Worth.
\n3. Data structures using C\/C++ by Tanenbaum.<\/p>\n4IT24 COMMUNICATION ELECTRONICS<\/h3>\n
\nAnalog Systems: Frequency spectrum of electromagnetic waves, Their properties,
\nProperties of Fourier transform, Convolution in time and frequency domain,
\nSampling theorem, Noise types, Sources.<\/p>\n
\nMechanism of amplitude modulation and detection, SSB, SSB-SC, DSB, Various techniques of generation and detection of FM, Comparision of various system based on SNR.<\/p>\n
\nDigital Systems: Bandwidth and rate of pulse transmission, Pulse spreading and interference, PSD of digital signals, Line coding, Digital multiplexing.<\/p>\n
\nPulse Modulation: PAM, PWM, PCM and PPM systems, quantization and noise, Delta modulation.<\/p>\n
\nDigital Carrier System, Salient features of ASK, FSK, PSK and DPSK systems, M-ary communication system.
\nPRACTICAL based on above syllabus:<\/p>\n
\n1. Modern Digital and Analog\u00a0Communication\u00a0System<\/span> by B. P. Lathi.
\n2. Communication System by B. P. Lathi.
\n3.\u00a0Digital\u00a0Communication<\/span> by Proakis.<\/p>\n
\n1. Communication Systems by A. B. Carlson.
\n2. Principle of Communication System by Taub & Schilling.
\n3. Communication Electronics by Kennedy.<\/p>\n4IT25 DATA PROCESSING AND FILE OIRGANIZATION<\/h3>\n
\nStructural Organization of COBOL: Character set, Words, Sentences, Identification Division, Environment Division, Data Division, Data types \u2013 numerical, Alphabetic & alphanumeric, Input-output sections, Working
\nstorage sections, PROCEDURE division features: ACCEPT, DISPLAY, MOVE, Arithmetic & COMPUTE verbs, Sample programs, PERFORM & GOTO verbs, STRING, UNSTRING, INSPECT & COPY verbs, Sample programs using PERFORM, Miscellaneous COBOL statements.<\/p>\n
\nConditional Statements & Handling: Relation conditions, Nested conditions, Class conditions, Conditionname conditions, Structured programming forms of program structure, Structural\u00a0flow\u00a0charts<\/span>, Subscripting, OCCURS clause, Multidimensional tables, Table handling with PERFORM verb.<\/p>\n
\nBusiness Files: Operation on files, Master files, Transaction file, Report file, Batch processing, On-line processing, case studies. Sequential Access Files: Principles of magnetic storage & accessing, Blocking, Inter record gap, Label records, COBOL language instructions for sequential files.<\/p>\n
\nDirect Access Files: Characteristics of disk storage & timing index, Indexed sequential files, COBOL instruction for indexed sequential files, relative file organization, Division-Remainder method, digital-analysis method, COBOL instructions for handling relative files.<\/p>\n
\nSorting, Searching & merging: Linear search sort, Merge sort, Chained record sort, Linear search, Binary search, File sorting & Merging using sequential files. Report Generation: Output\u00a0layout\u00a0design<\/span>, Heading, Date & Detailed summaries.Control breaks, Language specifications for COBOL report writing.
\nPRACTICALS based on above syllabus.<\/p>\n
\n1. Information System through COBOL by S. Philiphakis, Leenard.
\n2. COBOL Programming by M. K. Roy, D. Ghosh Dastidar.<\/p>\n4IT26 THEORY OF COMPUTATION<\/h3>\n
\nStrings, Alphabet, Language, Operations, Finite state machine, definitions, Finite automation model, Acceptance of strings and languages, Non Deterministic Finite Automation, Deterministic Finite Automation, Equivalence between NFA and DFA. Conversion of NFA into DFA, Minimization of FSM, Equivalence between two FSM’s. Moore and Melay machines.<\/p>\n
\nRegular sets, Regular expressions, Identify rules, Manipulation of regular expressions. Equivalence between RE and FA, Inter conversion, Pumping lemma, Closure properties of regular sets (proofs not required), Regular grammars, Right linear and left linear grammars, Equivalence between regular linear grammar and F.A. inter conversion between RE and RG.<\/p>\n
\nContext free grammar, Derivation trees, Chomsky Normal Form, Greibach Normal Form, Push Down Automata, Definition, Model, acceptance of CFL, Equivalence of CFL and PDA , Interconversion, enumeration of properties of CFL. (proofs omitted).<\/p>\n
\nTuring Machine, Definition, Model, Design of TM, Computable functions, Recursive ensumerable language, Church’s hypothesis, Counter machine, Types of TM’s (Proofs not required). Chomsky hierarchy of languages, Linear bounded automata and context sensitive language, Introduction of DCFL and DPDA, LR(0), grammar, Desidability of problems.<\/p>\n
\nUndecidability: Properties of recursive & non-recursive ensumarable languages, Universal Turing Machine, Post-correspondence problem, Introduction to recursive function theory.<\/p>\n
\n1. Introduction to Automata Theory, Languages and Computation by Hopcraft H. E. & Ulman J.
\n2. An Introduction to formal Languages and Automata by Peter Linz (Chapter 1 to 12 except 6.3 and 7.4)<\/p>\n
\n1. Introduction to Languages and the Theory of Automata by John C. Martin
\n2. Elements of Theory of Computation by Lewis H. P. and Papadimiton C. H.
\n3. Theory of Computation by Mishra and Chandrashekharan<\/p>\n4IT27 COMPUTER ARCHITECTURE AND ORGANIZATION<\/h3>\n
\nBasic Structure of Computer Hardware & Software: Functional unit, Basic operational concepts, Bus structures, Software performance, Distributed computing Addressing Methods & Machine Program sequencing: Memory locations, Addresses & encoding of information, Main memory operations, Instructions
\n& instruction sequencing, Addressing modes, Assembly language, Basic input-output operations, Stacks, Subroutines.<\/p>\n
\nThe 68000 example: Registers & addressing Instructions, Assembly language. Program flow control, Sorting example, Logic instructions, Program controlled I\/O, Subroutines. Power PC examples: Basic power PC organization, Load and storing instruction, Arithmetic and logical instructions, flow control instruction, Compare instructions Subroutines.<\/p>\n
\nThe\u00a0Processing\u00a0Unit<\/span>: Some fundamentals concepts, Execution of complete instruction, Hardware control, Performance considerations, Microprogrammed control Input-Output Organization: Accessing I\/O devices, Interrupts, DMA.<\/p>\n
\nArithmetic: Number representations, Addition of positive numbers, Logic design of fast adders, Addition & subtraction, Arithmetic & branching conditions, Multiplication of positive numbers, Signed operand multiplication, Fast multiplication, Fast multiplication, Integer division.<\/p>\n
\nThe Main Memory: Some basic concepts, Semiconductors RAM memories, Memory system consideration,\u00a0Semiconductor<\/span> ROM memories, Multiple-module memories and interleaving,\u00a0Cache\u00a0memories<\/span>, Virtual memories, Memory management requirements Pipelining: Basic concepts, Instruction queue, Branching, Data Dependency, Influence of pipelining on instruction set design, Multiple execution units, Performance considerations, Examples of CISC, RISC & stack processors.<\/p>\n
\nComputer Organization by V. C. Hamacher, Z. G. Vranesic and S. G. Zaky.
\nFourth Edition, McGraw Hill Publ.<\/p>\n
\nComputer Organization & Architecture by William Stalling.
\nComputer Architecture & Organization by J. P. Hayes, Third Ed., McGraw Hill Publ.<\/p>\n4IT28 COMPUTER WORKSHOP-II<\/h3>\n
\n2. Introduction to UNIX Operating System.
\n3. Introduction to MS-WORD & POWER-POINT.
\n4. Familiarity with Internet and World Wide Web.<\/p>\n","protected":false},"excerpt":{"rendered":"