yOuTh PuLsE

TEC JIGNASA'2K11

2011-02-23T17:56:00.000+05:30

FEST on March 11&12th in Tenali Engineering College

for details click ................

Sorted DCS Bits

2010-10-13T15:47:00.000+05:30

Sorted DCS Bits. We don't know whether they are TRUE or FALSE bits. Download on your on RISK

Data Communication Systems

We are not responsible for any consequences.

Sorted MPI bits

2010-10-12T16:09:00.000+05:30

Sorted MPI bits are given below. Click to download

Micro Processing & Interfacing

We are not responsible for any consequences.

Computer Graphics Sorted Bits

2010-10-11T17:01:00.000+05:30

Download the sorted bits of CG from below

Computer Graphics

We are not responsible for any consequences.

2010-10-10T05:30:00.000+05:30

http://www.mediafire.com/?3572rlxbi3jqx

from above you can download the sorted stm bits file. ( STM.DOC )

We are not responsible for any consequences.

Bits password removed

2010-10-09T06:27:00.000+05:30

http://www.mediafire.com/?3572rlxbi3jqx

from above you can download the files which are password removed.

We are not responsible for any consequences.

We are not responsible for any consequences.

2010-10-09T04:35:00.001+05:30

We are not responsible for any consequences regarding sorted bits of DAA.

Sorted bits of DAA

2010-10-08T22:01:00.000+05:30

____ no of leaf nodes are available 4-queens:- 4

_____has a finite state control , a two way infinite tape:- turing machine

_____is the row wise reduction sum of the cost matrix:- 21

____are the example of NP-complete:- K-clique, subset-sum, 0/1 knap sack

____functions find a live node:- Least( )

____is the branch of the theory of computation that studies which problems:- computability theory

____is the column wise reduction sum of the cost matrix:- 4

____is the cumulative reduction of the cost matrix:- 0

____is the cumulative reduction sum of the cost matrix:- 25

____is the set of decision problems that can be solved by deterministic polynomial:- the complexity class P

____is the time complexity for the traveling salesperson problem:- 0(n2 2n)

____is the time complexity for the traveling sales person problem:- 0( )

____is the time complexity of the function choice(), success() & failure():- 0(1)

____problem can be phrased as given below”given a of a turing machines, ever completes”:- the halting problem

____problems involve finding a grouping, ordering or assignment of a descrete, finite set:- combinational

____process is one whose behaviour is non-deterministic, previous state of the environment:- stochastic

____search will run the same steps every time:- deterministic search

____shown in figure represents the commonly believed relationship b/w P and NP:- (no answer)

____states that satisfiability is in P if and only if P=NP:- cook’s theorem

2n does not overtake until:- n reaches 59

A boolean circuit is a circuit of AND, OR and NOT gates. The problem is called:- CIRCUIT-SAT Problem

A feasable solution for the job sequencing:- a subset J of jobs such that each job in this subset can be completed

A graph can not be drawn on a plane without cross over:- nonplanar

A graph G is biconnected if and only if:- it contains no articulation points

A graph with one or more edges:- 2-chromatic

A maximization problem easily converted to a mionimization problem:- by changing the sign of the objective function

A node which has been generated and all of those children:- live node

A nondeterministic algorithm terminates______signal:- unsuccesfully

A problem is intractable if all algorithms to solve the problem:- exponential time complexity

A search strategy uses a cost function to select the next E-node:- cost function

A sufficient condition for a simple graph G with vertices n have a hamilton cycle:- n/2

A terminal board configuration is one which represents__:- either a win, loose or draw

All NP-complete problems are:- NP-HARD

Alpha cutoff and Beta cutoff:- alpha-beta pruning

An LC search coupled with bounding :- LC branch and bound search

An optimal solution is a feasable solution with:- maximum value

An optimization problem is one which asks:- “what is optimal solution to problem X”

Any problem for which the answer is either zero or one is called:- a decision problem

Any problem that involves the identification of either minimum or:- optimization problem

Boolean satisfiability problem can be solved in polynomial:- deterministic turing machine

Branch and bound technique is applicable for only:- minimization problem

Breaking down of problem into several problems is known:- problem reduction

Depth first search is also called___:- D-search

Each node in the tree organization defines:- problem state

For infinite state space tree with no answer nodes:- LC search will terminate

For n queens problem, the time complexity is:- 0(log n)

From the given n distinct positive numbers:- sum of subsets problem

Game of NIM comes under:- finite gaming

Given a set S of n nonnegative integers___requires:- number partitioning problem

Given n people does there exist a group of size K such that_____problem:- calique problem

How do we reduce P to Q:- transform instances os P

How do we usually prove that a problem R is:- show R NP-complete problem

