Showing posts with label COMPUTER SCIENCE 4TH SEMESTER SYLLABUS. Show all posts
Showing posts with label COMPUTER SCIENCE 4TH SEMESTER SYLLABUS. Show all posts
TAGS:-RGPV 4TH SEM SYLLABUS I DOT NET SYLLABUS I DOT NET PROGRAMMING SYLLABUS I RGPV CSE 4TH SEM DOT NET SYLLABUS I LIST OF PRACTICAL I DOT NET PRACTICAL LIST I RGPV DOT NET PRACTICAL LIST I RGPV .NET SYLLABUS
Rajiv Gandhi Technological University, Bhopal (MP)
B.E. Computer Science Engg.
Semester :-IV
Subject :- DOT NET PROGRAMMING
Revised Syllabus and Scheme of Examination
Effective from July 2010
DOT NET PROGRAMMING(CS-406)
UNIT I
Introduction .NET framework, features of .Net framework, architecture and component of .Net, elements of .Net.
UNIT II
Basic Features Of C# Fundamentals:Classes and Objects, Inheritance and Polymorphism, Operator Overloading, Structures. Advanced Features Of C# Interfaces, Arrays, Indexers and Collections; Strings and Regular Expressions, Handling Exceptions, Delegates and Events.
UNIT III
Installing ASP.NET framework: overview of the ASP .net framework, overview of CLR, class library, overview of ASP.net control, understanding HTML controls, study of standard controls, validations controls, rich controls. Windows Forms: All about windows form, MDI form, creating windows applications, adding controls to forms, handling Events, and using various Tolls
UNIT IV
Understanding and handling controls event|: ADO.NET- Component object model, ODBC, OLEDB, and SQL connected mode, disconnected mode, dataset, data-reader Data base controls: Overview of data access data control, using grid view controls, using details view and frame view controls, ado .net data readers, SQL data source control, object data source control, site map data source.
UNIT V
XML: Introducing XML, Structure, and syntax of XML, document type definition (DTD), XML
Schema, Document object model, Presenting and Handling XML. xml data source, using navigation
TAGS:-COMPUTER SCIENCE ADC SYLLABUS I ADC SYLLABUS I RGPV ADC SYLLABUS I CSE ADC SYLLABUS I ANALOG AND DIGITAL SYLLABUS I ADC PAPERS I ANALOG AND DIGITAL COMMUNICATION SYLLABUS I RGPV ADC SYLLABUS I ADC PAPERS I ADC SYLLABUS I ANALOG AND DIGITAL COMMUNICATION SYLLABUS I COMMUNICATION SYLLABUS
B.E. Computer Science Engg.
Semester :-IV
Subject :- Analog and Digital Communication
Revised Syllabus and Scheme of Examination
Effective from July 2010
ANALOG AND DIGITAL COMMUNICATION(CS-405)
Unit-I
Time domain and frequency domain representation of signal: Fourier Transform and its properties, Transform of Gate, Periodic gate, Impulse periodic impulse sine and cosine wave, Concept of energy density and power density (Parseval’s theorem), Power density of periodic gate and impulse function, impulse response of a system, convolutions, convolution with impulse function, causal and non causal system impulse response of ideal low pass filter, Correlation & Auto correlation.
Unit-II
Base band signal, need of modulation :Introduction of modulations techniques,Amplitude modulation, Equation and its frequency domain representation, Bandwidth, Power distribution. AM suppressed carrier waveform equation and frequency domain representation Generation (Balance/Chopper modulator) and synchronous detection technique, errors in synchronous detection,Introduction to SSB and VSB Transmission Angle modulation, Frequency and phase modulation equation and their relative phase and frequency deviations, modulation index frequency spectrum,NBFM and WBFM, Bandwidth comparison of modulation techniques.
Unit-III
Sampling of signal :sampling theorem for low pass and Band pass signal, Pulse amplitude
modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM-TDM signal Type of sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse duration modulations, Digital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various systems.
Unit-IV
Digital modulations techniques: Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK),M-Ary FSK Quadrature Amplitude modulation (QAM), MODEM, Introduction to probability of error.
Unit-V
Information theory and coding: Information, entropies (Marginal and conditional),Model of a
communication system, Mathematical representation of source, channel and receiver characteristics,Mutual information, channel capacity efficiency of noise free channel Binary symmetric channel (BSC) Binary erasure channel (BEC), Repetition of signal, NM symmetric Binary channel, Shannon theorem,Shanon-Hartley theorem (S/N-BW trade off)Source encoding code properties; Shanon, Fano and Huffman coding methods and their efficiency error control coding, Minimum Hamming distance, Linear Block Code, Cyclic code and convolution codes. Line Encoding: Manchester coding, RZ, NRZ coding.
TAGS:-RGPV ADA SYLLABUS I RGPV CS 4TH SEM ADA SYLLABUS I ANALYSIS DESIGN AND ALGORITHM SYLLABUS I RGPV CSE CS404 SYLLABUS I RGTU SYLLABUS I RGPV COMPUTER SCIENCE ENGINEERING 4TH SEM SYLLABUS I RGPV BHOPAL SYLLABUS I RGPV PAPERS I RGPV ADA PAPER I RGPV ADA PREVIOUS YEAR PAPERS I ADA SYLLABUS
B.E. Computer Science Engg.
Semester :-IV
Subject :- Analysis Design and Algorithum
Revised Syllabus and Scheme of Examination
Effective from July 2010
ANALYSIS DESIGN AND ALGORITHMS(CS-404)
Unit I
Algorithms: Designing algorithms, analyzing algorithms, asymptotic notations, heap and heapsort. Introduction to divide and conquer technique, analysis, design and comparison of variousalgorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.
Unit II
Study of Greedy strategy: examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm, etc.
Unit III
Concept of dynamic programming: problems based on this approach such as 0/1 knapsack,multistage graph, reliability design, Floyd-Warshall algorithm, etc.
Unit IV
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph
coloring problem etc. Introduction to branch & bound method, examples of branch and bound method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.
Unit V
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.
Rajiv Gandhi Technological University, Bhopal (MP)
B.E. Computer Science Engg.
Semester :-IV
Subject :- Object Oriented Theory
Revised Syllabus and Scheme of Examination
Effective from July 2010
OBJECT ORIENTED THEORY(CS-403)
Unit I
Abstract data types, Objects and classes, Attributes and Methods, Objects as software units, Encapsulation and Information hiding, Objects instantiations and interactions, Object lifetime, Static anddynamic objects, global and local objects, Metaclass, Modeling the real world objects.
Unit II
Relationships between classes, Association of objects, Types of Association, Recursive Association, Multiplicities, Navigability, Named association, Aggregation of objects. Types of Aggregation, Delegation, Modeling Association and Aggregation.
Unit III
Inheritance and Polymorphism, Types of polymorphism, Static and dynamic polymorphism,Operator and Method overloading, Inherited methods, Redefined methods, the protected interface,Abstract methods and classes, Public and protected properties, Private operations, Disinheritance,Multiple inheritance.
Unit IV
Container Classes, Container types, typical functions and iterator methods, Heterogeneouscontainers, Persistent objects, stream, and files, Object oriented programming languages,
Unit V
Study of C++/Java as Object-oriented programming language.
TAGS:-RGPV COMPUTER SCIENCE SYLLABUS I RGPV DISCRETE STRUCTURE SYLLABUS I RGPV CSE 4TH SEM SYLLABUS I RGTU I SYLLABUS I COMPUTER SCIENCE DISCRETE STRUCTURE SYLLABUS I RGPV CSE CS 402 SYLLABUS I RGPV CSE SYLLABUS FOR4TH SEM I COMPUTER SCIENCE PROJECTS
B.E. Computer Science Engg.
Semester :-IV
Subject :- Discrete Structures
Revised Syllabus and Scheme of Examination
Effective from July 2010
DISCRETE STRUCTERS(CS-402)
Unit-I
Set Theory: Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets,countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation:Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: 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 induction, Proof by contradiction.
Unit-II
Algebraic Structures: 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 results, Rings and Fields: definition and standard results.
Unit-III
Propositional Logic: 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. Introduction to finite state machine Finite statemachines as models of physical system equivalence machines, Finite state machines as language recognizers
Unit-IV
Graph Theory: 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 coloring, chromaticnumber, Isomorphism and Homomorphism of graphs.
Unit V
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices.Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial 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 , Solution by method of generating functions
TAGS:- COMPUTER SCIENCE CSO SYLLABUS I COMPUTER SYSTEM ORGANIZATION SYLLABUS I CSE 401 SYLLABUS I COMPUTER SCIENCE RGPV 4TH SEM SYLLABUS I RGPV BHOPAL COMPUTER SCIENCE 4TH SEM SYLLABUS I CSO SYLLABUS I COMPUTER SYSTEM ORGANIZATION SYLLABUS
B.E. Computer Science Engg.
Semester :-IV
Subject :- Computer System Organization
Revised Syllabus and Scheme of Examination
Effective from July 2010
COMPUTER SYSTEM ORGANIZATION (CS-401)
Unit I
Computer Basics and CPU: Von Newman model, various subsystems, CPU, Memory,I/O,System Bus,CPU and Memory registers, Program Counter, Accumulator, Instruction register, Micro operations, Register Transfer Language, Instruction Fetch, decode and execution, data movement and manipulation, Instruction formats and addressing modes of basic computer. 8085 microprocess ororganization
Unit-II
Control Unit Organization: Hardwired control unit, Micro and nano programmed control unit,Control Memory, Address Sequencing, Micro Instruction formats, Micro program sequencer,Microprogramming,Arithmetic and Logic Unit: Arithmetic Processor, Addition, subtraction, multiplication and division,Floating point and decimal arithmetic and arithmetic units, design of arithmetic unit.
Unit-III
Input Output Organization: Modes of data transfer – program controlled, interrupt driven and direct memory access, Interrupt structures, I/O Interface, Asynchronous data transfer, I/O processor,8085 I/O structure, 8085 instruction set and basic programming. Data transfer –Serial / parallel,synchronous/asynchronous, simplex/half duplex and full duplex.
Unit-IV
Memory organization: Memory Maps, Memory Hierarchy, Cache Memory -Organization and mappings. Associative memory, Virtual memory, Memory Management Hardware.
Unit V
Multiprocessors: Pipeline and Vector processing, Instruction and arithmetic pipelines, Vectorand array processors, Interconnection structure and inter-processor communication.
TAGS:- RGPV COMPUTER SCIENCE 4TH SEM SYLLABUS I RGPV CSO SYLLABUS I CSE CSO SYLLABUS I RGTU CSO SYLLABUS I COMPUTER SCIENCE CSO 4TH SEM SYLLABUS I DISCRETE STRUCTURE SYLLABUS I OOT SYLLABUS I ADA SYLLABUS I ADC SYLLABUS I DOT NET SYLLABUS I DOT NET PROGRAMMING SYLLABUS I CSE 4TH SEM SYLLABUS
COMPUTER SCIENCE CSO SYLLABUS
COMPUTER SCIENCE OBJECT ORIENTED THEORY SYLLABUS
COMPUTER SCIENCE ANALOG AND DIGITAL COMMUNICATION SYLLABUS
COMPUTER SCIENCE CSO SYLLABUS
COMPUTER SCIENCE OBJECT ORIENTED THEORY SYLLABUS
COMPUTER SCIENCE ANALOG AND DIGITAL COMMUNICATION SYLLABUS
