Free Essay

Data Structures

In: Science

Submitted By mrsharma77
Words 2538
Pages 11
Chapter 1 Basic Networking Chapter 1 Basic Networking:                      Data communication is the transfer of data from one device to another via some form of transmission medium. A data communications system must transmit data to the correct destination in an accurate and timely manner. The five components that make up a data communications system are the message, sender, receiver, medium, and protocol. Text, numbers, images, audio, and video are different forms of information. Data flow between two devices can occur in one of three ways: simplex, halfduplex, or full-duplex. A network is a set of communication devices connected by media links. In a point-to-point connection, two and only two devices are connected by a dedicated link. In a multipoint connection, three or more devices share a link. Topology refers to the physical or logical arrangement of a network. Devices may be arranged in a mesh, star, bus, or ring topology. A network can be categorized as a local area network (LAN), a metropolitan-area network (MAN), or a wide area network (WAN). A LAN is a data communication system within a building, plant, or campus, or between nearby buildings. A MAN is a data communication system covering an area the size of a town or city. A WAN is a data communication system spanning states, countries, or the whole world. An internet is a network of networks. The Internet is a collection of many separate networks. TCP/IP is the protocol suite for the Internet. There are local, regional, national, and international Internet service providers (ISPs). A protocol is a set of rules that governs data communication; the key elements of a protocol are syntax, semantics, and timing. Standards are necessary to ensure that products from different manufacturers can work together as expected. The ISO, ITU-T, ANSI, IEEE, and EIA are some of the organizations involved in standards creation. Forums are special-interest groups that quickly evaluate and standardize new technologies. A Request for Comment (RFC) is an idea or concept that is a precursor to an Internet standard.

Information Technology for B.Sc. IT Semester V

Page 3

Chapter 1 Basic Networking Network Models         

The five-layer model provides guidelines for the development of universally compatible networking protocols. The physical, data link, and network layers are the network support layers. The application layer is the user support layer. The transport layer links the network support layers and the user support layer. The physical layer coordinates the functions required to transmit a bit stream over a physical medium. The data link layer is responsible for delivering data units from one station to the next without errors. The network layer is responsible for the source-to-destination delivery of a packet across multiple network links. The transport layer is responsible for the process-to-process delivery of the entire message. The application layer enables the users to access the network.

Signals                  Data must be transformed into electromagnetic signals prior to transmission across a network. Data and signals can be either analog or digital. A signal is periodic if it consists of a continuously repeating pattern. Each sine wave can be characterized by its amplitude, frequency, and phase. Frequency and period are inverses of each other. A time-domain graph plots amplitude as a function of time. A frequency-domain graph plots each sine wave’s peak amplitude against its frequency. By using Fourier analysis, any composite signal can be represented as a combination of simple sine waves. The spectrum of a signal consists of the sine waves that make up the signal. The bandwidth of a signal is the range of frequencies the signal occupies. Bandwidth is determined by finding the difference between the highest and lowest frequency components. Bit rate (number of bits per second) and bit interval (duration of 1 bit) are terms used to describe digital signals. A digital signal is a composite signal with an infinite bandwidth. Bit rate and bandwidth are proportional to each other. The Nyquist formula determines the theoretical data rate for a noiseless channel. The Shannon capacity determines the theoretical maximum data rate for a noisy channel. Attenuation, distortion, and noise can impair a signal. Page 4

Information Technology for B.Sc. IT Semester V

Chapter 1 Basic Networking       Attenuation is the loss of a signal’s energy due to the resistance of the medium. The decibel measures the relative strength of two signals or a signal at two different points. Distortion is the alteration of a signal due to the differing propagation speeds of each of the frequencies that make up a signal. Noise is the external energy that corrupts a signal. We can evaluate transmission media by throughput, propagation speed, and propagation time. The wavelength of a frequency is defined as the propagation speed divided by the frequency.

