Unit 1 :<\/strong> Unit 2 :<\/strong> Unit 3 :<\/strong> Unit 4 : <\/strong> Unit 5 : <\/strong> Unit 6 :<\/strong> Text Books:<\/strong> UNIT I<\/strong> UNIT II<\/strong> UNIT III<\/strong> UNIT IV<\/strong> UNIT V<\/strong> UNIT VI<\/strong> Textbooks:<\/strong> 44CS3: Business Data Processing<\/strong> UNIT-II:<\/strong> UNIT-III:<\/strong> UNIT-IV:<\/strong> UNIT-V:<\/strong> UNIT VI :<\/strong> For Practical: 10-12 experiments on COBOL based on above syllabus.<\/p>\n TEXT BOOKS:<\/strong> UNIT I<\/strong> UNIT II<\/strong> UNIT III<\/strong> UNIT IV<\/strong> UNIT V<\/strong> UNIT VI<\/strong> Text Books<\/strong> Reference Books<\/strong> 44CS5: Computer Architecture & Organization<\/strong><\/p>\n UNIT II<\/strong> UNIT III<\/strong> UNIT IV<\/strong> UNIT V<\/strong> UNIT VI<\/strong> BOOKS:\u00b7<\/strong> REFERENCES BOOKS:<\/strong> 44CS6: Internet Technologies<\/strong><\/p>\n Practical to be conducted based on following topics: TEXT BOOKS<\/strong> fourth semester syllabus of Computer science of 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-581","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":1086,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-4th-sem-it-syllabus-of-rtmnu-nagpur-university-information-technology\/","url_meta":{"origin":581,"position":0},"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":576,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-3rd-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":581,"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":581,"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":581,"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":581,"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":2319,"url":"https:\/\/www.jitendrazaa.com\/blog\/others\/rtm-nu\/be-7th-sem-cse-syllabus-of-rtm-nagpur-university\/","url_meta":{"origin":581,"position":5},"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":[]}],"jetpack_likes_enabled":true,"_links":{"self":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/581","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=581"}],"version-history":[{"count":1,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/581\/revisions"}],"predecessor-version":[{"id":5223,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/posts\/581\/revisions\/5223"}],"wp:attachment":[{"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/media?parent=581"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/categories?post=581"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.jitendrazaa.com\/blog\/wp-json\/wp\/v2\/tags?post=581"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nSet Theory Operation of Sets \u2013 relation and functions, partial order, equivalence relation peano axioms and inductions.<\/p>\n
\nMathematical Logic Propositions, predicate logic, formal mathematical system, algebra, Homomorphism, Automorphism.<\/p>\n
\nGroups Element of theory of some Algebras, semi group, monoid groups.<\/p>\n
\nRings Rings, fields, lattices, Boolean Algebra.<\/p>\n
\nGraph Theory Graphs, Hyper Graph, Transitive Closure, Spanning Trees.<\/p>\n
\nCombinatorics Generating Functions, recurrences, counting theorem and applications<\/p>\n
\n\u00b7 Discrete Mathematical Structures for computer science, Kolman \/ Rahman Pearson education.
\n\u00b7 Combinatorial Mathematics, C.L.Liu (McGraw Hill)
\n\u00b7 (Common to CS\/CT\/CE\/IT)44CS2: Data Structures And Program Design In ‘C’
\n\u00b7<\/p>\n44CS2: Data Structures & Program Design<\/h3>\n
\nGeneral concepts and linear data structures: Abstract data structure as an organization of data with specified properties and operations, Time and space analysis of algorithms, Big oh and theta notations and omega notations, Average, best and worst case analysis, Representation of Arrays -Single and Multi dimensional-Address calculation using column and row major ordering, Representation of Stacks and queues using arrays – Circular queues, Priority Queues, Dequeue, Application of stacks, Conversion from infix to post fix and pre-fix expressions, Evaluation of postfix expression using stacks, Multiple stacks<\/p>\n
\nLinked list: Linked Lists, Simply linked list, Implementation of linked list using static and dynamic memory allocationdynamic memory allocation, operations on list linked stacks and queues, polynomial representations and manipulations are using linked list, circular linked list, doubly linked list, Generalized list.<\/p>\n
\nTrees: General and binary trees, Representations and traversals, General trees as binary trees, Binary search trees, Applications, The concept of balancing and its advantages, B-Trees, B+ Trees, AVL Trees, Threaded Binary Trees.<\/p>\n
\nHashing: Hash functions, Collision resolution, Expected behavior, Applications<\/p>\n
\nGraphs and digraphs: Representations, Breadth and depth first searches, Connectivity algorithms, shortest path, Minimal spanning tree, The union find problem, Hamiltonian path<\/p>\n
\nSorting: Elementary sorts: selection, insertion, bubble sort, shell sort, Radix sort, Quick sort, merge sort, heapsort, Bucket sorting, External sorting, Worst case and average behavior, Lower bound for sorting using comparisons<\/p>\n
\n\u00b7 Data Structures using C and C++ by Y. Langsam, Pearson Education
\n\u00b7 Data Structures using C by Tenenbaum, Pearson Education
\n\u00b7 Data Structures using C by S. K. Bandyopadhyay, Pearson Education
\n\u00b7 S. Sahani, Data Structures in C,
\n\u00b7 D.Samantha, Classic Data Structure, PHI Publications
\n\u00b7 Data structures -Robert Kruse<\/p>\n
\nUNIT-I:<\/strong>
\nStructural Organization of COBOL: Character set, Words, Sentences, dentification Division, Environment Division, Data Division, Data types \u2013 numerical, lphabetic & alphanumeric, Input-output sections, Working storage sections, PROCEDURE division features: ACCEPT, DISPLAY, MOVE, Arithmetic & COMPUTE verbs, levels ,Error Handling, Sample programs, PERFORM & GOTO verbs, Sample programs using PERFORM, Miscellaneous COBOL statements.<\/p>\n
\nConditional Statements & Handling: Relation conditions, Nested conditions, Class conditions, Condition-name conditions, Justified clause, Structured programming forms of program structure, Structural flow charts, Subscripting, OCCURS clause, Multidimensional tables, Table handling with PERFORM verb.<\/p>\n
\nBusiness Files: Structured Flow charts, 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
\ninstructions 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 layout design, Heading, Date & Detailed summaries. Control breaks, Language specifications for COBOL report writing.<\/p>\n
\nAdvanced Tool manipulators like STRING, UNSTRING, INSPECT & COPY verbs, COBOL Subprogram and main Program.<\/p>\n
\n\u00b7 COBOL Programming with business application \u2013 N.L.Sarda
\n\u00b7 Information Systems through COBOL \u2013 Philippakis & Kazmier
\n\u00b7 Structured COBOL Programming \u2013 Stern & Stern
\n\u00b7 COBOL Programming by M. K. Roy, D. Ghosh Dastidar.<\/p>\n44CS4: Theoretical Foundations of Computer Science<\/h3>\n
\nMathematical preliminaries \u2013 Sets, operations, relations, strings, transitive closure, countability and diagonalisation, induction and proof methods- pigeon-hole principle and simple applications \u2013 concept of language \u2013 grammars and
\nproduction rules \u2013Chomsky hierarchy.<\/p>\n
\nFinite State machine, regular languages, deterministic finite automata, ,conversion to deterministic automata, E-closures \u2013regular expressions, finite automata, minimization of automata , Moore and Mealy machine and their equivalence.<\/p>\n
\nPumping lemma for regular sets- closure properties of regular sets- decision properties for regular sets, equivalence between regular language and regular grammar. Context \u2013 free languages \u2013 parse trees and ambiguity , reduction of
\nCFGS ,Chomsky and Griebach normal forms<\/p>\n
\nPush \u2013 down Automata (PDA) \u2013 non Determinism \u2013 acceptance by two methods and their equivalence ,conversion of PDA to CFG CFLs and PDAs- closure and decision properties of CFLs<\/p>\n
\nTuring machines \u2013 variants \u2013 recursively enumerable (r.e.) set \u2013 recursive sets
\nTM as computer of function \u2013 decidability and solvability \u2013 Halting Problem \u2013 reductions \u2013 Post correspondence Problem (PCP) and unsolvability of ambiguity problem of CFGs, Church’s hypothesis.<\/p>\n
\nIntroduction to recursive function theory \u2013 primitive recursive and partial recursive functions , Parsing: top down and bottom up approach, derivation and reduction<\/p>\n
\n\u00b7 Introduction to formal languages and automata \u2013 Peter Linz Norasa,2000.
\n\u00b7 Theory Of Computer Science \u2013Mishra and Chandrashekharan, PHI<\/p>\n
\n\u00b7 Introduction Of Automata Theory, Languages and computation- J.E. Hopcroft , J.D.Ulman, Pearson education.<\/p>\n
\nUNIT I<\/strong>
\nBASIC STRUCTURE OF COMPUTERS: Functional units, Basic operational concepts, Bus structures Addressing modes, subroutines: parameter passing, Instruction formats, expanding opcodes method. BASIC PROCESSING UNIT: bus architecture, Execution of a Complete Instruction, sequencing of control signals, Hardwired control, Microprogrammed Control, microinstruction format, Bit slice concept.<\/p>\n
\nARITHMETIC: Number representations and their operations, Design of Fast Adders, Signed multiplication, Booth’s Algorithm, bit-pair recoding, Integer Division, Floating point numbers and operations, guard bits and rounding.<\/p>\n
\nTHE MEMORY SYSTEM: various technologies used in memory design, higher order memory design, multimodule memories and interleaving, Associative Memory, Cache memory, Virtual Memory<\/p>\n
\nINPUT\/OUTPUT ORGANIZATION: I\/O mapped I\/O and memory mapped I\/O, interrupts and interrupt handling mechanisms, vectored interrupts, synchronous vs. asynchronous data transfer, Direct Memory Access COMPUTER PERIPHERALS: I\/O devices such as magnetic disk, magnetic tape, CDROM systems.<\/p>\n
\nRISC philosophy, pipelining, basic concepts in pipelining, delayed branch, branch prediction, data dependency, influence of pipelining on instruction set design, multiple execution units, performance considerations,<\/p>\n
\nBasic concepts in parallel processing & classification of parallel architectures. Vector Processing, Array Processors.<\/p>\n
\nV.C.Hamacher,Z.G.Vranesic and S.G.Zaky, Computer Organisation, McGraw Hill,5thed,2002.
\n\u00b7 Computer Architecture & Organization III Ed- J.P.Hayes.
\n\u00b7 A.S.Tanenbaum, “Structured Computer Organization” 4th Edition, Pearson Education<\/p>\n
\n\u00b7 M Mano, “Computer System and Architecture”, Pearson Education
\n\u00b7 W. Stallings, “Computer Organization & Architecture”,Pearson Education<\/p>\n
\n1) HTML: Standard use for www documents on internet, GML, SGML, HTML tags, special characters, Fonts, Lists,
\nImages, Tables, Forms and Frames.
\n2) DHTML: Introduction to CSS, Fonts in CSS, Text in CSS, Boxes in CSS, CSS positioning, Tables in CSS, Generated
\ncontent and lists in CSS.
\n3) XML: XML basics, understanding markup languages, structures and syntax, valid Vr well formed XML, DTD
\n(document type Definition) classes. Scripting XML, XML processor, parent child relationship, XML as a data, data type in
\nXML, XML namespaces, linking with XML simple link, the HTML way, XSL with style: style sheet basics, XSL basics,
\nXSL style sheets.
\n4) FRONTPAGE:
\n5) SECURITY:
\n6) Scripting Language: Perl Scripts, Java Scripts:
\n7) PHP<\/p>\n
\n\u00b7 XML in action web technology by William J. Pardi (PHI) Pub.
\n\u00b7 Web Technology by Ramesh Bangia (Firewall Media)
\n\u00b7 Programming the web using XML by Ellen Pearlman (Tata McGraw \u2013 Hill)<\/p>\n","protected":false},"excerpt":{"rendered":"