[PDF] Computer Science and Engineering

View - Download Computer Science and Engineering

Previous PDF

Next PDF

B.Tech. V Semester

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course. Uncertainty, Informationand Entropy, Information measures for continuous randomvariables, source coding theorem. Discrete Memory less channels,Mutual information, Conditional entropy. Prefix code,Huffman code, Shanon-Fane code &Hempel-Ziv coding channelcapacity. Channel coding theorem. Shannon limit.Introduction to error connecting codes, coding& decoding of linear block code, minimum distance consideration,conversion of non-systematic form of matrices into systematicform.Code Algebra, Basic properties of Galois fields (GF)polynomial operations over Galois fields, generating cyclic code bygenerating polynomial, parity check polynomial. Encoder &decoder for cyclic codes. Convolutional encoders of different rates.Code Tree, Trllis and state diagram. Maximum likelihood decodingof convolutional code: The viterbi Algorithm fee distance of aconvolutional code.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.Objective, scope and outcome of the course.Compiler, Translator, Interpreter definition, Phase of compiler,Bootstrapping, Review of Finite automata lexical analyzer, Input,Recognition of tokens, Idea about LEX: A lexical analyzergenerator, Error handling.Introduction to parsing.Top down parsing, LL grammars &passers error handling of LLparser, Recursive descent parsing predictive parsers, Bottom upparsing, Shift reduce parsing, LR parsers, Construction of SLR,Conical LR & LALR parsing tables, parsing with ambiguousgrammar. Operator precedence parsing, Introduction of automaticparser generator: YACC error handling in LR parsers. Construction of syntax trees, S-Attributed Definition, L-attributed definitions, Top downtranslation. Intermediate code forms using postfix notation, DAG,Three address code, TAC for various control structures,Representing TAC using triples and quadruples, Booleanexpression and control structures. Storage allocation, Strategies, Activationrecords, Accessing local and non-local names in a block structuredlanguage, Parameters passing, Symbol table organization, Datastructures used in symbol tables. DAGrepresentation of basic block, Advantages of DAG, Sources ofoptimization, Loop optimization, Idea about global data flowanalysis, Loop invariant computation, Peephole optimization,Issues in design of code generator, A simple code generator,Codegeneration from DAG.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course. Structure andoperations; processes and filesProcessor management: inter process communication, mutual exclusion,semaphores, wait and signal procedures, process scheduling andalgorithms, critical sections, threads, multithreadingcontiguous memory allocation, virtual memory,paging, page table structure, demand paging, page replacement policies,thrashing, segmentation, case studyShared resources, resource allocation and scheduling,resource graph models, deadlock detection, deadlock avoidance,deadlockprevention algorithms devices and their characteristics, device drivers,device handling, disk scheduling algorithms and policiesfile concept, types and structures, directory structure,cases studies, access methods and matrices, file security, userauthenticationTime OS and casestudies of Mobile OS

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.Basic of Computer Graphics, Applicationsof computer graphics, Display devices, Random and Raster scan systems,Graphics input devices, Graphics software and standardsPoints, lines, circles and ellipses as primitives, scanconversion algorithms for primitives, Fill area primitives including scan-line polygon filling, inside-outside test, boundary and flood-fill, charactergeneration, line attributes,area-fill attributes, character attributers.Aliasing, and introduction to Anti Aliasing (No anti aliasing algorithm). Transformations (translation , rotation,scaling) , matri x representation , homogeneou s coordinates , compositetransformations, reflection and shearing, viewing pipeline andcoordinates system, window-to-viewport transformation, clippingincluding point clipping, line clipping (cohen-sutherland, liang-bersky,NLN), polygon clipping 3D display methods, polygon surfaces,tables, equations, meshes, curved lies and surfaces, quadric surfaces,spline representation, cubic spline interpolation methods, Bazier curvesand surfaces, B-spline curves and surfaces.3D scaling, rotation andtranslation, composite transformation, viewing pipeline and coordinates,parallel and perspective transformation, view volume and general (paralleland perspective) projection transformations. Light sources basicilluminationmodels halftone patterns and dithering techniques; Properties of light Standard primaries and chromaticity diagram; Intuitive colour concepts RGB colour model YIQ colour model CMY colour model HSV colourmodel HLS colour model; Colour selection. Design of Animation sequences animationfunction raster animation key frame systems motion specification morphing tweening. Tiling the plane Recursively definedcurves Koch curves C curves Dragons space filling curves fractals Grammar based models fractals turtle graphics ray tracing.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.BackgroundDivide AndConquer Method Greedy MethodDynamic Programming Branch And Bound Pattern Matching Algorithms Assignment Problems:Randomized Algorithms- Problem Classes Np, Np-HardAnd Np-Complete:

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.Large scale path loss Pathloss models: FreeSpace and Two-Ray models-Link Budget design Small scalefading-Parameters of mobile multipath channels Time dispersionparameters-Coherence bandwidth Doppler spread & Coherencetime, Fading due to Multipath time delay spread flat fading frequency selective fading Fading due to Doppler spread fastfading slow fading. Multiple Access techniques-FDMA,TDMA, CDMA Capacity calculations Cellular concept-Frequencyreuse-channel assignment-hand off-interference & systemcapacity-trunking & grade of service Coverage and capacityimprovement.Structure of a wirelesscommunication link, Principles of Offset-QPSK, p/4-DQPSK,Minimum Shift Keying, Gaussian Minimum Shift Keying, Errorperformance in fading channels, OFDM principle Cyclic prefix,Windowing, PAPR. Equalisation Adaptiveequalization, Linear and Non-Linear equalization, Zero forcing andLMS Algorithms. Diversity Micro and Macrodiversity, Diversitycombining techniques, Error probability in fading channels withdiversity reception, Rake receiver, MIMO systems spatialmultiplexing-System model-Pre-coding-Beam forming-transmitter diversity, receiver diversity-Channel state information-capacity in fading and non-fading channels.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.Historical evolution of the field, Interactive system design, Conceptof usability-definition and elaboration, HCI and softwareEngineering, GUI design and Aesthetics, Prototyping techniques.Basic idea, introduction todifferent types of models, GOMS family of models (KLM and CMN-GOMS), Fitts law and Hick-Hyman s law, Model-based design casestudies, Shneiderman seight, golden rules, Norman sseven principles, Norman s model of interaction, Nielsen s tenheuristics with example of its use Heuristic evaluation, Contextualinquiry, CognitivewalkthroughIntroduction (motivation,issues, research question formulation techniques ), Experimentdesign and data analysis (with explanation of one-way ANOVA)Hierarchical task analysis (HTA),Engineering task models and Concur Task Tree (CTT),introductiontoformalism in dialog design, design using FSM (finite statemachines) State charts and (classical) Petri Nets in dialog design, CA types, relevance of CA in IS design ModelHuman Processor (MHP), OOP-Introduction OOM-ObjectOriented Modeling of User Interface Design

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Objective, scope and outcome of the course.Basics of biologyProblem Statement, Edit distance and substitutionmatrices, HMMs and pairwise HMMs, Global and local alignments,Spliced alignment, Space-efficient sequence alignment, Multiplealignment, Database searching tools, Sequence by hybridization,Profile HMMsProtein structure alignment, Protein structureprediction Large parsimony and small parsimonyproblems, Probabilistic approaches, Grammar-based approaches Pathways and networks, Microarrays,Biomedical images

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