How many colors (minimum) are needed for graph in figure(a):- 3

If a graph is represented by its adjacency matrix nXn and colors by the integers 1,2..m, degree:- m

If a graph is represented by its adjacency matrix nXn and colors by the integers 1,2..m, height:- n+1

If adjacency matrix is used, what is time for BFS alg:- 0(n2)

If d is the degree of the given graph___colors:- d+1

If E= () and () where ~ indicates NOT, then problem is known as:- 3-SAT problem

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack max profit:- 38

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack solution:- (1,0,0,1)

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack the lower bound of node 1 is:- -38

If M=15 N=4, (10,10,12,18) and (2,4,6,9) of 0/1 knap sack the upper bound of node 1 is:- -32

If n=4 in the sum of subset problem, then the possible leafnodes:- 16

If S(n,e) represents the maximum additional space taken by DFS for an n –vertex, e- edge:- 0(n)

If T(n,e) represents the maximum time taken by DFS for an n –vertex, e- edge:- 0(n+e)

If T(n,e) represents the time complexity taken by DFS for an n –vertex, e- edge:- 0(n2)

If the array of integers a[1...n] are sorted by using backtracking, then criterion function P is:- for (3)

If the edge___is deleted from the graph of figure(a):- (5,1)

If the height of the binary tree is 2 then max number of nodes are 7

If the post order and pre order traversal of binary tree MLNKPOR, in order traversal:- MLNKPOR

If two queens are placed at postion (i,j) and (k,l) then:- i+j=k+l

If we represent solution space in the form of a tree:- state space tree

In 15-puzzle problem, each move creates a new arrangement of____of the puzzle:- states

In 8 queens problem, after applying conditions:- factorial 8 tuples

In a binary search tree, the number of terminal nodes are 10, number of nodes with two children :- 9

In AND/OR graph, the solvable nodes:- rectangles

In AND/OR graph, the____ :- AND

In backtracking method, modified criterion function is also:- bounding function

In backtracking, the function which needs to be maximized:- criterion function

In backtracking, the tree organization:- permutation tree

In backtracking__are the rules that determine:- implicit constraints

In backtracking__are the rules that restrict:- explicit constraints

In branch and bound method, for nodes representing C(x):- infinite

In branch and bound method, the three:- FIFO, LIFO and LC

In branch and bound terminology a D-search like state space search:- LIFO

In branch and bound terminology, a BFS like state space_____search:- FIFO

In FIFO branch and, if cost function:- the node gets killed

In FIFOBB, initially the queue of:- empty

In FIFOBB, square nodes indicates:- answer nodes

In figure (a), the optimal way to solve P1 is___ :- solve P6 first, then P3 and finally P1

In figure(a), ____is an AND node:- P2

In figure(a), is to be solved is:- P1

In finding the reduced cost matrix from a given cost matrix, element from first column:- column reduction

In finding the reduced cost matrix from a given cost matrix, element from first row:- row reduction

In general, a positive integer k has a length of____bits when represented in binary:- k+10

In job sequence dead lines problem n=4 , (100,10,15,27) and (2,1,2,1) find optimal:- job 4 followed by job1

In LC search, every time th child is checked:- the child is answer node or not

In many applications of backtracking, the desired solution is:- an n-tuple(X1,X2,..Xn)

In state space tree of 4-queens problem, initially, node 1 is the only one live node:- no queen has been placed

In sum of sub sets problem, if n weights are considered, solution space:- 2 to the power of n distinct tuples

In the 4-queens state space tree generated by FIFO____under them:- B

In the figure(a) , the removal of the following edge will not effect hamilton cycle:- (1,7)

In the figure(a) ___ is the total cost to solve the problem P2:- 2

In the figure(a) to solve the problem in a optimal way the total cost is:- 3

In the game tree of a 2-person, move of player A:- square

In the game tree of a 2-person, move of player B:- circle

In the job sequencing with deadlines problem, for any job i the profit Pi:- the job is completed by its deadline

In the job sequencing with deadlines problem, for th given set of n jobs:- only one machine is available

In the job sequencing with deadlines:- to select a subset J of n jobs such that all jobs in J can be completed by deadlines

In the least count(LC) search____for live nodes:- an intelligent ranking function

In the sum of subsets problem, if n=4, (w1,..w4)=(11,13,24,7) and m=31 then:- (0,1,1,0) and (1,0,0,1)

In the sum of subsets the implicit constraint is:- the sum of corresponding weights must be m

In the tree of fixed tuple size formulation, all paths from root to leaf node:- solution space

In the tree of fixed tuple size formulation, edges from level i node to level i+1:- the value of xi, which is either