Encoding and Modulation                    Line coding is the process of converting binary data to a digital signal. The number of different values allowed in a signal is the signal level. The number of symbols that represent data is the data level. Bit rate is a function of the pulse rate and data level. Line coding methods must eliminate the dc component and provide a means of synchronization between the sender and the receiver. Line coding methods can be classified as unipolar, polar, or bipolar. NRZ, RZ, Manchester, and differential Manchester encoding are the most popular polar encoding methods. AMI is a popular bipolar encoding method. Block coding can improve the performance of line coding through redundancy and error correction. Block coding involves grouping the bits, substitution, and line coding. 4B/5B, 8B/10B, and 8B/6T are common block coding methods. Analog-to-digital conversion relies on PCM (pulse code modulation). PCM involves sampling, quantizing, and line coding. The Nyquist theorem says that the sampling rate must be at least twice the highest-frequency component in the original signal. Digital transmission can be either parallel or serial in mode. In parallel transmission, a group of bits is sent simultaneously, with each bit on a separate line. In serial transmission, there is only one line and the bits are sent sequentially. Serial transmission can be either synchronous or asynchronous. In asynchronous serial transmission, each byte (group of 8 bits) is framed with a start bit and a stop bit. There may be a variable-length gap between each byte. In synchronous serial transmission, bits are sent in a continuous stream without start and stop bits and without gaps between bytes. Regrouping the bits into meaningful bytes is the responsibility of the receiver.

Information Technology for B.Sc. IT Semester V

Page 5

Chapter 1 Basic Networking

Analog Transmission  Digital-to-analog modulation can be accomplished using the following: *Amplitude shift keying (ASK)—the amplitude of the carrier signal varies. *Frequency shift keying (FSK)—the frequency of the carrier signal varies. *Phase shift keying (PSK)—the phase of the carrier signal varies. *Quadrature amplitude modulation (QAM)—both the phase and amplitude of the carrier signal vary. QAM enables a higher data transmission rate than other digital-to-analog methods. Baud rate and bit rate are not synonymous. Bit rate is the number of bits transmitted per second. Baud rate is the number of signal units transmitted per second. One signal unit can represent one or more bits. The minimum required bandwidth for ASK and PSK is the baud rate. The minimum required bandwidth (BW) for FSK modulation is BW =f c1 .f c0 + N baud , where f c1 is the frequency representing a 1 bit, f c0 is the frequency representing a 0 bit, and N baud is the baud rate. A regular telephone line uses frequencies between 600 and 3000 Hz for data communication. ASK modulation is especially susceptible to noise. Because it uses two carrier frequencies, FSK modulation requires more bandwidth than ASK and PSK. PSK and QAM modulation have two advantages over ASK: *They are not as susceptible to noise. *Each signal change can represent more than one bit. Trellis coding is a technique that uses redundancy to provide a lower error rate. The 56K modems are asymmetric; they download at a rate of 56 Kbps and upload at 33.6 Kbps. Analog-to-analog modulation can be implemented by using the following: Amplitude modulation (AM) Frequency modulation (FM) Phase modulation (PM) In AM radio, the bandwidth of the modulated signal must be twice the bandwidth of the modulating signal. In FM radio, the bandwidth of the modulated signal must be 10 times the bandwidth of the modulating signal.

          

 



Multiplexing Multiplexing is the simultaneous transmission of multiple signals across a single data link.

Information Technology for B.Sc. IT Semester V

Page 6

Chapter 1 Basic Networking             Frequency-division multiplexing (FDM) and wave-division multiplexing (WDM) are techniques for analog signals, while time-division multiplexing (TDM) is for digital signals. In FDM, each signal modulates a different carrier frequency. The modulated carriers are combined to form a new signal that is then sent across the link. In FDM, multiplexers modulate and combine signals while demultiplexers decompose and demodulate. In FDM, guard bands keep the modulated signals from overlapping and interfering with one another. Telephone companies use FDM to combine voice channels into successively larger groups for more efficient transmission. Wave-division multiplexing is similar in concept to FDM. The signals being multiplexed, however, are light waves. In TDM, digital signals from n devices are interleaved with one another, forming a frame of data (bits, bytes, or any other data unit). Framing bits allow the TDM multiplexer to synchronize properly. Digital signal (DS) is a hierarchy of TDM signals. T lines (T-1 to T-4) are the implementation of DS services. A T-1 line consists of 24 voice channels. T lines are used in North America. The European standard defines a variation called E lines. Inverse multiplexing splits a data stream from one high-speed line onto multiple lower-speed lines.

