CSCI 5333.3 DBMS
Spring 2012
Mid-Term Examination
Last Name: _ First Name: _ Student Id: _
Time allowed: one hour and 20 minutes. Total score: 100 points.
This is a closed book examination.
Answer all questions. Turn in both question and answer sheets. Wr
www.jntuworld.com
www.jwjobs.net
1. Implement a program for cyclic redundency check (CRC)?
#include<stdio.h>
int gen[4],genl,frl,rem[4];
main()
cfw_
int i,j,fr[8],dupfr[11],recfr[11],tlen,flag;
frl=8; genl=4;
printf("enter frame:");
for(i=0;i<frl;i+)
cfw_
www.jntuworld.com
www.jwjobs.net
1. Write a shell script that accepts a file name, starting and ending line numbers as arguments and
displays all the lines between the given line numbers.
echo "enter the filename"
read fname
echo "enter the starting line
www.jntuworld.com
www.jwjobs.net
Linux Programming
"Unit-I - Linux Utilities"
Introduction to Linux
Linux is a Unix-like computer operating system assembled under the model of free and open
source software development and distribution. The defining compon
www.jntuworld.com
www.jwjobs.net
Linux Programming Lab Record
JNTU WORLD [www.jntuworld.com]
How to Run Shell Scripts
There are two ways you can execute your shell scripts. Once you have created a script file:
Method 1:
Pass the file as an argument to the
CS514 - Operating Systems - Ongoing Homework (SPRING 13)
1. ANURAG NANAJIPURAM.
2. Bugs as deviant behavior: a general approach to inferring errors in systems code
3. SUMMARY
The paper talks about nding bugs and automatically nding the rules that a system
GRADUATE ASSISTANTSHIP
SCHOOL OF EDUCATION
NAME
DATE
ADDRESS
TELEPHONE
What semester and year would you like to begin an assistantship?
Have you been admitted to a Graduate Program?
Yes
No
MAJOR DEPARTMENT
To which degree program have you been admit
COP4540 Database
Management System
Midterm Review
Reviewed by
Ramakrishna
Slides created by Fernando & edited by Ramakrishna
AGENDA
Ch1. Overview of DBMSs
Ch2. Database Design
Ch3. Relational Model
Ch4. Relational Algebra
Ch19. Normal Forms
Ch5. SQL
COEN 346 - Winter 2009
Programming Assignment 3
Due: March 21, 2009
Objectives
The purpose of this assignment is to learn how to write a shell script and develop a command line
interpreter or shell using C/C+. This assignment will help you to develop your
www.jntuworld.com
www.jwjobs.net
Department of Information Technology
Computer Networks ,Operating Systems and Linux
programming Lab Manual
JB
D IE
ep T
to
fI
T
(III B.tech -I Sem)
K.Roshan, Assoc.Prof
T.Jakob Sanjay Kumar, Assoc.Prof
S.Sri Ram Murthy, As
ClassroomExercise:
Normalization
x
ConsidertherelationR(A,B,C,D)withthesegivenFDs:
x
x
x
x
x
x
x
AB>C
C>D
D>A
ComputeallnontrivialFDsthatfollowfromthese.
Computethekey(s)forR.
Whatareallthesuperkeys?
WhatarealltheBCNFviolations?
DecomposeRintoBCNF.
Whatar
ClassroomExercise:
Normalization
x
ConsidertherelationR(A,B,C,D)withthesegivenFDs:
x
x
x
x
x
x
x
AB>C
C>D
D>A
ComputeallnontrivialFDsthatfollowfromthese.
Computethekey(s)forR.
Whatareallthesuperkeys?
WhatarealltheBCNFviolations?
DecomposeRintoBCNF.
Whatar
Sreeja Nomula (snomula@siue.edu)
Project: Hockey World Cup
Report Project Plan & Database Design
1.0 Introduction
The Hockey World Cup is an international field hockey competition organized by
the International Hockey Federation (FIH). The tournament was
The PageRank Citation Ranking: Bringing Order to the Web
by Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd presented by Martin Klein, Santosh Vuppala cfw_mklein, svuppala@cs.odu.edu
ODU, Norfolk, 01/31/2007
Outline
Background PageRank Impleme
c 2005 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH.
Vol. 19, No. 1, pp. 122134
TIGHTER BOUNDS FOR GRAPH STEINER TREE
APPROXIMATION
GABRIEL ROBINS AND ALEXANDER ZELIKOVSKY
Abstract. The classical Steiner tree problem in weighted gr
CS 598CSC: Approximation Algorithms
Instructor: Chandra Chekuri
Lecture date: January 30, 2009
Scribe: Kyle Fox
In this lecture we explore the Knapsack problem. This problem provides a good basis for
learning some important procedures used for approximati
Comp 260: Advanced Algorithms
Tufts University, Spring 2009
Prof. Lenore Cowen
Scribe: Jordan Crouser
Lecture 4: The Knapsack Problem
1
The Knapsack Problem Dened
We are given a set
S = a1 , a2 , . . . , an1 , an a collection of objects
s1 , s2 , . . . ,
Massachusetts Institute of Technology
18.434: Seminar in Theoretical Computer Science
Lecturer: Adriana Lopez
March 7, 2006
Steiner Trees and Forests
1
Steiner Tree
Problem Given an undirected graph G
<V, E A, a cost function c
E
Q , and a
partition of V
HW1 SOLUTION
1. Chapter 2
Problem 2: Suppose you have algorithms with the six running times listed
below.(Assume these are the exact number of operations performed as a function
of the input size n.) Suppose you have a computer that can perform 1010 opera
Massachusetts Institute of Technology 18.434: Seminar in Theoretical Computer Science
Lecturer: Lele Yu February 16, 2006
Lecture notes on Shortest Superstring Problem
So far we have studied the set covering problem, but not looked at any real life applic
,5
CMPUT 675: Approximation Algorithms
Fall 2011
Lecture 4, 5 (Sep 20, Sep 22, 2011 ): Set Cover, LP Duality, 0-1 Kanpsack
Lecturer: Mohammad R. Salavatipour
Scribe: Amritpal Saini
This week we see two other algorithms for approximating set cover: one usi
15-451 S10: Quiz 2
Name:
Andrew id:
Closed book. One sheet of notes allowed. You should have four pages. You have 30 minutes
budget your time carefully.
When you are not sure what is meant by a question, just write down how you interpret it. If your
inte
Ecient approximation algorithms
for the Subset-Sums Equality problem
Cristina Bazgan
Miklos Santha
Universit Paris-Sud, LRI, bt 490
e
a
F91405 Orsay, France,
bazgan@lri.fr
CNRS, URA 410,
Universit Paris-Sud, LRI, bt 490,
e
a
F91405 Orsay, France,
santha@l
CS880: Approximations Algorithms
Scribe: Siddharth Barman
Topic: Steiner Tree; Greedy Approximation Algorithms
Lecturer: Shuchi Chawla
Date: 01/25/07
In this lecture we give an algorithm for Steiner tree and then discuss greedy algorithms.
2.1
Steiner Tre