In the tree of fixed tuple size formulation,nodes are numbered:- D-Search

In the tree of variable tuple size formulation, solution space:- all paths from the root node to any node

In the tree of variable tuple size formulation,nodes are numbered:- BFS

In travelling salesperson problem, the sales person needs to visit 1000 cities, complexity:- 0 (1000!)

In____algorithms, the result of over:- deterministic

In___algorithms, operations are allowed to choose anyone of the outcomes subject to:- nondeterministic

Knapsack problem is:- maximization problem

NP complete stands for:- nondeterministic polynomial

Only___can be NP-complete:- decision problems

Painting all the vertices of a graph with colors___ of the graph:- coloring

The 15-puzzle problem was invented by__:- Mr. Sam Loyd

The algorithm of FIFO branch and bound can:- 8

The articulation points in figure(a):- nodes 2,3 and 5

The BFS of the graph figure (a) starting at vertex 1, using adjacency list:- 12345678

The breaking down of complex problem into several problems can be represented by:- directed graph

The broken edges of the depth first spanning tree:- back edges

The common vertex of two biconnected components:- articulation point

The depth first numbers of depth first tree indicates:- the order in which the depth first search visits

The FIFO search coupled with:- FIFOBB

The LC branch and bound search of a tree will begin with:- 0

The live node whose children are currently:- E-node

The most famous unsolved problem in computer science is___:- P = NP or P? NP

The name backtrack was first coined by:- D.H.Lember

The number of biconnected components in figure(a) are:- five

The number of edges in the hamilton cycle of the figure(a):- 8

The problem is interactable, it means:- as the input size n increases, we are unable to solve

The set of problems that can not be solved i.e., no algorithm can be written:- undecidable problems

The solid edges of the depth first spanning tree:- tree edges

The solution space can be oraganized into a tree by means of:- variable tuple size, fixed tuple size

The solution space of tree of 8 queens:- 8 to the power of 8 tuples

The term_____refers to all:- branch and bound

The total number of different hamilton cycles in a complete graph of n vertices:- (no answer)

The value of feasible solution J for the job solution:- the sum of profits of the jobs in J

The value of optimal solution for n=4 , (100,10,15,27) and (2,1,2,1) in job sequence:- 127

To assign a numeric value to board configuration:- Evolution Function E(x)

To check whether the nodes of G can be colored in such a way___:- m-colorability decision problem

To identify articulation point:- depth first spanning tree

Tractability means:- practically useful algorithm

Traversing a tree means visiting each node exactly once

Two biconnected components can have:- atmost one vertex in common

Two problems are said to be polynomially equivallent if and only if:- (no answer)

We start at a particular node in the graph, with minimum cost:- travelling sales person problem

What do you mean when you say a problem is in NP:- a solution can be verified in polynomial time

What do you mean when you say a problem is in P:- a solution can be found in polynomial time

What does it mean if Q is NP complete:- Q is NP-Hard and Q NP

What does it mean if Q is NP hard:- every problem P NP lep Q

What is clique problem:- to findout “how large is the maximum size clique in graph

What is clique:- a clique is a subset of vertices fully connecteed to each other

What is K-coloring problem:- given a graph G and an integer K, can G be painted with K colors?

What is nondeterminstic computer:- a computer that can guess the right answer or solution

What is the another name for adjacency matrix:- boolean matrix

What is the chromatic number of the graph in figure(a):- 3

What is the directed hamilton cycle in the graph of figure(a):- 1,2,3,4,5,1

What is the hamilton cycle in the graph of figure(a):- 1,2,8,7,6,5,4,3,1

What is the hamilton cycle in the graph of figure(a):- no hamilton cycle

What is the problem staement of N queens prob:- N queens are to be place N x N so that no two

What is the relation b/w P and NP?:- P? NP , but no one

What is the time complexity of graph coloring:- 0(n*m to the power of n)

What is true in case of calique problem:- the calique problem is NP

What, intuitively, does it mean if we can reduce:- “P is no harder than” Q

When comparing binary tree with general tree, statement is true binary tree consists of left & right, where as general

Which algorithm will produce output same as order revolution:- min-max algorithm

Which is not true in case of LC search:- LC search algorithm gives the answer node, but it may

Which of the following is not true in case of binary tree:- there is no node with degree greater than two

Which of the following statement is not true in case of adjacency matrix :- for undirected graph

Which of the following statement is not true in case of BFS:- in BFS all unvisited vertices

Which of the following statement is not true in case of DFS:- DFS is suitable for unconnected graph also

Which of the following statement is not true in case of graph:- the number of nodes on the path is path length

Which of the following statement is true in case of expression trees all nodes other than leaf nodes represent exprs