1Implementation of Line, Circle andellipse attributes2To plot a point (pixel) on the screen3To draw a straight line using DDA Algorithm4Implementation of mid-point circle generating Algorithm5Implementation of ellipse generating Algorithm6Two Dimensional transformations-Translation, Rotation, Scaling, Reflection, Shear7Composite 2D Transformations8Cohen Sutherland 2D line clipping and Windowing9Sutherland Hodgeman Polygon clipping Algorithm10Three dimensional transformations-Translation, Rotation, Scaling11Composite 3D transformations12Drawing three dimensional objects and Scenes13Generating Fractal images

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Introduction: Objective, scope and outcome of the course.To identify whether given string is keyword or not.Count total no. of keywords in a file. [Taking file from user]Count total no of operators in a file. [Taking file from user]Counttotal occurrence of each character in a given file. [Taking file from user]Write a C program to insert, delete and display the entries in Symbol Table.Write a LEX program to identify following:1.Valid mobile number2.Valid url3.Valid identifier4.Validdate (dd/mm/yyyy)5.Valid time (hh:mm:ss)Write a lex program to count blank spaces,words,lines in a given file.Write a lex program to count the no. of vowels and consonants in a C file.Write a YACC program to recognize strings aaab,abbb usinga^nb^n, where b>=0.Write a YACC program to evaluate an arithmetic expression involving operators +,-,*and /.Write a YACC program to check validity of a strings abcd,aabbcd using grammara^nb^nc^md^m, where n , m>0Write a C program to find first of any grammar.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Sort a given set of elements using the Quicksort method and determine thetime requiredto sort the elements. Repeat the experiment for different valuesof n, the number of elements in the list to be sorted and plot a graph of thetime taken versus n. The elements can be read from a file or can be generatedusing the random number generator.Implement a parallelized Merge Sort algorithm to sort a given set of elementsand determine the time required to sort the elements. Repeat the experimentfor different values of n, the number of elements in the list to be sorted andplot a graph of thetime taken versus n. The elements can be read from a file orcan be generated using the random number generator.a. Obtain the Topological ordering of vertices in a given digraph. b. Computethe transitive closure of a given directed graph usingWarshall's algorithm.Implement 0/1 Knapsack problem using Dynamic Programming.From a given vertex in a weighted connected graph, find shortest paths toother vertices using Dijkstra's algorithm.Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal'salgorithm.a. Print all the nodes reachable from a given starting node in a digraph usingBFS method. b. Check whether a given graph is connected or not using DFSmethod.Find Minimum Cost Spanning Tree of a givenundirected graph using Prim salgorithm.Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.Implement N Queen's problem using Back Tracking.

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Introduction To Swing, MVC Architecture, Applets, Applications and PluggableLook and Feel, Basic swing components : Text Fields, Buttons, Toggle Buttons,Checkboxes, and Radio ButtonsJava databaseProgramming, java.sql Package, JDBC driver, NetworkProgramming With java.net Package, Client and Server Programs, Content AndProtocol HandlersRMI architecture, RMI registry, Writing distributed application with RMI,Naming services, Naming AndDirectory Services, Overview of JNDI, Objectserialization and InternationalizationJ2EE architecture, Enterprise application concepts, n-tier applicationconcepts, J2EE platform, HTTP protocol, web application, Web containers andApplication serversServer side programming with Java Servlet, HTTP and Servlet, Servlet API, lifecycle, configuration and context, Request and Response objects, Sessionhandling and event handling, Introduction to filters with writing simple filterapplicationJSP architecture, JSP page life cycle, JSP elements, Expression Language, TagExtensions, Tag Extension API, Tag handlers, JSP Fragments, Tag Files, JSTL,Core Tag library, overview of XML Tag library, SQL Tag library and FunctionsTag library

Syllabus ofUNDERGRADUATE DEGREE COURSEB.Tech. VISemesterComputer Science and Engineering Rajasthan Technical University, KotaEffective from session: 2019-2020 Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. SNContentsHours2 3 4 5 6 Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards.

SNContentsHours

Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards. Syllabusof3rdYear B. Tech.(CS)for students admitted inSession 2017-18 onwards.quotesdbs_dbs7.pdfusesText_5

[PDF] advance java notes pdf download

[PDF] advance java programs

[PDF] advance java syllabus

[PDF] advance java syllabus gtu

[PDF] advance java technology gtu syllabus

[PDF] advance java topics

[PDF] advance web programming notes for mca

[PDF] advance web technology bca

[PDF] advance web technology bca pdf

[PDF] advance web technology mca notes

[PDF] advance web technology mcq

[PDF] advance web technology mcq pdf

[PDF] advance web technology notes

[PDF] advance web technology slip solution

[PDF] advance web technology tutorialspoint