Transmission Media          Transmission media lie below the physical layer. A guided medium provides a physical conduit from one device to another. Twisted-pair cable, coaxial cable, and optical fiber are the most popular types of guided media. Twisted-pair cable consists of two insulated copper wires twisted together. Twisting allows each wire to have approximately the same noise environment. Twisted-pair cable is used in telephone lines for voice and data communications. Coaxial cable has the following layers (starting from the center): a metallic rodshaped inner conductor, an insulator covering the rod, a metallic outer conductor (shield), an insulator covering the shield, and a plastic cover. Coaxial cable can carry signals of higher frequency ranges than twisted-pair cable. Coaxial cable is used in cable TV networks and traditional Ethernet LANs. Fiber-optic cables are composed of a glass or plastic inner core surrounded by cladding, all encased in an outside jacket. Page 7

Information Technology for B.Sc. IT Semester V

Chapter 1 Basic Networking              Fiber-optic cables carry data signals in the form of light. The signal is propagated along the inner core by reflection. Fiber-optic transmission is becoming increasingly popular due to its noise resistance, low attenuation, and high-bandwith capabilities. Signal propagation in optical fibers can be multimode (multiple beams from a light source) or single-mode (essentially one beam from a light source). In multimode step-index propagation, the core density is constant and the light beam changes direction suddenly at the interface between the core and the cladding. In multimode graded-index propagation, the core density decreases with distance from the center. This causes a curving of the light beams. Fiber-optic cable is used in backbone networks, cable TV networks, and Fast Ethernet networks. Unguided media (usually air) transport electromagnetic waves without the use of a physical conductor. Wireless data is transmitted through ground propagation, sky propagation, and line-of-sight propagation. Wireless data can be classifed as radio waves, microwaves, or infrared waves. Radio waves are omnidirectional. The radio wave band is under government regulation. Microwaves are unidirectional; propagation is line of sight. Microwaves are used for cellular phone, satellite, and wireless LAN communications. The parabolic dish antenna and the horn antenna are used for transmission and reception of microwaves. Infrared waves are used for short-range communications such as those between a PC and a peripheral device.

Error Detection and Correction Access Method        Errors can be categorized as a single-bit error or a burst error. A single-bit error has one bit error per data unit. A burst error has two or more bit errors per data unit. Redundancy is the concept of sending extra bits for use in error detection. Three common redundancy methods are parity check, cyclic redundancy check (CRC), and checksum. An extra bit (parity bit) is added to the data unit in the parity check. The parity check can detect only an odd number of errors; it cannot detect an even number of errors. In the two-dimensional parity check, a redundant data unit follows n data units. CRC, a powerful redundancy checking technique, appends a sequence of redundant bits derived from binary division to the data unit.

Information Technology for B.Sc. IT Semester V

Page 8

Chapter 1 Basic Networking      The divisor in the CRC generator is often represented as an algebraic polynomial. Errors are corrected through retransmission and by forward error correction. The Hamming code is an error correction method using redundant bits. The number of bits is a function of the length of the data bits. In the Hamming code, for a data unit of m bits, use the formula 2 r >= m +r +1 to determine r, the number of redundant bits needed. By rearranging the order of bit transmission of the data units, the Hamming code can correct burst errors.