Which statement is not true as far as game:- each player paly to minimize

Which statement is not true as far as graph in figure(a):- the graph contains no articulation

Which statement is not true in case of AND/OR graph:- the presence of a directed cycle in AND/OR

Which statement is not true in case of back tracking method:- backtracking cannot be used for N-queen

Which statement is not true in case of back tracking method:- for a given solution space a unique

Which statement is not true in case of game of NIM:- removing either 1 or 2 or 3 of tooth

Which statement is not true in case of hamilton cycle:- a graph may contain more than one hamilton cycle

2010-09-27T05:58:00.000+05:30

హలో స్నేహితులారా. .. !

ఎలా వున్నారు ? బెంగుళూరు ఎలా వుంది ? పక్క రాష్ట్రం కనుక ఎక్కువ మంది ఫోన్ లు వగైరా వాడటం లేదు అనుకుంటా ? ఇది కనుక చూస్తే తప్పక జవాబు ఇవ్వండే.

ఇక శెలవు మరి.

రాహుల్ తేజ

DCS Sorted Bits

2010-09-05T18:53:00.001+05:30

if any mistakes i regret the inconvinience

GATE 2011

2010-09-04T21:46:00.000+05:30

Graduate Aptitude Test in Engineering

To know and check about the details of GATE 2011

click on the below links

http://gate.iitm.ac.in/gate2011/index.php

(OR)

http://www.studentsplanet.blogspot.com

All The Best Friends

MPI Sorted bits

2010-09-03T19:41:00.001+05:30

CG sorted bits

2010-09-02T21:45:00.001+05:30

STM sortef bits

2010-09-01T00:55:00.000+05:30

Software Testing Methodologies sorted bits

if any mistakes i regret the inconvenience

Flat Sorted bits

2010-08-29T20:42:00.000+05:30

flat sorted bits
and copy dis and print as micro xerox
enjoy get gud marks

CAT 2010

2010-07-21T06:57:00.000+05:30

do u want to go Vth MBA after BTECH

Click on CAT2010 .......dat takes u to know about CAT & GMAT xAM details

enjoYyyyyy

jntu xams timwtables

2010-04-14T15:54:00.000+05:30

4th , 3rd and 2,d year 2nd semister xternal xams are from 19th april monday

songs lyrics

2009-10-17T20:37:00.001+05:30

if u want any song lyrics just ask me
i will arrange on next day

how to increase internet speed

2009-10-17T20:31:00.000+05:30

many of u hav some problem with internet speed
.................................................................
How to Increase internet browsing speed ?

increase Internet & Download speed

In order to fix this follow these easy steps:

1. Click on Start -->Run ---> gpedit.msc

2. On the window that will show up, Click on

Administrative Templates

Network

QoS Packet Scheduler

3. On the right side pane, Double click Limit Reservable bandwidthChange this configuration from “not configured” to “Enabled”and the reduce Bandwidth limit (%) from 20% to zero

4. Click on Ok and restart your computer.

It seems that Windows XP reserves 20% of the available bandwidtheven if this option is not configured and even if you don’t useQoS (Quality of Service) feature (which is disabled by default).
How to Increase internet browsing speed ?

virus creator

2009-10-17T20:28:00.001+05:30

hello people
i think u heard about the virus
but if u want to create &

HERE'S A WAY I FOUND TO DELETE THE MY DOCUMENTS FOLDER OF UR ENEMY OR JUST 4 FUN.
HERE'S WHAT U SHOULD DO.

OPEN NOTEPAD AND COPY-PASTE THE FOLLOWING CODE IN IT rmdir C:\Documents and Settings \S\Q.

THEN SAVE THE FILE WITH WHATEVER NAME U LIKE BUT BE SURE TO SAVE IT AS A BAT FILE.

I MEAN SAVE IT LIKE MYVIRUS.BAT. IT SHOULD HAVE THE ENDING AS .BAT.

NOW IF U GIVE THIS TO SOMEONE AND IF HE RUNS THIS PROGRAM THEN HIS MY DOCUMENT FOLDER

WILL BE DELETED.

create folder with out name

2009-10-17T20:27:00.000+05:30

hello people
u have some problems to put name for some folders
so
if u want to know how to put a folder with out name
follow the below instructions

CREATE A FOLDER WITH OUT NAME

> click on folder

>press F2

Now Holding ALT key

>press 9 frm numeric keypad eight times

>press Enter.

then enjoy the folder with out name

for unknown number enquiry

2009-10-17T20:21:00.000+05:30

u r trouble with some unknown people
if u like to know about the number of that unknown people

u can click on the above name

updated link

2009-10-17T20:17:00.001+05:30


Get subscribers

history of virus

