Semester-IV. BCA-401 Numerical and Statistical Technique

Size: px

Start display at page:

Download "Semester-IV. BCA-401 Numerical and Statistical Technique"

Lesley Smith
5 years ago
Views:

1 Semester-IV BCA-401 Numerical and Statistical Technique Introduction : Raw material of statistics,ungrouped & grouped frequency distribution,diagrammatic presentation:bar diagram,pie-diagram. Graphical presentation:histogram,frequency polygon,frequency curve,cumulative frequency curve. Measures of Central Tendency and Dispersion:Characterstics of a good average,arithmetic mean,mode,median,geometric mean,harmonic mean,range,mean daviation,standard deviation,skewness and Kurtosis Correlation and Regression Analysis:Scatter diagram,karlpearson,spearman and Concurrent deviation methods,regression lines,method of least square Probabiltiy & Probablity Distribution:Classical,Empirical and axiomatic approach to probability,addition and multiplicative law of probability,binomial,poission & normal distribution Numerical Methods: Interpolation:Finite difference,operators,e,newton Gregory Interpolation for equal intervals,divided difference,newton s Lagrange s Interpolation for unequal intervals. Central differences:gauss forward,backward,third formula due to gauss,strilling & bessel s formula Numerical Differentiation & integration:numerical differentiation by Newton Gregory formula,general quadrature formula,trapezoidial rule,simpson s 1/3 rule,simpson s 3/8 rule.eular-maclaurin s summation formula. Suggested Readings Fundamental of mathematical statistics Gupta & Kapoor S.Chand Introduction to Numerical Methods S.S.Shastri PHI Computer based numerical methods V.Rajaraman PHI

2 BCA 402: Operating System Introduction: Definition, Simple batch system, Multiprogrammed batched system, Time sharing system; Process, File, System Call, The Shell. Operating System Structure: Monolithic System, Layered system, Virtual Machines, Client Server Model. Processes: Definition, Process Control Block, Long term & Short term scheduler, cooperating Process, Interposes Communication (Basic Structure, Direct Communication, Indirect communication, Buffering) Exception condition (Process termination, Last message, scrambled message), Process scheduling (Scheduling criteria, FCFS Scheduling, Shortest Job First, Priority scheduling, round robin scheduling. ) File System: File concept (Naming, structure, type Access, attributes, operation), Directory structure (Single level, two level, tree structured directories, Path names, directory operations) Memory Management : Swapping, Contiguous allocation, Single partition allocation multiple partition allocation, External & Internal fragmentation Paging (Basic Method), segmentation (Basic Method). Deadlock: Introduction, Necessary condition, deadlock avoidance(safe and unsafe state), Deadlock prevention (Attaching the necessary conditions) Detection with one resource of each type, recovery through process termination & resource preemption. Protection & Security: Goals of protection, Domain of protection (Domain Structure), Security problem, One time passwords, Program threats(trojan Horse, trap Door), System threats(worms, Viruses) Suggested Readings: Operating System Concepts S. Galvin AWL Modern Operating System A.S. Tanenbaum PHI

3 BCA 403 Computer System Architecture Unit 1 Basic Computer Organization and Design: Instruction codes, computer registers, computer instructions, timing and control, Instruction cycle, Memory Reference Instructions ( AND,ADD,LDA,STA,BUN,BSA,ISZ), Microinstruction format, Symbolic microinstruction, Microprogram sequencer, Hardwired control vs Micro programmed control. Unit 2 Central Processing Unit: General register organization, Control word, register stack, memory stack, Instruction format(zero address, one address, two address, three address instructions), Addressing modes, RISC vs. CISC. Unit 3 Pipelining: Parallel processing, Flynn s classification, space time diagram, speedup ration, Arithmetic pipeline, Instruction pipeline( four segment instruction pipeline),pipeline conflicts. Unit 4 Input-Output Organization: input output interface, I/O command, strobe control, handshaking, baud rate, Modes of transfer, ( programmed I/O, Interrupt initiated I/O, DMA), priority interrupt (software and hardware), priority encoder, DMA controller. Unit 5 Memory Organization: Memory hierarchy, RAM, ROM, Magnetic disk, Magnetic tapes, Associative Memory, Cache memory, Virtual Memory, Memory Management hardware. Reference Books: 1. Computer System Architecture- M.Moris Mano ( PHI publication) 2. Computer Organisation and architecture- Pal Chaudhary 3. Structured computer organization- Tanenbaum

4 BCA 404: OBJECT ORIENTED PROGRAMMING Object oriented programming: Procedural vs. Object oriented programming,the main function, C++ preprocessors and the <iostream.h> file, C++ input and output with cin and cout, C++ data types: Simple variables, naming simple variables, Integer types, Floating types, Operators, Operator precedence and associativity, Type conversion, symbolic constants, Derived data types, Arrays, strings, structure, reference variables, new and delete operators. Loops and branching statements: Relational expression in C++, relational operators, for loop, while loop, do-while loop, if-else statement, logical operators, conditional operators, switch statements, break and continue statements. Functions: Defining a function, function prototyping and function calls, function arguments, passing by reference, inline functions, default arguments. Objects and classes: Defining classes, implementing member functions, class constructor and destructor, this pointer, friend function, examples based on class and object problems. Class inheritance: Base classes, derived classes, implementing and using derived classes, virtual base class, types of inheritance. Problem based on multiple inheritance Input-output and files: Stream classes, output with ostream class methods, input with cin, introduction with file handling. Suggested readings: 1. E.Balagurusamy: Object oriented programming with C++ 2. K.R.Venugopal: Mastering C++ 3. Bjarne Stroustrup: The C++ programming language.

5 BCA 405 Computer Graphics Introduction of Computer graphics, Brief discussion about Display devices, CRT and its working Flat Panel, LCD etc and Working, Introduction of Point Plotting Technique and Coordinate system, DDA Line Drawing Algorithm, Bresenham's line drawing algorithm, Inremental Method Circle generation algorithm: DDA Method Midpoint circle generation algorithm, Bresenham's Algorithm for circle generation, Display Devices and Controllers, Introduction of Transformation and transformation principles, Scaling and Rotation, Composite transformation Instant transformation and concatenation of matrices, Homogeneous coordinate and matrices, Intro of Clipping and Windowing and Viewing transformation, Viewing coordinate reference frame and window-to-viewport, mapping, Point clipping and Line clipping, Polygon clipping, Midpoint subdivision algorithm, Positioning Technique, Positionoing constraint, Pointing and selection Inking, Painting nad constraint, Online character recognition, Introduction of Event Handling, Polling, Interrupts and Event queue, Functions for event handling, Light pen interrupt, Selection interrupt, Representation of Raster Image & Frame buffer display, Intro of Natural Image, Sampling, Continue the same and Halftoning, Geometric representation of area scan converting polygon, X-Y algorithm and its properties, Raster manipulation functions Text book/reference: - Computer Graphics, Hearn & Baker, PHI

Silver Oak Engineering College and technology Information Technology Department

Silver Oak Engineering College and technology Information Technology Department Mid Semester 2 Syllabus 4th Semester IT Subject Code Subject Name Syllabus 2140709 COMPUTER NETWORKS Unit 3- Transport Layer