Data Link Controls and Protocols  Flow control is the regulation of the sender’s data rate so that the receiver buffer does not become overwhelmed.  Error control is both error detection and error correction.  In Stop-and-Wait ARQ, the sender sends a frame and waits for an acknowledgment from the receiver before sending the next frame.  In Go-Back-N ARQ, multiple frames can be in transit at the same time. If there is an error, retransmission begins with the last unacknowledged frame even if subsequent frames have arrived correctly. Duplicate frames are discarded.  In Selective Repeat ARQ, multiple frames can be in transit at the same time. If there is an error, only the unacknowledged frame is retransmitted.  Flow control mechanisms with sliding windows have control variables at both sender and receiver sites.  Piggybacking couples an acknowledgment with a data frame.  The bandwidth-delay product is a measure of the number of bits a system can have in transit.  HDLC is a protocol that implements ARQ mechanisms. It supports communication over point-to-point or multipoint links.  HDLC stations communicate in normal response mode (NRM) or asynchronous balanced mode (ABM).  HDLC protocol defines three types of frames: the information frame (I-frame), the supervisory frame (S-frame), and the unnumbered frame (U-frame).  HDLC handle data transparency by adding a 0 whenever there are five consecutive 1s following a 0. This is called bit stuffing.

Information Technology for B.Sc. IT Semester V

Page 9

Similar Documents

Free Essay

Data Structures