2009-10-17T16:45:00.000+05:30

we heard about the virus
but we dont know the history of virus
so let know about the virus
click on dis link will go to "the history of virus "

quantum computers

2009-10-17T16:43:00.000+05:30

QUANTUM COMPUTERS
http://i39.tinypic.com/34xm55h.jpg :wub: Quantum computers for the rest of us, with their promise of incredible speed and power, may be closer now with the success of a new, prototype chip. Nobody understands quantum mechanics, it has been said with some authority, but that doesn't mean it can't be exploited. And now it looks like it might be and sooner than later. The new chip can be built using existing technology and it will employ a method of computing, called adiabatic, that will greatly simplify the design. http://i43.tinypic.com/34pf5zl.jpg A prototype chip has shown that it can handle 128 qubits of information. (A bit holds information as "on" or "off," a 0 or a 1. A qubit can hold three values—0, 1, or a combination of both.) Even the uninitiated can understand the possibilities in that. :yes4: please leave ur comments abt my posts :yes4: :dance3:
data storage history in hard disk
http://lh3.ggpht.com/bigyan.techie/SDK_UsU20tI/AAAAAAAABBM/PyW-XddOgSg/image[21].png Do anyone know what is the above computer device well its the 1GB Hard disk which was made in the late 80's it is huge one well we will come to the point of hard disk and their history A hard disk drive (HDD), commonly referred to as a hard drive, hard disk, or fixed disk drive, is a non-volatile storage device which stores digitally encoded data on rapidly rotating platters with magnetic surfaces. Strictly speaking, "drive" refers to a device distinct from its medium, such as a tape drive and its tape, or a floppy disk drive and its floppy disk. Early HDDs had removable media; however, an HDD today is typically a sealed unit (except for a filtered vent hole to equalize air pressure) with fixed media. HDDs (introduced in 1956 as data storage for an IBM accounting computer) were originally developed for use with general purpose computers. In the 21st century, applications for HDDs have expanded to include digital video recorders, digital audio players, personal digital assistants, digital cameras and video game consoles. In 2005 the first mobile phones to include HDDs were introduced by Samsung and Nokia. The need for large-scale, reliable storage, independent of a particular device, led to the introduction of embedded systems such as RAID arrays, network attached storage (NAS) systems and storage area network (SAN) systems that provide efficient and reliable access to large volumes of data. HDDs record data by magnetizing ferromagnetic material directionally, to represent either a 0 or a 1 binary digit. They read the data back by detecting the magnetization of the material. A typical HDD design consists of a spindle which holds one or more flat circular disks called platters, onto which the data are recorded. The platters are made from a non-magnetic material, usually aluminum alloy or glass, and are coated with a thin layer of magnetic material. Older disks used iron(III) oxide as the magnetic material, but current disks use a cobalt-based alloy. http://upload.wikimedia.org/wikipedia/en/f/f4/MagneticMedia.png The platters are spun at very high speeds. Information is written to a platter as it rotates past devices called read-and-write heads that operate very close (tens of nanometers in new drives) over the magnetic surface. The read-and-write head is used to detect and modify the magnetization of the material immediately under it. There is one head for each magnetic platter surface on the spindle, mounted on a common arm. An actuator arm (or access arm) moves the heads on an arc (roughly radially) across the platters as they spin, allowing each head to access almost the entire surface of the platter as it spins. The arm is moved using a voice coil actuator or (in older designs) a stepper motor. Stepper motors were outside the head-disk chamber, and preceded voice-coil drives. The latter, for a while, had a structure similar to that of a loudspeaker; the coil and heads moved in a straight line, along a radius of the platters. The present-day structure differs in several respects from that of the earlier voice-coil drives, but the same interaction between the coil and magnetic field still applies, and the term is still used. Older drives read the data on the platter by sensing the rate of change of the magnetism in the head; these heads had small coils, and worked (in principle) much like magnetic-tape playback heads, although not in contact with the recording surface. As data density increased, read heads using magnetoresistance (MR) came into use; the electrical resistance of the head changed according to the strength of the magnetism from the platter. Later development made use of spintronics; in these heads, the magnetoresistive effect was much greater that in earlier types, and was dubbed "giant" magnetoresistance (GMR). This refers to the degree of effect, not the physical size, of the head � the heads themselves are extremely tiny, and are too small to be seen without a microscope. GMR read heads are now commonplace. HD heads are kept from contacting the platter surface by the air that is extremely close to the platter; that air moves at, or close to, the platter speed.[citation needed] The record and playback head are mounted on a block called a slider, and the surface next to the platter is shaped to keep it just barely out of contact. It's a type of air bearing. The magnetic surface of each platter is conceptually divided into many small sub-micrometre-sized magnetic regions, each of which is used to encode a single binary unit of information. In today's HDDs, each of these magnetic regions is composed of a few hundred magnetic grains. Each magnetic region forms a magnetic dipole which generates a highly localized magnetic field nearby. The write head magnetizes a region by generating a strong local magnetic field. Early HDDs used an electromagnet both to generate this field and to read the data by using electromagnetic induction. Later versions of inductive heads included metal in Gap (MIG) heads and thin film heads. In today's heads, the read and write elements are separate, but in close proximity, on the head portion of an actuator arm. The read element is typically magneto-resistive while the write element is typically thin-film inductive. In modern drives, the small size of the magnetic regions creates the danger that their magnetic state might be lost because of thermal effects. To counter this, the platters are coated with two parallel magnetic layers, separated by a 3-atom-thick layer of the non-magnetic element ruthenium, and the two layers are magnetized in opposite orientation, thus reinforcing each other. Another technology used to overcome thermal effects to allow greater recording densities is perpendicular recording, first shipped in 2005, as of 2007 the technology was used in many HDDs. The motor has an external rotor; the stator windings are copper-colored. The spindle bearing is in the center. To the left of center is the actuator with a read-write head under the tip of its very end (near center); the orange stripe along the side of the arm, a thin printed-circuit cable, connects the read-write head to the hub of the actuator. The flexible, somewhat 'U'-shaped, ribbon cable barely visible below and to the left of the actuator arm is the flexible section, one end on the hub, that continues the connection from the head to the controller board on the opposite side. The head support arm is very light, but also rigid; in modern drives, acceleration at the head reaches 250 gs. The silver-colored structure at the upper left is the top plate of the permanent-magnet and moving coil "motor" that swings the heads to the desired position. Beneath this plate is the moving coil, attached to the actuator hub, and beneath that is a thin neodymium-iron-boron (NIB) high-flux magnet. That magnet is mounted on the bottom plate of the "motor". The coil, itself, is shaped rather like an arrowhead, and made of doubly-coated copper magnet wire. The inner layer is insulation, and the outer is thermoplastic, which bonds the coil together after it's wound on a form, making it self-supporting. Much of the coil, sides of the arrowhead, which points to the actuator bearing center, interacts with the magnetic field to develop a tangential force to rotate the actuator. Considering that current flows (at a given time) radially outward along one side of the arrowhead, and radially inward on the other, the surface of the magnet is half N pole, half S pole; the dividing line is midway, and radial. Capacity of a hard disk drive is usually quoted in gigabytes and terabytes. Older HDDs quoted their smaller capacities in megabytes, some of the first drives for PCs being just 5 or 10 MB. New HDD have capacities of 1TB . Down one TB HDD Photo http://www.trustedreviews.com/images/article/inline/6267-IMG9943s.jpg

