Engineering
- Write a C program To implement Bresenham's Line Drawing Algorithm #include<stdio.h> #include<graphics.h> #include<math.h> #include<conio.h> void main() float x,y,x1,y1,x2,y2,dx,dy,e; int i,gd,gm; clrscr();... 1
- To implement DDA Algorithm for Drawing a Line Segment between two Given end Points A(x1,y1) and B(x2,y2) #include<stdio.h> #include<graphics.h> #include<math.h> void main() float x,y,x1,y1,x2,y2,dx,dy,length; int i,gd,gm; clrscr(); printf("Enter... 1
- Syllabus of DataBase Management System Module Content Hrs 1 Introduction Database Concepts 3 1.1 Introduction, Characteristics of databases, File system v/s Database system, Data... 1
- DataBase Management System viva question What are the characteristics of databases? What is the difference between a file system and a database system? What is data abstraction and... 1
- if x is a poisson variate such that p(x=1)= p(x=2) find e(x^2) Given that P(X=1) = P(X=2), we can write: beginaligned P(X=1) &= e^(-λ)λ¹/1! \\ P(X=2) &= e^(-λ)λ²/2! endaligned Dividing the two equations,... 1
- Analysis of algorithms viva question semester 4 mumbai university What is the mathematical background required for algorithm analysis? What is the significance of performance analysis in algorithms? Define... 1
- Calculate the V number of an optical fibre having numerical aperture 0.25 NA = 0.25 Core diameter = 20 μm λ0= 1.55 μm Formula: V = ᴨd / λ0 ×NA V = 3.14×20×10⁻⁶ /1.55 ×10⁻⁶ ×0.25 V = 10.13 1
- What is pumping in LASER? Give the types of pumping. The process of raising large number of atoms from lower energy to a higher energy level is called pumping. Types of pumping: 1. Optical pump... 1
- Calculate the V number of an optical fibre having numerical aperture 0.25 and core diameter 20 μm NA = 0.25 Core diameter = 20 μm λ0= 1.55 μm Formula: V = ᴨd / λ0 ×NA V = 3.14×20×10⁻⁶ /1.55 ×10⁻⁶ ×0.25 V = 10.13 1
- What is Rayleigh’s criterion of resolution? Define resolving power of grating? Answer: Two point sources (or spectral lines) are just resolved when the principal maximum of one falls on the first minimum of the other. R... 2
- Why the Newton’s rings are circular and centre of interference pattern (reflected) is dark? Answer: The rings are circular because each fringe is a locus of points of equal air-film thickness, and such points lie on circles centred... 2
- Create table student with required attribute and perform following query: To create the STUDENT table with the required attributes: CREATE TABLE STUDENT ( S_ID INT PRIMARY KEY, S_NAME VARCHAR(50) NOT NULL, S_EMAIL... 1
- Write SQL queries for given Database , Find total number of people who owned cars that involved in accident 2004 Answer: The damage amount and the link between a car and an accident are not in the four tables given, so this is the standard insurance sch... 1
- Write SQL queries for given Database , Modify database so ‘jack’ is now live in ‘mumbai’ To modify the database so that 'jack' is now living in 'mumbai', you can use the following SQL query: UPDATE Employeee SET city = 'mumbai' W... 1
- Write SQL queries for given Database , Find name of employee having first letter ‘S’ in their names Answer: Use LIKE 'S%' for names starting with S, salary*12 for annual salary, a three-table join with qualified columns for Accenture employ... 1
- Write a program to implement Disk Scheduling algorithms like FCFS, SCAN and C- SCAN. Answer: FCFS serves requests in the given order; SCAN sorts the requests, moves the head towards one end serving requests, touches the last... 2
- Write a program to implement various page replacement policies Answer: FIFO replaces the page that came in first, LRU replaces the page not used for the longest time, and Optimal replaces the page that w... 2
- Write a program to implement dynamic partitioning placement algorithms i.e Best Fit, First – Fit and Worst –Fit. Answer: In dynamic partitioning, a process is placed in a free hole that is large enough: First Fit takes the first such hole, Best Fit the... 2
- Write a program to demonstrate the concept of deadlock avoidance through Banker’s Algorithm #include<stdio.h> int main() int n, m, i, j, k; n = 5; m = 3; int alloc[ 5 ] [ 3 ] = 0, 1, 0, 2, 0, 0, 3, 0, 2, 2, 1, 1, 0, 0, 2; int max[ 5... 1
- Program to simulate producer and consumer problem using semaphores Answer: Use a bounded buffer with three synchronisation objects: semaphore empty (initial value = buffer size), semaphore full (initial valu... 2
- Write a program to implement CPU Scheduling algorithms like FCFS & SJF Answer: For each process, Completion Time (CT) is found by simulation; then Turnaround Time TAT = CT − AT and Waiting Time WT = TAT − BT. FC... 2
- Er diagraam sql queries SQL Queries SQL (Structured Query Language) is a standard language used to manage and manipulate relational databases. Here are some example... 1
- Write short notes on : Longest common subsequence The longest common subsequence (LCS) of two strings is the longest sequence of characters that appears in both in the same order (not necess... 1
- Write short notes on : 8 Queen problem The 8-queen problem is to place 8 queens on an 8×8 chessboard so that no two queens attack each other; it is solved by backtracking. Constra... 1