...Data Structures and Algorithms DSA Annotated Reference with Examples Granville Barne Luca Del Tongo Data Structures and Algorithms: Annotated Reference with Examples First Edition Copyright c Granville Barnett, and Luca Del Tongo 2008. This book is made exclusively available from DotNetSlackers (http://dotnetslackers.com/) the place for .NET articles, and news from some of the leading minds in the software industry. Contents 1 Introduction 1.1 What this book is, and what it isn’t . . . 1.2 Assumed knowledge . . . . . . . . . . . . 1.2.1 Big Oh notation . . . . . . . . . . 1.2.2 Imperative programming language 1.2.3 Object oriented concepts . . . . . 1.3 Pseudocode . . . . . . . . . . . . . . . . . 1.4 Tips for working through the examples . . 1.5 Book outline . . . . . . . . . . . . . . . . 1.6 Testing . . . . . . . . . . . . . . . . . . . 1.7 Where can I get the code? . . . . . . . . . 1.8 Final messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 1 1 3 4 4 6 6 7 7 7 I Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . reverse order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Words: 23014 - Pages: 93

Free Essay

Data Structures

...Data Structures & Algorithms Coursework Assignment 1 Q1. (a) Algorithm swap(x, y): Node n head While (n.getNext () != x ) do n n.getNext() Node v y.getNext () n.setNext(y) y.setNext(x) x.setNext(v) (b) Algorithm swap Doubly(x, y): DNode n x.getPrev() DNode v y.getPrev() n.setNext(y) y.setPrev(n) y.setNext(x) x.setPrev(y) x.setNext(v) v.setPrev(x) (c) The run time complexity for the singled linked algorithm is O (n) and for the doubly linked algorithm is O (1). Doubly linked list has the best time complexity. Time complexity in singly linked list take more time because we have to move from head to the node before x Q2. (b) RedBlueStack implements Stack{ protected Object A[]; Int capacity; int top = -1; RedBlueStack(int cap) { A = new Object [capacity]; capacity = cap; } int size() { return (top + 1); } void push(Object obj) throws FullStackException { if (size() == capacity) throws new FullStackException("Stack is full."); A[++top] = obj; } Object top() throws EmptyStackException { if (isEmpty()) throws new EmptyStackException("Stack is empty."); return A[top]; } Boolean isEmpty() { return (top < 0); } Object top() throws EmptyStackException { if (isEmpty()) throws new EmptyStackException("Stack is empty."); return A[top]; }  Object pop() throws EmptyStackException { Object elem; if (isEmpty()) throws new EmptyStackException("Stack...

Words: 551 - Pages: 3

Free Essay

Non Linear Data Structure

...What is a non-linear datastructure? A non-linear datastrucutre is a datastructure in which the data items in the memory are not allocated contiguously i.e. the data items are dispersed in the memory. The first data item will have a link to the second data item and second data item will have a link to the third data item and so on. Pros • Uses memory efficiently that the free contiguous memory in not an requirement for allocating data items • The length of the data items is not necessary to be known prior to allocation Cons • Overhead of the link to the next data item Linked list: linked list a data structure which stores data in the form of nodes.It does not require linear memory as arrays. Each node contains a data part and a pointer part(a pointer to the next data in the list) link or node is object of a class.there are so many types of linked list 1) single linked list 2)doubly linked list 3)circular linked list. single linked list: here links contains pointer to first data and last data in the list.As said earlier a pointer to the next data. example of a linked list: class node{// all nodes will be the objects of this class public int data; public link next_node;//a pointer to next data } public node(int data){ this.data=data; }//end of constructor public void showdata(){ System.out.println("data= "+data); } }//end of class node After defining class for each node we need to define a class for link list. Link list contains a pointer to...

Words: 475 - Pages: 2

Premium Essay

Data Structure

...stack. AB-CD+E*+ (where A=5, B=3, C=5, D =4, and E=2) Question 5 Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : 50,40,+,18, 14,-, *,+ Question 6 Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : TRUE, FALSE, TRUE, FALSE, NOT, OR, TRUE, OR, OR, AND Question 7 Write a program for creating polynomial using linked list? Question 8 Each node of a STACK contains the following information, in addition to required pointer field : i) Roll number of the student ii) Age of the student Give the structure of node for the linked stack in question TOP is a pointer which points to the topmost node of the STACK. Write the following functions. i) PUSH() - To push a node to the stack which is allocated dynamically ii) POP() - To remove a node from the stack and release the memory. Question 9 Write a function in C to perform a DELETE operation in a dynamically allocated link list considering the following description : struct Node { float...

Words: 308 - Pages: 2

Free Essay

Treap Data Structure

...as shown in figure 1, is a binary tree data structure which is used to hold key-value pairs and satisfies following properties; • The left subtree of any node contains only those nodes with keys less than the node’s key. • The right subtree of any node contains only those nodes with keys greater than the node’s key. key=10 val="AU" key=8 val="BN" key=15 val="TN" key=12 val="NZ" key=17 val="DL" key=19 val="IN" Figure 1: An example Binary Search Tree These ordering constraints help to find out a node with a given key in O(log n) average time. Insertion and deletion operations in BST (Binary search tree) must maintain these ordering constraints. prio: 8 val: "IN" prio: 15 val: "NZ" prio: 18 val: "AU" prio: 25 val: "TN" prio: 30 val: "BN" prio: 20 val: "AP" prio: 22 val: "RS" Figure 2: An example min-heap Heap is an another binary tree data structure, as shown in figure 2, which is useful in sorting (heapsort) and implementing a priority queue. A heap can be a min-heap or a max-heap based on the priority of a node with respect to the 1 priority of its left and right children. In case of min-heap each node has lesser priority than its children. In case of max-heap each node has higher priority than its children. In this assignment we are going to implement a binary tree data structure which is a combination of BST and heap. This data structure is called Treap. Treap Treap is a binary tree data structure where each node contains 3 attributes;...

Words: 1803 - Pages: 8

Free Essay

Analysis Algorithm and Data Structure

...1.2. Representation of integer has no size restriction • The important factor affecting the running time is normally size of the input. • Normally the built in data type has a fixed size, to enter and to store the larger data. • The Linked List can be used to store the integer without size restriction, which stores each digit in nodes. • The data can also be reused. Addition: A= 456 Represented by 6 → 5 → 4 in linked list B= 094 Represented by 4 → 9 → 0 in linked list The Resultant is C = 550 Represented by 0 → 5 → 5 in linked list. Multiplication: A= 123 * B= 456 A= Represented by 3 → 2 → 1 in linked list. B= Represented by 6 → 5 → 4 in linked list. STEP 1: 123 * 6 = 8 → 3 → 7 in linked list. STEP 2: 123 * 50= 0 → 5 → 1 → 6 in linked list. STEP 3: ADD STEP 1 AND STEP 2 8 → 8 → 8 → 6 in linked list. STEP 4: 123 * 400= 0 → 0 → 2 → 9 → 4 in linked list. STEP 5: ADD STEP 3 AND STEP 4 8 → 8 → 0 → 6 → 5 in linked list. Exponentiation: The initial step is to arrange in decreasing order of exponents and then perform the action. The other method is by using Θ(log n) time algorithm based on binary representation. 1.5. Representation of one’s and two’s complement 1’s complement: + 4= 0100 - 4= 1011 (taking 1’s complement of +4 is -4 (i.e.) inverting the bit). So, 1’s complement is used to represent both positive and negative integers. 2’s complement: Converting the value to 1’s complement and then adding 1 to that complement. ...

Words: 473 - Pages: 2

Free Essay

C++ Data Structures

...C++ Data Structures Chapter 1 10) What is the difference between an object and an object class? An object class provides the blue print for an object. It will define everything and all the variables and methods available to an object (at least in non-dynamic languages). An object is an instance of an object class, which provides a living breathing representation of that blue print. Example #1 A Toyota Camry or another particular make might be an instance of the class car. Example #2 A house might be an instance of the class Building 17) The following program has three separate errors, each of which would cause an infinite loop. As a member of the inspection team, you could save the programmer a lot of testing time by finding the errors during the inspection. Can you help? Error 1: The while clause is missing the {} brackets around the next 3 lines. Error 2: The Increment function is getting passed the variable nextNumber by value rather than reference, which will not increment count in the main() function. Error 3: The program is not referencing stdlib 18) Is there any way a single programmer (for example, a student working alone on a programming assignment) can benefit from some of the ideas behind the inspection process? Yes, I believe anyone could benefit from the inspection process, regardless of the size of the team. The whole philosophy behind the inspection process is to review a program to ensure that each piece is working...