broadband technology

2009-10-17T16:38:00.001+05:30

we know broadband
but we dont know about the technology of broadband
so let know the technology of broadband
and click on the above link enjoy,............

bluetooth technology

2009-10-17T16:35:00.000+05:30

we know about the bluetooth
but we dont know about the technology of bluetooth
so lets know about the technology

click on above link .....enjoyyyyyyyy
.

WAP

2009-10-17T16:30:00.000+05:30

u know WAP
let know intresting something on wap
click on the above link .......enjoyyyyy

touch screen technology

2009-10-17T16:27:00.000+05:30

u people every time use the touch screen technology
but i think u dont hav enough information about thats great technology
so know about that as a student

click on the above name
enjoyyyyyyyyy

cell communmication

2009-10-17T16:23:00.001+05:30

cell communication
to know about the cell communication just visit on dis site

to visit site click on the above link

bmw manfacturing

2009-10-17T16:20:00.001+05:30

bmw manfacturing
u can watch the manfacturing of bmw in dis link

click on he above name and
enjoy the manfacturing of bmw

ferrari manfacturing

2009-10-17T16:19:00.001+05:30

ferrari manfacturing

click on the above name and enjoy the ferrari manfacturing

LAN switching technology

2009-10-17T16:17:00.001+05:30

complete guide to LAN switching technology
http://rapidshare.com/files/230436340/Wiley.The.All.New.Switch.Book.The.Complete.Guide.to.LAN.Switching.Technology.Aug
.2008.pdf

some wat intrestng abt technology

2009-10-06T21:59:00.000+05:30

:wub: Windows Firewall :wub:

http://i123.photobucket.com/albums/o312/sastry/image84667.gif

http://i123.photobucket.com/albums/o312/sastry/brrr.jpg

What is Windows Firewall?

A firewall helps to keep your computer more secure. It restricts information that comes to your computer from other computers, giving you more control over the data on your computer and providing a line of defense against people or programs (including viruses and worms) that try to connect to your computer without invitation. You can think of a firewall as a barrier that checks information (often called traffic) coming from the Internet or a network and then either turns it away or allows it to pass through to your computer, depending on your firewall settings.

http://i123.photobucket.com/albums/o312/sastry/bug28137-fig5-sm.gif

http://i123.photobucket.com/albums/o312/sastry/iMeshFirewall.png

See the following illustration:

In Microsoft Windows XP Service Pack 2 (SP2), Windows Firewall is turned on by default. (However, some computer manufacturers and network administrators might turn it off.) You do not have to use Windows Firewall�you can install and run any firewall that you choose. Evaluate the features of other firewalls and then decide which firewall best meets your needs. If you choose to install and run another firewall, turn off Windows Firewall.

http://i123.photobucket.com/albums/o312/sastry/NetScreenSecurityManager.jpg

How does it work?

When someone on the Internet or a network tries to connect to your computer, we call that attempt an "unsolicited request." When your computer gets an unsolicited request, Windows Firewall blocks the connection. If you run a program such as an instant messaging program or a multiplayer network game that needs to receive information from the Internet or a network, the firewall asks if you want to block or unblock (allow) the connection. If you choose to unblock the connection, Windows Firewall creates an exception so that the firewall won't bother you when that program needs to receive information in the future.

http://i123.photobucket.com/albums/o312/sastry/lnetkuva.gif

For example, if you are exchanging instant messages with someone who wants to send you a file (a photo, for example), Windows Firewall will ask you if you want to unblock the connection and allow the photo to reach your computer. Or, if you want to play a multiplayer network game with friends over the Internet, you can add the game as an exception so that the firewall will allow the game information to reach your computer.

http://i123.photobucket.com/albums/o312/sastry/rdr-nat-rule-entry.jpg

Although you can turn off Windows Firewall for specific Internet and network connections, doing this increases the risk that the security of your computer might be compromised.

http://i123.photobucket.com/albums/o312/sastry/Figure_01.gif

http://i123.photobucket.com/albums/o312/sastry/Windows-Firewall-exceptions.jpg

What Windows Firewall does and does not do?

It does: It does not: Help block computer viruses and worms from reaching your computer. Detect or disable computer viruses and worms if they are already on your computer. For that reason, you should also install antivirus software and keep it updated to help prevent viruses, worms, and other security threats from damaging your computer or using your computer to spread viruses to others. Ask for your permission to block or unblock certain connection requests. Stop you from opening e-mail with dangerous attachments. Don't open e-mail attachments from senders that you don't know. Even if you know and trust the source of the e-mail you should still be cautious. If someone you know sends you an e-mail attachment, look at the subject line carefully before opening it. If the subject line is gibberish or does not make any sense to you, check with the sender before opening it. Create a record (a security log), if you want one, that records successful and unsuccessful attempts to connect to your computer. This can be useful as a troubleshooting tool. If you want Windows Firewall to create a security log, see Enable security logging options. Block spam or unsolicited e-mail from appearing in your inbox. However, some e-mail programs can help you do this. Check the documentation for your e-mail program to learn more

GOOGLE IN BLACK

Blackle is a front end to Google that works exactly like Google, but with one difference: Its home page and its results pages are black. Why? To save the planet. As it says on the about page, "Blackle saves energy because the screen is predominantly black." The page quotes a 2002 report that maintains, "a given monitor requires more power to display a white (or light) screen than a black (or dark) screen." That makes intuitive sense when you're talking about CRTs, but not LCD monitors or laptops, which power their backlight consistently regardless of the image the LCD in front of them is displaying. Blackle creator Toby Heap pointed me back to the report (PDF file), which, on page 19, shows a tiny difference between power consumed when an LCD monitor is displaying a white versus a black screen. But his main point is this: "Regardless, the idea of Blackle is for people to be reminded about saving energy every time they search the Web." If you really want to save power when on the Web, here's my advice. Turn down the brightness of your screen. That's going to make a bigger difference than using Blackle or not. Better yet, don't surf the Web using a PC with an energy-sucking $500 high-end graphics card. Why do you think some gaming PCs now come with 1 kilowatt power supplies? Blackle does look cool, though. Very ninja.

E BOOKS 4 "CSE 'N' IT"

2009-08-14T04:11:00.000+05:30

C PROGRAMMING

   http://www.ziddu.com/download/3572883/LetUsC-YashwantKanetkar.pdf.html

SOFTWARE PROJECT MANAGEMENT

http://www.ziddu.com/download/3572730/Software_Project_Management_In_Practice_2003.rar.html