Words: 347 - Pages: 2

Free Essay

The Data Structure

...数据结构基本英语词汇 I like ITPUB! 数据结构基本英语词汇 数据抽象 data abstraction 数据元素 data element 数据对象 data object 数据项 data item 数据类型 data type 抽象数据类型 abstract data type 逻辑结构 logical structure 物理结构 phyical structure 线性结构 linear structure 非线性结构 nonlinear structure 基本数据类型 atomic data type 固定聚合数据类型 fixed-aggregate data type 可变聚合数据类型 variable-aggregate data type 线性表 linear list 栈 stack 队列 queue 串 string 数组 array 树 tree 图 grabh 查找,线索 searching 更新 updating 排序(分类) sorting 插入 insertion 删除 deletion 前趋 predecessor 后继 successor 直接前趋 immediate predecessor 直接后继 immediate successor 双端列表 deque(double-ended queue) 循环队列 cirular queue 指针 pointer 先进先出表(队列) first-in first-out list 后进先出表(队列) last-in first-out list 栈底 bottom 栈定 top 压入 push 弹出 pop 队头 front 队尾 rear 上溢 overflow 下溢 underflow 数组 array 矩阵 matrix 多维数组 multi-dimentional array 以行为主的顺序分配 row major order 以列为主的顺序分配 column major order 三角矩阵 truangular matrix 对称矩阵 symmetric matrix 稀疏矩阵 sparse matrix 转置矩阵 transposed matrix 链表 linked list 线性链表 linear linked list 单链表 single linked list 多重链表 multilinked list 循环链表 circular linked list 双向链表 doubly linked list 十字链表 orthogonal list 广义表 generalized list 链 link 指针域 pointer field 链域 link field 头结点 head node 头指针 head pointer 尾指针 tail pointer 串 string 空白(空格)串 blank string 空串(零串) null string 子串 substring 树 tree 子树 subtree 森林 forest 根 root 叶子 leaf 结点 node 深度 depth 层次 level 双亲 parents 孩子 children 兄弟 brother 祖先 ancestor 子孙 descentdant ...

Words: 1522 - Pages: 7

Free Essay

Data Structure

...DATA STRUCTURES ANALYSIS OF ALGORITHMS Definition:-           The method of solving a problem is known as an algorithm.It is a sequence of instructions that act on some input data to produce some output in a finite number of steps. Properties:- a) Input:An algorithm must receive some input data supplied externally. b)Output:An algorithm must produce atleast one output as the result. c)Finiteness:The algorithm must terminate after a finite number of steps. d)Definiteness:The steps to be performed in the algorithm must be clear and unambiguous. e)Effectiveness:One must be able to perform the steps in the algorithm without applying any intelligence.           All algorithms basically fall under two broad categories-Iterative and Recursive algorithms.           Iterative Algorithms typically use loops and conditional statements.           Recursive Algorithms use a divide and Conquer strategy. As per this,the recursive algorithm breaks down a large problem into small pieces and then applies the algorithm to each of these smal pieces. Determining which algorithm is efficient than the other involves analysis of algorithms. While analyzing,time required to execute it determined .’time’ represents the number of operations that are carried out while executing the algorithm.           While analyzing iterative algorithms we need to determine how many times the loop is executed. To analyze a recursive algorithm one needs to determine amount of work done for three things: ...

Words: 2466 - Pages: 10

Free Essay

Ibm Db2

...processors and supports up to 2GB of system memory. Insights gained from working with the database after installed are also shared. Installation Process for DB2 Express-C Downloading and installing DB2 Express-C is easily accomplished over an Internet connection. The version installed is 389MB and took approximately 10 minutes to download over a cable modem running at fractional T1 speeds. Installation screens from the steps completed to get DB2 Express-C up and running are shown in the Appendix of this document. After installing the Control Center was invoked at the command line using the command db2cc which is specifically defined in the chapter assigned on DB2 Express-C. Using the command db2sampl -xml –sql to create the sample data worked, and there is the secondary option of using graphical interface commands to accomplish the same. The use of the DB2 Command Line tools show how quickly a multidimensional table can be viewed, edited and batch programming tasks completed using shell scripts in this interface. IBM has done an excellent job of making this free version of DB2 as fully featured and full of navigational and command options as possible. What is most significant amount the design of DB2 relative to other databases worked with is the multiple approaches to getting commands invoked the flexibility on creating fully automated responses to queries, or the option of...

Words: 728 - Pages: 3

Premium Essay

Test

...This general problem is known as the vehicle routing problem.Solving the vehicle routing problem involves determining how many vehicles are required to service the destinations, and developing a route and schedule for each one. Because there are many variations of the problem, it can be very dillicult to solve. TransCAD provides a rich set of vehicle routing tools that solve various types of routing problerns,These tools are used to prepare input data, solve the routing problem, and provide tabular and graphical output of the resulting routes and vehicle schedules. The starting points for each route (such as the warehouse in the above example) are known as depots, and the points to be visited are known as stops. A vehicle route starts at a depot, visits one ormore stops, and may or may not return to the depot. The goal of the procedure is to obtain a set of routes that minimizes the total time or discance traveled by the entire fleet of vehicles. The travel times or distances are stored in the vehicle routing matrix.You can use a network to calculate the network driving time or distance, or you can use straight line distances to create your vehicle routing matrix. You must use a network-based vehicle routing matrix if you want to display the routes on a map as a route system layer.Time window- There are time restrictions on when deliveries can be made to some or all of the stores Each stop requires a certain amount of time to service. The service time can have a fixed component...

Words: 3610 - Pages: 15

Free Essay

Continuous Skyline Queries for Moving Objects

...Omar Khairy El -Morsy ABSTRACT The literature on the skyline algorithms so far mainly deal with queries for static query points over static datasets. With the increasing number of mobile service applications and users, the need for continuous skyline query processing has become more pressing. The continuous skyline operator involves not only static but also dynamic dimensions. In this paper, we examine the spatio-temporal coherence of the problem and propose a continuous skyline query processing strategy for moving query points. First, we distinguish the data points that are permanently in the skyline and use them to derive a search bound. Second, we investigate into the connection between data points’ spatial positions and their dominance relationship, which provides an indication on where to find changes of skyline and how to update the skyline continuously. Based on the analysis, we propose a kinetic-based data structure and an efficient skyline query processing algorithm. We analyze the space and time costs of the proposed method and conduct an extensive experiment to evaluate the proposal. To the best of our knowledge, this is the first work on continuous skyline query processing. shown in Figure 1, there are a set of hotels and for each hotel, we have its distance from the beach (x axis) and its price (y axis). The interesting hotels are all the points not worse than any other point in both distance from the beach and the price. Hotels 2, 4 and 6 are interesting and can...