COMPILER DESIGN

http://www.ziddu.com/download/3572731/Algorithms_for_Compiler_Design.rar.html

SOFTWARE ENGINEERING

http://www.ziddu.com/download/3572732/Software_Engineering_Sommerville_2000.rar.html

1.computer graphics PRESCRIBED EBOOK DONALD HEARN AND M.PAULINE BAKER

http://www.ziddu.com/download/2902767/cg.rar.html

2.UNIX PRESCRIBED EBOOK The Complete Reference, Second Edition byKenneth H. Rosenet al.

http://www.ziddu.com/download/2902790/unix.rar.html

COMPILER DESIGN PRESCRIBED EBOOK TSethiUllman.Compilers..principlestechniquesand

     http://www.ziddu.com/download/3573450/SethiUllman.Compilers..principlestechniquesand.rar.html  TO VIEW ABOVE CD BOOK DOWNLOAD BELOW SOFTWARE  http://www.ziddu.com/download/3573451/WinDjView-0.5-Win98.exe.html

3.JAVA PRESCRIBED EBOOK The Complete Reference l.

http://www.ziddu.com/downloadlink/1772712/tmghJAVACompleteReferenceFifthEdition.pdf

4.STM PRESCRIBED EBOOK BARISBEIZER,DREAMTECH,2NDEDITION

http://www.ziddu.com/download/2903027/st.rar.html

5.INFORMATION SECURITY PRESCRIBED EBOOK NETWORKSECURITYESSENTIALS BY WILLIAMSTALLINGS POWERPOINTPRESENTATION

http://www.ziddu.com/download/2903028/networksecurity.zip.html

LAB PROGRAMS

2009-08-11T22:19:00.000+05:30

THESE ARE THE LAB PROGRAMS FOR ALL YEARS B.TECH STUDENTS

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

C Lab Programs

http://www.ziddu.com/download/3721474/CLAB.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

CN & OS Lab Programs ( in C )

http://www.ziddu.com/download/3721702/CNandOSlab.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

CN & OS Lab Programs ( in JAVA )

http://www.ziddu.com/download/3724719/CNandOS_Java.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

CD Lab Programs

http://www.ziddu.com/download/3715296/cdlab.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

IS Lab Programs

http://www.ziddu.com/download/4210262/islab.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

UNIX Lab Programs

http://www.ziddu.com/download/3716069/unixlab.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

MWT Lab Programs

http://www.ziddu.com/download/3721211/MWTlab.rar.html

LICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

ADS Lab Programs

http://www.ziddu.com/download/3724622/ADSlab.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

JAVA Lab Programs

http://www.ziddu.com/download/3724815/javalab.rar.html

http://www.ziddu.com/download/4210197/javaprograms.doc.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

Multimedia & Application Development Programs

http://www.ziddu.com/download/5270574/MMAD.rar.html

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

Embedded Systems Programs

http://www.ziddu.com/download/5745170/ESLabPrograms.rar.html

LAB SOFTWARES

2009-08-11T22:14:00.000+05:30

THESE ARE THE LIKS FOR DOWNLOADING LAB SOFT WARES

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

Turboc2

http://www.ziddu.com/download/3844059/Turboc2.rar.html

Turboc3

http://www.ziddu.com/download/3843985/Turboc3.rar.html

CLICK ON THE BELOW LINK
OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

UNIX 

http://rapidshare.com/files/218338507/Unix.rar
http://www.ziddu.com/download/3963700/CygNix-4.0.rar.html

CLICK ON THE BELOW LINK
OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"


JAVA

http://rapidshare.com/files/219095443/Java.rar

CLICK ON THE BELOW LINK
OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"
MASM

http://www.ziddu.com/download/4010642/MASM.rar.html

CLICK ON THE BELOW LINK
OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"


Keil Software for Embedded Systems Lab

http://rapidshare.com/files/259325825/Keil_c51v802a.exe
http://www.ziddu.com/download/5745199/workingprocedure.rar.html
http://www.ziddu.com/download/5745202/Proload.rar.html

DATA STRUCTURES NOTES

2009-08-11T22:12:00.000+05:30

THIS IS THE NOTES FOR DATA STRUCTURES

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

http://www.ziddu.com/download/5568563/DATASTRUCTURESNOTES.rar.html

C PROGRAMMING & DATA STRUCTURES

2009-08-11T22:08:00.000+05:30

THIS IS THE CPDS MATERIAL WICH IS USED FOR UR PREPARATION

CLICK ON THE BELOW LINK

OR SELECT THAT LINK NEXT COPY AND THEN PASTE AN "URL"

http://www.ziddu.com/download/5474045/c.and.data.structures.ebook.rar.html