Words: 11922 - Pages: 48

Free Essay

Data Structures and Implementation

...James Mueller Data Structures and Implementation Unit 5 Individual Project ITCO321 – 1103A - 02 August 21, 2011 Does the word matching exist in the phrase. In the phrase “There exists just a single example”, the word exam is indeed in this phrase. Exam is matched to the word Example as seen here. In order to for the word to be matched, using just plain vision was possible, however, in a computer sense; one must use a pattern matching string so that the program would be able to find the match. When using coding to determine if there is a match in the pattern, you would use the RegularExpression namespace. This will allow for easy parsing and matching of strings to a specific patter (miscrosoft.com, 2011). Regex myRegEx = new Regex("exam"); string s1 = "There exists just a single example."; if (myRegEx.IsMatch(s1)) Console.WriteLine("Match found!"); Explain how you could 'teach' a computer to match the word 'exam' in the given phrase above. In order to do this in C#, you could write 4 separate search commands, or you can be more efficient and you can do it in a single phrase. By using pattern = ‘e ?x ?a ?m?’; . now you can locate one or more of the strings with just a single command: Text = [‘There exists just a single example’]; Regexp (text, pattern, ‘match’) Ans = ‘exam’. This is just one of many ways that you could teach a computer to find the word exam in the phrase. You are also able to use different MATLAB...

Words: 730 - Pages: 3

Premium Essay

Benefits of Social Networking

...Chapter 6 Basic data structures A data structure, sometimes called data type, can be thought of as a category of data. Integer is a data category which can only contain integers. String is a data category holding only strings. A data structure not only defines what elements it may contain, it also supports a set of operations on these elements, such as addition or multiplication. Strings and numbers are the core data structures in Python. In this chapter, you’ll see a few more, almost as important, data structures. In the next chapter, you’ll se how you can design your own, customary data structures. The concept of a sequence is so fundamental to programming that I’ve had a very hard time avoiding it so far. And as you, alert and perky, have noticed, I actually haven’t, since I involuntarily had to introduce sequences in Section 4.4 when talking about the for loop. In Python, the word “sequence” covers several phenomena. Strings are sequences of characters, and you heard about those in Chapter 3. In the coming sections, you’ll hear about the two other basic types of sequence supported by Python: Lists and tuples. Later in this chapter, we’ll get around to talking about sets and dictionaries. Strings and integers represent concrete data objects; a string or a number represents true data in itself.1 Lists, tuples and dictionaries are designed to organize other data, to impose structure upon it; they do not necessarily represent true data in their own right. For this reason, they...

Words: 18297 - Pages: 74

Free Essay

Mountain View Community Hospital

...Case Study Mountain vew community hospital Case Study Mountain vew community hospital 2014 Case Study: Mountain View Community Hospital 1. Mountain View Community Hospital (MVCH) wants to provide better services than their current deliverables. Therefore, databases can help MVCH reach their goal through making relational applications provide information about clients or patients without having a book or paperwork to search for every time. A centralized database application that is not a conjunction of separate applications makes information fluid and accessible without much of a hassle. For example, when a surgeon at MVCH would want information of a patient who has visited before, the surgeon could run an application on a handheld device that collects information from the database. At the same time, when the doctor is checking the file information on the patient, the nurse or other staff member can also access the information of the patient to know what is wrong with the patient exactly. This was, the efficiency of doctors and other members of the hospital can work in collaboration flawlessly. If the database is managed well, when government inspections are taken, the hospital can provide the required information as soon as possible, keeping the hospital’s integrity to the mark with the government. 2. Database technology can take various forms when it comes to complying with security standards of patients and their information. Firstly, the database can hold...

Words: 850 - Pages: 4