Newgen paper The paper was lengthy. 60 ques in 30 min. 10 ques for 2 marks each.

50 ques for 1 mark each. It was not clear whether there was negative marking but I think it was not. The person said there might be negative marking. Check the answers urself **how to represent > in html

**3-4 other questions on html. On cookies, url etc. (cookies are there on browser side) I think this was the ques.

A cookie, also known as a web cookie, browser cookie, and HTTP cookie, is a piece of text stored on a user's computer by their web browser. A cookie can be used for authentication, storing site preferences, shopping cart contents, the identifier for a server-based session, or anything else that can be accomplished through storing text data.

Cookies may be set by the server with or without an expiration date. Cookies without an expiration date exist until the browser terminates, while cookies with an expiration date may be stored by the browser until the expiration date passes. Users may also manually delete cookies in order to save space or to avoid privacy issues.

Session Cookie
A session cookie only lasts for the duration of users using the website. A session cookie will expire if a user closes his/her browser, or if a user hasn't visited the server for certain period of time (called session idle timeout), and the server would expire/invalidate the user session.

[edit] Persistent Cookie

A persistent cookie will outlast user sessions. If a persistent cookie has Max-Age set to 1 year, then, within the year, the initial value set in that cookie would be sent back to server every time the user is visiting the server. This could be used to record a vital piece of information such as how the user initially came to this website. For this reason, persistent cookie is also called tracking cookie.

[edit] Secure Cookie

A secure cookie is only used when a browser is visiting a server via HTTPS, that will make sure that cookie is always encrypted when transmitting from client to server, and therefore less likely to be exposed to Man-in-the-middle attack.

[edit] HttpOnly Cookie

HttpOnly cookie is still in IETF draft [8], though most of the modern browsers support it. On a supported browser, a HttpOnly cookie will only be used when transmitting HTTP (or HTTPS) requests, but the cookie value is unavailable to JavaScript. This will effectively thwart Cross-site scripting if the cookies required to perform critical actions are all HttpOnly.

[edit] Third-party cookie

First-party cookies are cookies set by the same domain that is in your browser's address bar. Third-party cookies are cookies being set with different domains than the one shown on address bar. For example: Suppose a user visits www.domain1.com, which has a banner ad from ad.foxytracking.com, the browser loading of this banner would set a third-party cookie with cookie domain ad.foxytracking.com. When the user later visits www.domain2.com where ad.foxytracking.com also advertises, the same third-party cookie would be sent to the advertiser in order to load the banner, the advertiser then knows that this particular user who is now viewing www.domain2.com also viewed www.domain1.com in the past and may thus more effectively target the user's interests. Furthermore, the advertiser can build up users' browsing history across all the websites this advertiser has banner ads on. See Privacy and Third-party cookies below for more.

[edit] Zombie cookie

Main article: Zombie cookie

A zombie cookie is any cookie that is automatically recreated after a user has deleted it. This is accomplished by a script storing the content of the cookie in some other location, such as the local storage available to Flash content, and then recreating it from the backup when the cookie's absence is detected. In computing, a Uniform Resource Locator (URL) is a Uniform Resource Identifier (URI) that specifies where an identified resource is available and the mechanism for retrieving it. In popular usage and in many technical documents and verbal discussions it is often incorrectly used as a synonym for URI.[1] The best-known example of the use of URLs is for the addresses of web pages on the World Wide Web, such as http://www.example.com/ .

**Microprocessor 8085 based questions on address bus , data bus. 3 questions of the type 24 bits bus 190 instructions 1)No of bits in the opcode - 8 2) no of bits in the address - 16 3) no of memory areas that can be accessed - 65536 The Intel 8085 is an 8-bit microprocessor introduced by Intel in 1977. It was binarycompatible with the more-famous Intel 8080 but required less supporting hardware, thus allowing simpler and less expensive microcomputer systems to be built. The "5" in the model number came from the fact that the 8085 requires only a +5-volt (V) power supply rather than the +5V, -5V and +12V supplies the 8080 needed. Both processors were sometimes used in computers running the CP/M operating system, and the 8085 later saw use as a microcontroller, by virtue of its low component count. Both designs were eclipsed for desktop computers by the compatible Zilog Z80, which took over most of the CP/M computer market as well as taking a share of the booming home computer market in the early-to-mid-1980s. The 8085 had a long life as a controller. Once designed into such products as the DECtape controller and the VT100 video terminal in the late 1970s, it continued to serve for new production throughout the life span of those products (generally longer than the product life of desktop computers).

The 8085 is a conventional von Neumann design based on the Intel 8080. Unlike the 8080 it does not multiplex state signals onto the data bus, but the 8-bit data bus was instead multiplexed with the lower part of the 16-bit address bus to limit the number of pins to 40. Pin #40 is used for the power supply (+5v) and pin #20 for ground. Pin #39 is used as the hold pin. Pins #15 to #8 are generally used for address buses. The processor was designed using nMOS circuitry and the later "H" versions were implemented in Intel's enhanced nMOS process called HMOS, originally developed for fast static RAM products. Only a 5 Volt supply is needed, like competing processors and unlike the 8080. The 8085 uses approximately 6,500 transistors.[1] The 8085 incorporates the functions of the 8224 (clock generator) and the 8228 (system controller), increasing the level of integration. A downside compared to similar contemporary designs (such as the Z80) was the fact that the buses required demultiplexing; however, address latches in the Intel 8155, 8355, and 8755 memory chips allowed a direct interface, so an 8085 along with these chips was almost a complete system. The 8085 has extensions to support new interrupts, with three maskable interrupts (RST 7.5, RST 6.5 and RST 5.5), one non-maskable interrupt (TRAP), and one externally serviced interrupt (INTR). The RST n.5 interrupts refer to actual pins on the processor, a feature which permitted simple systems to avoid the cost of a separate interrupt controller.

Like the 8080, the 8085 can accommodate slower memories through externally generated wait states (pin 35, READY), and has provisions for Direct Memory Access (DMA) using HOLD and HLDA signals (pins 39 and 38). An improvement over the 8080 was that the 8085 can itself drive a piezoelectric crystal directly connected to it, and a built in clock generator generates the internal high amplitude two-phase clock signals at half the crystal frequency (a 6.14 MHz crystal would yield a 3.07 MHz clock, for instance).

[edit] Programming model

The 8085 is a binary compatible follow up on the 8080, using the same basic instruction set as the 8008 (developed by Computer Terminal Corporation). Only a few minor instructions were new to the 8085 above the 8080 set.
[edit] Registers

The processor has seven 8-bit registers named A, B, C, D, E, H, and L, where A is the 8-bit accumulator and the other six can be used as independent byte-registers or as three 16-bit register pairs, BC, DE, and HL, depending on the particular instruction. Some instructions use HL as a (limited) 16-bit accumulator. As in the 8080, the contents of the memory address pointed to by HL could be accessed as pseudoregister M. It also has a 16-bit stack pointer to memory (replacing the 8008's internal stack), and a 16-bit program counter. HL pair is called the primary data pointers.
[edit] Commands/instructions

As in many other 8-bit processors, all instructions are encoded in a single byte (including register-numbers, but excluding immediate data), for simplicity. Some of them are followed by one or two bytes of data, which could be an immediate operand, a memory address, or a port number. Like larger processors, it has CALL and RET instructions for multi-level procedure calls and returns (which can be conditionally executed, like jumps) and instructions to save and restore any 16-bit register-pair on the machine stack. There are also eight one-byte call instructions (RST) for subroutines located at the fixed addresses 00h, 08h, 10h,...,38h. These were intended to be supplied by external hardware in order to invoke a corresponding interrupt-service routine, but are also often employed as fast system calls. The most sophisticated command was XTHL, which is used for exchanging the register pair HL with the value stored at the address indicated by the stack pointer.
[edit] 8-bit instructions

Most 8-bit operations work on the 8-bit accumulator (the A register). For two operand 8-bit operations, the other operand can be either an immediate value, another 8-bit register, or a memory cell addressed by the 16-bit register pair HL. Direct copying is supported between any two 8-bit registers and between any 8-bit register and a HL-addressed memory cell. Due to the regular encoding of the MOV-instruction (using a quarter of available opcode space) there are redundant codes to copy a register into itself (MOV B,B, for instance), which are of little use, except for delays. However, what would have been a copy from the HL-addressed cell into itself (i.e., MOV M,M) instead encodes the HLT instruction, halting execution until an external reset or interrupt occurred.

[edit] 16-bit operations

Although the 8085 is an 8-bit processor, it also has some 16-bit operations. Any of the three 16-bit register pairs (BC, DE, HL) or SP could be loaded with an immediate 16-bit value (using LXI), incremented or decremented (using INX and DCX), or added to HL (using DAD). LHLD loaded HL from directly-addressed memory and SHLD stored HL likewise. The XCHG operation exchanges the values of HL and DE. Adding HL to itself performs a 16-bit arithmetical left shift with one instruction. The only 16 bit instruction that affects any flag was DAD (adding HL to BC, DE, HL or SP), which updates the carry flag to facilitate 24-bit or larger additions and left shifts (for a floating point mantissa for instance). Adding the stack pointer to HL is useful for indexing variables in (recursive) stack frames. A stack frame can be allocated using DAD SP and SPHL, and a branch to a computed pointer can be done with PCHL. These abilities make it feasible to compile languages such as PL/M, Pascal, or C with 16-bit variables and produce 8085 machine code. Subtraction and bitwise logical operations on 16 bits is done in 8-bit steps. Operations that have to be implemented by program code (subroutine libraries) included comparisons of signed integers as well as multiply and divide.
[edit] Input/output scheme

The 8085 supported up to 256 input/output (I/O) ports, accessed via dedicated I/O instructionstaking port addresses as operands. This I/O mapping scheme was regarded as an advantage, as it freed up the processor's limited address space. Many CPU architectures instead use a common address space without the need for dedicated I/O instructions, although a drawback in such designs may be that special hardware must be used to insert wait states as peripherals are often slower than memory. However, in some simple 8080 computers, I/O was indeed addressed as if they were memory cells, "memory mapped", leaving the I/O commands unused. I/O addressing could also sometimes employ the fact that the processor would output the same 8-bit port address to both the lower and the higher address byte (i.e. IN 05h would put the address 0505h on the 16-bit address bus). Similar I/O-port schemes are used in the 8080-compatible Zilog Z80 as well as the closely related x86 families of microprocessors.

[edit] Development system

Intel produced a series of development systems for the 8080 and 8085, known as the MDS-80 Microprocessor System. The original development system had an 8080 processor. Later 8085 and 8086 support was added including ICE (in-circuit emulators). It was a large and heavy desktop box, about a 20" cube (in the Intel corporate blue colour) which included a CPU, monitor, and a single 8 inch floppy disk drive. Later an external box was available with two more floppy drives. It ran the ISIS operating system and could also operate an emulator pod and an external EPROM programmer. This unit used the Multibus card cage which was intended just for the development system. A surprising number of spare card cages and processors were being sold, leading to the development of the Multibus as a separate product. The later iPDS was a portable unit, about 8" x 16" x 20", with a handle. It had a small green screen, a keyboard built into the top, a 5 inch floppy disk drive, and ran the ISIS-II operating system. It could also accept a second 8085 processor, allowing a limited form of multi-processor operation where both processors ran simultaneously and independently. The

screen and keyboard could be switched between them, allowing programs to be assembled on one processor (large programs took awhile) while files were edited in the other. It had a bubble memory option and various programming modules, including EPROM and Intel 8048 and 8051 programming modules which were plugged into the side, replacing stand-alone device programmers. In addition to an 8080/8085 assembler, Intel produced a number of compilers including PL/M-80 and Pascal languages, and a set of tools for linking and statically locating programs to enable them to be burnt into EPROMs and used in embedded systems. The hardware support changes were announced and supported, but the software upgrades were not supported by the assembler, user manual or any other means. At times it was claimed they were not tested when that was false.[citation needed ]

[edit] Applications
For the extensive use of 8085 in various applications, the microprocessor is provided with an instruction set which consists of various instructions such as MOV, ADD, SUB, JMP etc. These instructions are written in the form of a program which is used to perform various operations such as branching, addition, subtraction, bitwise logical and bit shift operations. More complex operations and other arithmetic operations must be implemented in software. For example, multiplication is implemented using a multiplication algorithm. The 8085 processor has found marginal use in small scale computers up to the 21st century. The TRS-80 Model 100 line uses a 80C85. The CMOS version 80C85 of the NMOS/HMOS 8085 processor has several manufacturers, and some versions (eg. Tundra Semiconductor Corporation's CA80C85B) have additional functionality, eg. extra machine code instructions. One niche application for the rad-hard version of the 8085 has been in on-board instrument data processors for several NASA and ESA space physics missions in the 1990s and early 2000s, including CRRES, Polar, FAST, Cluster, HESSI, the Sojourner Mar Rover [2], and THEMIS. The Swiss company SAIA used the 8085 and the 8085-2 as the CPUs of their PCA1 line of programmable logic controllers during the 1980s.

**for mod 9 counter how many min flips flops are required ans) 4 To find the minimum number of flip flops needed to implement a counter that can count to a given "final count", we must use an inequality such as the following where 'n' is the number of flip flops needed: 2n>final count

**in hamming code we have 4 bit data. How many extra bits are required for

code

Hints :D+p+1<=2^p

**read java basics, 4-5 questions. read classes, overriding member functions, inheritance basics etc **what does select represent in relational algebra ans) project **given a rel in II normal form. To be in third normal form the non key attributes must be 1) dependent 2) independent ------- ans 3) none 4) ?? **we bring a file from NTFS to fat. What will change ans) security **in file in ode what is not there 1) name -- ans 2) size 3) owner 4) mode **standard port of telnet ans) 23 **which is not a communication program 1) flash -- ans 2) browser 3) ftp **windows 95 is 1) event driven -- ans 2) message driven 3) multi user ** windows nt has which scheduling 1) multitasking non preemptive 2) multitasking preemptive - ans (perhaps) 3) single tasking

**which of the following is true for Domain name max length is 25 should have .com unique should be registered to interNIC -- ans

**which file saves registry 1) regedit 2) user.ini and system.dat 3) user.dat and system.dat ---- ans **what is logical view of database **what is native file system of windows NT ans) ntfs **find 2's complement of -3510 **a question of full adder ** a = 65 b=32 find a^b (XOR) **what is referential integrity n relational databases: For referential integrity to hold, any field in a table that is declared a foreign key can contain only values from a parent table's primary key or a candidate key. For instance, deleting a record that contains a value referred to by a foreign key in another table would break referential integrity. Some relational database management systems (RDBMS) can enforce referential integrity, normally either by deleting the foreign key rows as well to maintain integrity, or by returning an error and not performing the delete.

**how many process are formed by 6 fork in a program ans) 26 **windows programming question. What message will quit the loop ans) WM_QUIT **a set of procedures to communicate ans) protocol **convert digital to analog and vice versa. Ans) modem

** what JEQ command in assembly Jump if Equal

**what is invalid for < img> tag n html 1) left 2) center-ans bcoz middle is the correct command 3) right 4) top **order of events on unloading a form I think ans was query unload, unload, terminate Opening and closing a form When you open a form, the following sequence of events occurs for the form: Open Load Resize Activate Current

If there are no active controls on the form, the GotFocus event also occurs for the form after the Activate event but before the Current event. When you close a form, the following sequence of events occurs for the form: Unload Deactivate Close

**to convert an exp from infix to postfix the expression had exponentiation(^) so check its precedence terms inside brackets exponents and roots multiplication and division addition and subtraction

**t fi

preorder traversal of a tree

To traverse a non-empt binary tree in preorder, perform t e following operations recursively at each node, starting with the root node:
1. Visit the root. 2. Traverse the left subtree. 3. Traverse the right subtree.

To traverse a non-empty binary tree in i order (symmetri ), perform the following operations recursively at each node:
1. Traverse the left subtree. 2. Visit the root. 3. Traverse the right subtree.

To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node:
1. Traverse the left subtree. 2. Traverse the right subtree. 3. Visit the root.

For more information, see Depth-first traversal

[e

Finally, trees can also be traversed in level order, where we visit every node on a level before going to a lower level This is also called Breadth-first traversal

[edit] Example

In this binary search tree

y y

B e -f T ve

Preorder traversal sequence F, B, A, D, C, E, G, I, H (root, left, right) Inorder traversal sequence A, B, C, D, E, F, G, H, I (left, root, right); note how this produces a

**which has file security ans) NTFS ** in HSI(hue saturation intensity) what is h 1) white light component 2) intensity 3) brightness 4) ... **which is hardware device 1) repeater 2) bridge 3) router 4) gateway **in which locking scheme no one else can access ur data ans) exclusive
y Pessimistic concurrency control (or pessimistic locking) is called "pessimistic" because the system assumes the worst it assumes that two or more users will want to update the same record at the same time, and then prevents that possibility by locking the record, no matter how unlikely con licts actually are.

The locks are placed as soon as any piece of the row is accessed, making it impossible for two or more users to update the row at the same time. Depending on the lock mode (shared, exclusive, or update), other users might be able to read the data even though a lock has been placed. For more details on the lock modes, see Lock modes: shared, exclusive, and update.
y Optimistic concurrency control (or optimistic locking) assumes that although con licts are possible, they will be very rare. Instead o locking every record every time that it is used, the system merely looks or indications that two users actually did try to update the same record at the same time. I that evidence is ound, then one user's updates are discarded and the user is in ormed.

For example, if User1 updates a record and User2 only wants to read it, then User2 simply reads whatever data is on the disk and then proceeds, without checking whether the data is locked. User2 might see slightly out-of-date information if User1 has read the data and updated it, but has not yet committed the transaction.

y y

sorted se uence Postorder traversal se uence: A, C, E, D, B, H, I, G, F (le t, right, root) Level-order traversal se uence: F, B, G, A, D, I, C, E, H

** a question on java . delete an object without creating it using new

File.delete

**default access specifier in a class ans) private **int a=018; int b=026; int c=034; int d=057; system.out.println(a b c d); ans) I think octal output **ripple counter. Given an output. Find four stage prev output Asynchronous (ripple) counter changing state bits are used as clocks to subsequent state flip-flops The result is called a ripple counter, which can count to 2n-1 where n is the number of bits (flip-flop stages) in the counter

**which does not have a fat 1) linux 2) nt 3) windows 2000 4) windows 98 I am not sure about this ques. If it was fat32 then ans should be NT. If it was only FAT then ans should be linux

**what is true about tree 1) only 1:1 relationship 2) only 1:many 3) atleast one 1:many-ans 4) atlest one many:many

** what is virtual memory size in windows 9x. 2 GB 4 GB --- ans

** 2 questions from exploring C . very good ques. Pg : 278 Q27 Pg : 342 Q 12 NEWGEN PAPER 2004 4. spooling is a technique for a. improving utilisation of CPU and i/o devices-ans b. improving -do- of disk c. -do- of tape d. -do- of printer
5. Spooling is putting jobs in a bu er area, whether in memory or on disk, where they can be accessed when a device is ready. For example, print jobs are spooled to a bu er to be printed when the printer is ready. spooling (simultaneous peripheral operations on line)

2. A dynamic link library a. can be loaded explicitly b. is loaded when the application linking to it is being loaded c. both of the above- ans d. none





Which of the following CPU scheduling algorithm is optimum and required to thoroughly of a system a. First come first serve b. shortest job first c. round robin-ans d. none 4.synchronisation is a process by which a. It is ensured that only one processes or accesses of a resource at atime-ans b. ************* accesses to a resources is prohibited c. two computers communicate on internet d. none 5. a system can be prevented from entering into dead lock by a. Allowing a process to start executing only after itb has requested and acquired all the resources b. Allow a peocess to hold only one resources c. Numbering all the resources and making processes required them in strictly increasing no. d. any There are four necessary conditions for a deadlock to occur, known as the Coffman conditions from their first description in a 1971 article by E. G. Coffman. 1. Mutual exclusion condition: a resource that cannot be used by more than one process at a time 2. Hold and wait condition: processes already holding resources may request new resources 3. No preemption condition: only a process holding a resource may release it 4. Circular wait condition: two or more processes form a circular chain where each process waits for a resource that the next process in the chain holds

6. Which of the following short method will have the poorest performance in already sorted list a. radix sort b. quick sort c. insertion d. shell 7. 8. An image processing system takes as input a. a real image b. a graphics model c. mathematics model -ANS d. synthetic model NOTE: look out for answer for yourself

9. baud rate is measured in a. no. of bits per second- Ans b. bytes/sec. c. KB/sec d. MB/sec baud (pronounced / b d/, unit symbol "Bd") is synonymous to symbols per second or pulses per second. It is the unit of symbol rate, also known as baud rate or modulation rate

10. which is not true for a friend function a. a function may be declared a friend of more than one class b. it does not have a class scope c. it can be declared any where without affecting its meaning d. it requires an object that declares it friend for invoking it-ans
Some important points to note whi e using riend unctions in C++:
y The keyword friend is placed only in the function declaration of the friend function and not in the function definition. . It is possible to declare a function as friend in any number of classes. . When a class is declared as a friend, the friend class has access to the private data of the class that made this a friend. . A friend function, even though it is not a member function, would have the rights to access the private members of the class. . It is possible to declare the friend function as either private or public. . The function can be invoked without the use of an object. The friend function has its argument as objects, seen in example below.

11. The normal form that solves the problem of repitition of a constant is called multivalued dependent a. 3NF b. BCNF c. 4NF-ans d. 5NF

12. Two disk file in which window NT 95,98 registery stored a. system.DAT and user.DAT-ans b. sustem.DAT and win.DAT c. system.INI & user.INI d. system.INI & win.INI

13. In 32 bit win.ENV two process using same DLL a. DLL loaded once , mapped to virtual address space of first process NOTE: more options are not available 14. )now we are giving the answer and question in a single line 15. )protected memory is used by ? all WIN. 95 , 97. 98 16. )what is uni code? IS the standared for encoding of wide character 17. )A dynamic link library? Is loaded when application linking to it is being loaded 18. )A Terrminal sends request for information to mainframe computer system which in turn reteives the info. And displayss it on terminal. This type of computing is? CLIENT\SERVER 19. )smartdriv.EXE is virtualdrive SmartDrive is a Disk caching program that shipped with MS-DOS versions 4.01 through 6.22 and Windows 3.x, [1] and greatly improved disk transfer rates by storing frequently accessed data in RAM. Early versions of SmartDrive are loaded through a CONFIG.SYS device driver named SMARTDRV.SYS . Later versions are loaded through an executable file named SMARTDRV.EXE , usually automatically at boot time by including the SMARTDRV.EXE command in AUTOEXEC.BAT (or install=SMARTDRV.EXE into CONFIG.SYS ), though still can be loaded as driver if Double-Buffering required. The Windows 2000 and XP setup programs suggest that SmartDrive be used to decrease installation time when installing from MS-DOS.[2]

If, while executing an instruction, a CPU fetches an instruction located at a particular virtual address, or fetches data from a specific virtual address or stores data to a particular virtual address, the virtual address must be translated to the corresponding physical address. This is done by a hardware component, sometimes called a memory management unit, which looks up the real address (from the page table)

20. )NATIVE FILE system is of WIN 95 is?FAT 21. )What is the memory managment model used by DOS? SEGMENTED 22. )mode used for achieving inter process comm. ? a) stacks b) messaging queues c)shared memory d)disk file In computing, Inter-process communication (IPC) is a set of techniques for the exchange of data among multiple threads in one or more processes. Processes may be running on one or more computers connected by a network. IPC techniques are divided into methods for message passing, synchronization, shared memory, and remote procedure calls (RPC). The method of IPC used may vary based on the bandwidth and latency of communication between the threads, and the type of data being communicated. There are several reasons for providing an environment that allows process cooperation:
y y y y y

In ormation sharing speedup; Modularity; Convenience; and Privilege separation.

IPC may also be referred to as inter-thread communication and inter-application communication.

23. )Typical data transfer rate s in LAN of the order of a) bits/sec b) Kbits/sec c) Mbits /sec d) none 24. )which statement is true for the context of process a)all the incodes being used for process b) the Users allocated for the process c) process defined by global users variables and data A context switch is the computing process of storing and restoring state (context) of a CPU so that execution can be resumed from the same point at a later time. This enables multiple processes to share a single CPU

The state of the process includes all the registers that the process may be using, especially the program counter, plus any other operating system specific data that may be necessary. This data is usually stored in a data structure called a process control block (PCB), or switchframe.

25. )What will be the output of the following code? Int a=0, b=0; if(!a) { b=!a; if(b) a=!b; } printf(?%d%d?,a,b); ANS= 01 26 )MAIN memory of windows?? 4GB 26 )Conventional memory of dos??640KB 27 28 )If there is any question on c++ Ans is ?C?,THERE IS COMPILATION ERROR 29 )Int I=10s I=I++ + ++ I; printf(?%d??I); ANS= 23 30 )Premption is not allowed in ?? printer&tape 31 ) prepaging is a mechanism used to resolve?? Thrashing prepaging - (Or "working set model") A technique whereby the operating system in a paging virtual memory multitasking environment loads all pages of a process's working set into memory before the process is restarted. Demand prepaging is the fetching of multiple pages at each page fault in a virtual memory system. That is, when a process references a page that is not resident, the virtual memory system fetches not only the demanded page (that is, the one that the process referenced), but also some number of other pages that it speculates will be used soon. We have concentrated on understanding when demand prepaging will reduce the number of page faults, and when it will increase it. In computer science, thrashing is a situation where large amounts of computer resources are used to do a minimal amount of work, with the system in a continual state of resource contention. Once started, thrashing is typically self-sustaining until something occurs to remove the original situation that led to the initial thrashing behavior.

32)unit of virtual memory ?? pages 33 )Djastra bankers algoarathim used for ?? deadlock recovery/deadlock prevention The Banker's Algorithm seeks to prevent deadlock by becoming involved in the granting or denying of system resources. Each time that a process needs a particular non-sharable resource, the request must be approved by the banker. The banker is a conservative loaner. Every time that a process makes a request of for a resource to be ``loaned'' the banker takes a careful look at the bank books and attempts to determine whether or not a deadlock state could possibly arise in the future if the loan request is approved. This determination is made by ``pretending'' to grant the request and then looking at the resulting post-granted request system state. After granting a resource request there will be an amount of that resource left free in the system, f. Further, there may be other processes in system. We demanded that each of these other processes state the maximum amount of all system resources they needed to terminate up-front so, therefore, we know how much of each resource every process is holding and has claim to. If the banker has enough free resource to guarantee that even one process can terminate, it can then take the resource held by that process and add it to the free pool. At this point the banker can look at the (hopefully) now larger free pool and attempt to guarantee that another process will terminate by checking whether its claim can be met. If the banker can guarantee that all jobs in system will terminate, it approves the loan in question. If, on the other hand, at any point in the reduction the banker cannot guarantee any processes will terminate because there is not enough free resource to meet the smallest claim, a state of deadlock can ensue. This is called an unsafe state. In this case the loan request in question is denied and the requesting process is usually blocked.

34 )Foreign key is ?? composite key

primary key: - The attribute or combination of attributes that uniquely identifies a row or record. Foreign Key: - an attribute or combination of attribute in a table whose value match a primary key in another table. Composite key: - A primary key that consistsof two or more attributes is known as composite key

candidate key: - is a column in a table which has the ability to become a primary key. A candidate key uni quely identifies the rows

in a table.there can be more than 1 candidate key in a table, in which one should be a primary key.

Alternate Key: - Any of the candidate keys that is not part of the primary key is called an alternate key.

35 External ragmentation doesnot occurs in ?? SEGMENTED

External ragmentation is the phenomenon in which ree storage becomes divided into many small pieces over time.[1] It is a weakness o certain storage allocation algorithms, occurring when an application allocates and deallocates (" rees") regions o storage o varying sizes, and the allocation algorithm responds by leaving the allocated and deallocated regions interspersed.

Read more: http://wiki.answers.com/Q/How_does_external_ ragmentation_occure#ixzz1BrPcSDgT

In computer storage, fragmentation is a phenomenon in which storage space is used inefficiently, reducing storage capacity and in most cases performance. The term is also used to denote the wasted space itself. Internal fragmentation occurs when storage is allocated without intention to use it.[1] This space is wasted. While this seems foolish, it is often accepted in return for increased efficiency or simplicity. The term "internal" refers to the fact that the unusable storage is inside the allocated region but is not being used. External fragmentation is the phenomenon in which free storage becomes divided into many small pieces over time.[1] It is a weakness of certain storage allocation algorithms, occurring when an application allocates and deallocates ("frees") regions of storage of varying sizes, and the allocation algorithm responds by leaving the allocated and deallocated regions interspersed. The result is that although free storage is available, it is effectively unusable because it is divided into pieces that are too small to satisfy the demands of the application. The term "external" refers to the fact that the unusable storage is outside the allocated regions. Data fragmentation occurs when a piece of data in memory is broken up into many pieces that are not close together. It is typically the result of attempting to insert a large object into storage that has already suffered external fragmentation.

in section B TOTAL QUESTION 10 --- MAX MARKS 20 QUESTOIN 3 answer is O/P IS 111213

QUESTION4 ANSWER IS 01 QUESTIN 5 ANSWER IS ?O\P ERROR?

TOTAL Test is of 70 marks we are sending sectin A=50 section B=20 we are sending worth 41 marks ?BEST OF LUCK? KEEP IN CONTACT DO SEND PAPERS OF C.M.C AND V.S.N.L . WE WILL SEND THE PAPER OF T.C.S VERY SOON AS FAST AS POSSIBLE

Technical - Other
NEWGEN PAPER 1. Which feature of Visual Basic. NET enable you to create multiple methods that have identical names but different functionality? Ans: Overloading

2. Which feature of Visual Studio. NET enables an organization to create interoperable applications that can be accessed over multiple computing platforms? Ans: Integrated Development Environment

3. Every Java file is saved with the extension .java (eg. prog. java). When it is compiled, the same java file is converted to a .class file (prog. class) . What does a class file consists of? a. ByteCode b. Unicode c. Asciicode d. Only text

4. IF is one control statements in Java, What is the syntax of IF statement? Ans: If (condition) statement;

5. There is a mechanism that binds together code and the data it manipulates. This mechanism keeps both code and data safe from outside interference and misuse of data. What is this mechanism called?

a. Polymorphism b. Abstraction c. Encapsulation d. Inheritance

n computer science, abstraction is a concept that reduces the behaviour of an object to the lowest common denominator. The following English definition of abstraction helps to understand how this term applies to computer science, IT and objects:
abstraction - a concept or idea not associated with any specific instance[1]

The concept originated by analogy with abstraction in mathematics. The mathematical technique of abstraction begins with mathematical definitions; this has the fortunate effect of finessing some of the vexing philosophical issues of abstraction. For example, in both computing and in mathematics, numbers are concepts in the programming languages, as founded in mathematics. Implementation details depend on the hardware and software, but this is not a restriction because the computing concept of number is still based on the mathematical concept. In computer programming, abstraction can apply to control or to data: Control abstraction is the abstraction of actions while data abstraction is that of data structures.

6. What is the functionality of Java Virtual Machine? a. it saves a java program b. it is an interpreter of a byte code. c. it helps to convert a java file into a class file.

7. In the following line "public stat ic void main (String args[ ])" What is the functionality of public keyword? a. prevents a member from being used by code outside its class. b. allows a member to be accessed by a code outside a class in which it is not declared.

"

y y

Control abstraction involves the use o subprograms and related concepts control lows Data abstraction allows handling data bits in meaning ul ways. For example, it is the basic motivation behind datatype.

c. allows a member to be accessed by a code only by its inherited classes. d. the member of a class is public with in its own package.

8. Java supports dynamic programming, and has the policy of "write once and use many times". Identify the functionalities supported by Java? a. multiple inheritance & polymorphism b. polymorphism & structured programming. c. multiple inheritance & structured programming d. inheritance, polymorphism & multithreading.

9. To allow users to set values on a scale by moving a pointer along a visual scale in Visual Basic. NET application and to use a control which allows users to avoid choosing a precise numerical value. Which one of the following Visual Basic. NET control should be used? The TrackBar control.

10. What is storage size of char datatype in vb .net? Ans: 2 byte

11. Identify the option from the .NET Framework in which common services such as garbage collection and security, are automatically provided. Ans: the common language runtime environment.

Newgen Pl cement Papers and Sample Papers

Following papers are for year 2004,2005,2006,2007. Clic Here for place ent papers 2008,2009,2010.

Newgen aper Page: 1 2 3 4

Newgen Test Pattern

NEWGEN SELECTION PROCEDURE The selection procedure is of 3 rounds.. First is written test Second is psychometric test Third is personal interview Written test consists of 3 sections 1>verbal and aptitude 30 ques in 35 mins 30 marks questions were easy if you have some practice on it you will solve all of them in time 2>quanitative apti-10 ques in 10 mins easy section 3>Technical section-10 ques 20mins 10 marks

20 marks

3-5 ques on c rest on computer awareness(like full form of arp,ssl etc)

Psychometric test it is not a elimination round is just for your HR there were 50 ques and you have to answer them in 30 mins.. Personal interview Questions in C and data structure and some sort of HR.. if you have good knowledge of C you can clear it easily....

&

Newgen Interview Procedure, Pattern and Model Question Paper The aptitude paper consist of two parts- part a and part b. part A -consist of questions on networking,OS ,DS,C ,GUI fundas.

1.Kerberos is an ans:authentication protocol

Kerberos (pronounced / k rb r s/[1]) is a computer network authentication protocol, which allows nodes communicating over a non-secure network to prove their identity to one another in a secure manner. Its designers aimed primarily at a client server model, and it provides mutual authentication both the user and the server veri y each other's identity. Kerberos protocol messages are protected against eavesdropping and replay attacks.

2.Give the principle of IEEE802.3(Ethernet) ans:CSMA/CD 3.Give the principle of IEEE802.5 ans:token ring management 4.CRC(Cyclic redundancy follows) ans:modulo 2 arithmetic
A cyclic redund ncy check (CRC) or polynomi l code checksum is a hash unction designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. A CRC-enabled device calculates a short, ixed-length binary se uence, known as the CRC code or just CRC, or each block o data and sends or stores them both together. When a block is read or received the device repeats the calculation; i the new CRC does not match the one calculated earlier, then the block contains a data error and the device may take corrective action such as rereading or re uesting the block be sent again, otherwise the data is assumed to be error ree (though, with some small probability, it may contain undetected errors; this is the undamental nature o error-checking)[1].

5.Name the layers of OSI model that perform the following functions: a)address resolution - network layer b)routing algorithms - network layer c)flow control - transport layer d)synchronisation by inserting check points in data - session layer

'

Layer 1: Physical Layer

The Physical Layer defines the electrical and physical specifications for devices. In particular, it defines the relationship between a device and a transmission medium, such as a copper or optical cable. This includes the layout of pins, voltages, cable specifications, hubs, repeaters, network adapters, host bus adapters (HBA used in storage area networks) and more. To understand the function of the Physical Layer, contrast it with the functions of the Data Link Layer. Think of the Physical Layer as concerned primarily with the interaction of a single device with a medium, whereas the Data Link Layer is concerned more with the interactions of multiple devices (i.e., at least two) with a shared medium. Standards such as RS-232 do use physical wires to control access to the medium. The major functions and services performed by the Physical Layer are:

Parallel SCSI buses operate in this layer, although it must be remembered that the logical SCSI protocol is a Transport Layer protocol that runs over this bus. Various Physical Layer Ethernet standards are also in this layer; Ethernet incorporates both this layer and the Data Link Layer. The same applies to other local-area networks, such as token ring, FDDI, ITU-T G.hn and IEEE 802.11, as well as personal area networks such as Bluetooth and IEEE 802.15.4.

[edit] Layer 2: Data Link Layer

The Data Link Layer provides the functional and procedural means to transfer data between network entities and to detect and possibly correct errors that may occur in the Physical Layer. Originally, this layer was intended for point-to-point and point-to-multipoint media, characteristic of wide area media in the telephone system. Local area network architecture, which included broadcast-capable multiaccess media, was developed independently of the ISO work in IEEE Project 802. IEEE work assumed sublayering and management functions not required for WAN use. In modern practice, only error detection, not flow control using sliding window, is present in data link protocols such as Point-to-Point Protocol (PPP), and, on local area networks, the IEEE 802.2 LLC layer is not used for most protocols on the Ethernet, and on other local area networks, its flow control and acknowledgment mechanisms are rarely used. Sliding window flow control and acknowledgment is used at the Transport Layer by protocols such as TCP, but is still used in niches where X.25 offers performance advantages. The ITU-T G.hn standard, which provides high-speed local area networking over existing wires (power lines, phone lines and coaxial cables), includes a complete Data Link Layer

44

y y

Establishment and termination o a connection to a communications medium. Participation in the process whereby the communication resources are e ectively shared among multiple users. For example, contention resolution and low control. Modulation, or conversion between the representation o digital data in user e uipment and the corresponding signals transmitted over a communications channel. These are signals operating over the physical cabling (such as copper and optical iber) or over a radio link.

which provides both error correction and flow control by means of a selective repeat Sliding Window Protocol. Both WAN and LAN service arrange bits, from the Physical Layer, into logical sequences called frames. Not all Physical Layer bits necessarily go into frames, as some of these bits are purely intended for Physical Layer functions. For example, every fifth bit of the FDDI bit stream is not used by the Layer.
[edit] WAN Protoco architecture

Connection-oriented WAN data link protocols, in addition to framing, detect and may correct errors. They are also capable of controlling the rate of transmission. A WAN Data Link Layer might implement a sliding window flow control and acknowledgment mechanism to provide reliable delivery of frames; that is the case for SDLC and HDLC, and derivatives of HDLC such as LAPB and LAPD.
[edit] IEEE 802 LAN architecture

Practical, connectionless LANs began with the pre-IEEE Ethernet specification, which is the ancestor of IEEE 802.3. This layer manages the interaction of devices with a shared medium, which is the function of a Media Access Control (MAC) sublayer. Above this MAC sublayer is the media-independent IEEE 802.2 Logical Link Control (LLC) sublayer, which deals with addressing and multiplexing on multiaccess media. While IEEE 802.3 is the dominant wired LAN protocol and IEEE 802.11 the wireless LAN protocol, obsolescent MAC layers include Token Ring and FDDI. The MAC sublayer detects but does not correct errors.

[edit] Layer 3: Network Layer

The Network Layer provides the functional and procedural means of transferring variable length data sequences from a source host on one network to a destination host on a different network, while maintaining the quality of service requested by the Transport Layer (in contrast to the data link layer which connects hosts within the same network). The Network Layer performs network routing functions, and might also perform fragmentation and reassembly, and report delivery errors. Routers operate at this layersending data throughout the extended network and making the Internet possible. This is a logical addressing scheme values are chosen by the network engineer. The addressing scheme is not hierarchical. Careful analysis of the Network Layer indicated that the Network Layer could have at least three sublayers:
1. Subnetwork Access - that considers protocols that deal with the inter ace to networks, such as X.25; 2. Subnetwork Dependent Convergence - when it is necessary to bring the level o a transit network up to the level o networks on either side; 3. Subnetwork Independent Convergence - which handles transfer across multiple networks.

The best example of this latter case is CLNP, or IPv7 ISO 8473. It manages the connectionless transfer of data one hop at a time, from end system to ingress router, router to

router, and from egress router to destination end system. It is not responsible for reliable delivery to a next hop, but only for the detection of erroneous packets so they may be discarded. In this scheme, IPv4 and IPv6 would have to be classed with X.25 as subnet access protocols because they carry interface addresses rather than node addresses. A number of layer management protocols, a function defined in the Management Annex, ISO 7498/4, belong to the Network Layer. These include routing protocols, multicast group management, Network Layer information and error, and Network Layer address assignment. It is the function of the payload that makes these belong to the Network Layer, not the protocol that carries them.

[edit] Layer 4: Transport Layer

The Transport Layer provides transparent transfer of data between end users, providing reliable data transfer services to the upper layers. The Transport Layer controls the reliability of a given link through flow control, segmentation/desegmentation, and error control. Some protocols are state and connection oriented. This means that the Transport Layer can keep track of the segments and retransmit those that fail. The Transport layer also provides the acknowledgement of the successful data transmission and sends the next data if no errors occurred. Although not developed under the OSI Reference Model and not strictly conforming to the OSI definition of the Transport Layer, typical examples of Layer 4 are the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Of the actual OSI protocols, there are five classes of connection-mode transport protocols ranging from class 0 (which is also known as TP0 and provides the least features) to class 4 (TP4, designed for less reliable networks, similar to the Internet). Class 0 contains no error recovery, and was designed for use on network layers that provide error-free connections. Class 4 is closest to TCP, although TCP contains functions, such as the graceful close, which OSI assigns to the Session Layer. Also, all OSI TP connection-mode protocol classes provide expedited data and preservation of record boundaries, both of which TCP is incapable. Detailed characteristics of TP0-4 classes are shown in the following table:[4]
Fe ture Name Connection oriented network Connectionless network Concatenation and separation Segmentation and reassembly Error Recovery TP0 TP1 TP2 TP3 TP4 Yes Yes Yes Yes Yes No No No No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes

Reinitiate connection (if an excessive number of PDUs are unacknowledged) No Yes No Yes No

Multiplexing and demultiplexing over a single virtual circuit Explicit flow control Retransmission on timeout Reliable Transport Service

No No Yes Yes Yes No No Yes Yes Yes No No No No Yes No Yes No Yes Yes

Perhaps an easy way to visualize the Transport Layer is to compare it with a Post Office, which deals with the dispatch and classification of mail and parcels sent. Do remember, however, that a post office manages the outer envelope of mail. Higher layers may have the equivalent of double envelopes, such as cryptographic presentation services that can be read by the addressee only. Roughly speaking, tunneling protocols operate at the Transport Layer, such as carrying non-IP protocols such as IBM's SNA or Novell's IPX over an IP network, or end-to-end encryption with IPsec. While Generic Routing Encapsulation (GRE) might seem to be a Network Layer protocol, if the encapsulation of the payload takes place only at endpoint, GRE becomes closer to a transport protocol that uses IP headers but contains complete frames or packets to deliver to an endpoint. L2TP carries PPP frames inside transport packet.

[edit] Layer 5: Session Layer

The Session Layer controls the dialogues (connections) between computers. It establishes, manages and terminates the connections between the local and remote application. It provides for full-duplex, half-duplex, or simplex operation, and establishes checkpointing, adjournment, termination, and restart procedures. The OSI model made this layer responsible for graceful close of sessions, which is a property of the Transmission Control Protocol, and also for session checkpointing and recovery, which is not usually used in the Internet Protocol Suite. The Session Layer is commonly implemented explicitly in application environments that use remote procedure calls.

[edit] Layer 6: Presentation Layer

The Presentation Layer establishes context between Application Layer entities, in which the higher-layer entities may use different syntax and semantics if the presentation service provides a mapping between them. If a mapping is available, presentation service data units are encapsulated into session protocol data units, and passed down the stack. This layer provides independence from data representation (e.g., encryption) by translating between application and network formats. The presentation layer transforms data into the form that the application accepts. This layer formats and encrypts data to be sent across a network. It is sometimes called the syntax layer.[citation needed ] The original presentation structure used the basic encoding rules of Abstract Syntax Notation One (ASN.1), with capabilities such as converting an EBCDIC-coded text file to an ASCIIcoded file, or serialization of objects and other data structures from and to XML.

[edit] Layer 7: Application Layer

The Application Layer is the OSI layer closest to the end user, which means that both the OSI application layer and the user interact directly with the software application. This layer interacts with software applications that implement a communicating component. Such application programs fall outside the scope of the OSI model. Application layer functions typically include identifying communication partners, determining resource availability, and synchronizing communication. When identifying communication partners, the application layer determines the identity and availability of communication partners for an application with data to transmit. When determining resource availability, the application layer must decide whether sufficient network or the requested communication exist. In synchronizing communication, all communication between applications requires cooperation that is managed by the application layer. Some examples of application layer implementations include:
y

On OSI stack: o FTAM File Transfer and Access Management Protocol o X.400 Mail o Common management information protocol (CMIP) On TCP/IP stack: o Hypertext Transfer Protocol (HTTP), o File Transfer Protocol (FTP), o Simple Mail Transfer Protocol (SMTP) o Simple Network Management Protocol (SNMP)

6.Win 32 follows ans:c callin convention 7.win 16 follows ans:pascal call in convention 8.There was one question in padding of data structures 9.one question willbe on DOS(distributed operating system) A Distributed operating system is the logical aggregation of operating system software over a collection of independent, networked, communicating, and spatially disseminated computational nodes. [1] Individual system nodes each hold a discrete software subset of the global aggregate operating system. Each node-level software subset is a composition of two distinct provisioners of services.[2] The first is a ubiquitous minimal kernel, or microkernel, situated directly above each nodes hardware. The microkernel provides only the necessary mechanisms for a node's functionality. Second is a higher-level collection of system management components, providing all necessary policies for a node's individual and collaborative activities. This

collection of management components exists immediately above the microkernel, and below any user applications or APIs that might reside at higher levels.[3] These two entities, the microkernel and the management components collection, work together. They support the global systems goal of seamlessly integrating all networkconnected resources and processing functionality into an efficient, available, and unified system.[4] This seamless integration of individual nodes into a global system is referred to as transparency, or Single system image; describing the illusion provided to users of the global systems appearance as a singular and local computational entity.

10.How do you convert a bus to a hub? In computer architecture, a bus is a subsystem that transfers data between computer components inside a computer or between computers. Early computer buses were literally parallel electrical buses with multiple connections, but the term is now used for any physical arrangement that provides the same logical functionality as a parallel electrical bus. Modern computer buses can use both parallel and bit-serial connections, and can be wired in either a multidrop (electrical parallel) or daisy chain topology, or connected by switched hubs, as in the case of USB. A USB hub is a device that expands a single USB port into several so that there are more ports available to connect devices to a host system. USB hubs are often built into equipment such as computers, keyboards, monitors, or printers. When such a device has many USB ports they all usually stem from one or two internal USB hubs rather than each port having independent USB circuitry.
An Ethernet hub, active hub, network hub, repeater hub or hub is a device for connecting multiple twisted pair or fiber optic Ethernet devices together and making them act as a single network segment. Hubs work at the physical layer (layer 1) of the OSI model. The device is a form of multiport repeater. Repeater hubs also participate in collision detection, forwarding a jam signal to all ports if it detects a collision.

11.What does fork() statement do? ans:invokes a child process and returns the id associated with itto the parent process

A fork statement creates a new, asynchronous, process. The calling (forking) process continues immediately. The on-expression specifies the processor on which to run the new process. If the ON-part is omitted, the new process is run on the same processor as the invoking process. The number of processors available can be obtained through the standard function NCPUS (see Section 9.2). A fork statement is only allowed within the implementation part of a process (see Section 13). (So, it is not allowed within a function or operation.) The fork statement must contain one actual parameter for every formal parameter specified in the declaration of the process. Objects may be passed as shared parameter (see Section 13), thus establishing a communication channel between the forking process and the forked process. As forks are only allowed within processes, only objects declared local to a process (or declared in the parameter section of a process) can be shared.
ForkStatement = FORK ProcessIdentifier ActualParams [ON expression] . ualident .

12.Name atleast two protocols that are used by DLL to transmit frames? stop and wait protocol and sliding window protocol 13.There will be a sure question on Public key encrytpion scheme Public-key cryptography is a cryptographic approach which involves the use of asymmetric key algorithms instead of or in addition to symmetric key algorithms. Unlike symmetric key algorithms, it does not require a secure initial exchange of one or more secret keys to both sender and receiver. The asymmetric key algorithms are used to create a mathematically related key pair: a secret private key and a published public key. Use of these keys allows protection of the authenticity of a message by creating a digital signature of a message using the private key, which can be verified using the public key. It also allows protection of the confidentiality and integrity of a message, by public key encryption, encrypting the message using the public key, which can only be decrypted using the private key. Public key cryptography is a fundamental and widely used technology around the world. It is the approach which is employed by many cryptographic algorithms and cryptosystems. It underpins such Internet standards as Transport Layer Security (TLS) (successor to SSL), PGP, and GPG.

ProcessIdentifier =

14.Windows NT supports Preemptive multitasking 15.Question on round robin algorithm Round-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is both simple and easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks. The name of the algorithm comes from the round-robin principle known from other fields, where each person takes an equal share of something in turn.

] Process scheduling
Round-robin job scheduling may not be desirable if the sizes of the jobs or tasks are highly variable. A process that produces large jobs would be favoured over other processes. This problem may be solved by time-sharing, i.e. by giving each job a time slot or uantum (its allowance of CPU time), and interrupt the job if it is not completed by then. The job is resumed next time a time slot is assigned to that process. Example: The time slot could be 100 milliseconds. If job1 takes a total time of 250ms to complete, the round-robin scheduler will suspend the job after 100ms and give other jobs their time on the CPU. Once the other jobs have had their equal share (100ms each), job1 will get another allocation of CPU time and the cycle will repeat. This process continues until the job finishes and needs no more time on the CPU.
y

Job1 = Total time to complete 250ms (quantum 100ms). First allocation = 100ms. Second allocation = 100ms. Third allocation = 100ms but job1 self-terminates after 50ms. Total CPU time of job1 = 250ms.

1. 2. 3. 4.

Scheduling disciplines
Main article: Scheduling algorithm

Scheduling disciplines are algorithms used for distributing resources among parties which simultaneously and asynchronously request them. Scheduling disciplines are used in routers (to handle packet traffic) as well as in operating systems (to share CPU time among both threads and processes), disk drives (I/O scheduling), printers (print spooler), most embedded systems, etc. The main purposes of scheduling algorithms are to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources. Scheduling deals with the problem

of deciding which of the outstanding requests is to be allocated resources. There are many different scheduling algorithms. In this section, we introduce several of them.

[edit] First in first out

Main article: First In First Out

Also known as First Come, First Served (FCFS), is the simplest scheduling algorithm, FIFO simply queues processes in the order that they arrive in the ready queue.
y y y y y

Since context switches only occur upon process termination, and no reorganization of the process ueue is re uired, scheduling overhead is minimal. Throughput can be low, since long processes can hog the CPU Turnaround time, waiting time and response time can be low for the same reasons above No prioritization occurs, thus this system has trouble meeting process deadlines. The lack of prioritization does permit every process to eventually complete, hence no starvation.

[edit] Shortest remaining time

Main article: Shortest remaining time

Also known as Shortest Job First (SJF). With this strategy the scheduler arranges processes with the least estimated processing time remaining to be next in the queue. This requires advance knowledge or estimations about the time required for a process to complete.
y

y y

[edit] Fixed priority pre-emptive scheduling

Main article: Fixed priority pre-emptive scheduling

The O/S assigns a fixed priority rank to every process, and the scheduler arranges the processes in the ready queue in order of their priority. Lower priority processes get interrupted by incoming higher priority processes.
y y

Overhead is not minimal, nor is it significant. FPPS has no particular advantage in terms of throughput over FIFO scheduling.

y y

If a shorter process arrives during another process' execution, the currently running process may be interrupted, dividing that process into two separate computing blocks. This creates excess overhead through additional context switching. The scheduler must also place each incoming process into a specific place in the ueue, creating additional overhead. This algorithm is designed for maximum throughput in most scenarios. Waiting time and response time increase as the process' computational re uirements increase. Since turnaround time is based on waiting time plus processing time, longer processes are significantly affected by this. Overall waiting time is smaller than FIFO, however since no process has to wait for the termination of the longest process. No particular attention is given to deadlines, the programmer can only attempt to make processes with deadlines as short as possible. Starvation is possible, especially in a busy system with many small processes being run.

y y y

Waiting time and response time depend on the priority of the process. Higher priority processes have smaller waiting and response times. Deadlines can be met by giving processes with deadlines a higher priority. Starvation of lower priority processes is possible with large amounts of high priority processes ueuing for CPU time.

[edit] Round-robin scheduling

Main article: Round-robin scheduling

The scheduler assigns a fixed time unit per process, and cycles through them.
y y y y y

RR scheduling involves extensive overhead, especially with a small time unit. Balanced throughput between FCFS and SJF, shorter jobs are completed faster than in FCFS and longer processes are completed faster than in SJF. Fastest average response time, waiting time is dependent on number of processes, and not average process length. Because of high waiting times, deadlines are rarely met in a pure RR system. Starvation can never occur, since no priority is given. Order of time unit allocation is based upon process arrival time, similar to FCFS.

[edit] Multilevel queue scheduling

Main article: Multilevel feedback ueue

This is used for situations in which processes are easily divided into different groups. For example, a common division is made between foreground (interactive) processes and background (batch) processes. These two types of processes have different response -time requirements and so may have different scheduling needs.

[edit] Overview
Scheduling algorithm First In First Out Shortest Job First Priority based scheduling Round-robin scheduling CPU Utilization Throughput Turnaround time Response time Low Medium Medium High Low High Low Medium High High Medium High Medium Medium Low Medium High High Medium

Multilevel Queue scheduling High

[edit] How to choose a scheduling algorithm

When designing an operating system, a programmer must consider which scheduling algorithm will perform best for the use the system is going to see. There is no universal

best scheduling algorithm, and many operating systems use extended or combinations of the scheduling algorithms above. For example, Windows NT/XP/Vista uses a Multilevel feedback queue, a combination of fixed priority preemptive scheduling, round-robin, and first in first out. In this system, processes can dynamically increase or decrease in priority depending on if it has been serviced already, or if it has been waiting extensively. Every priority level is represented by its own queue, with round-robin scheduling amongst the high priority processes and FIFO among the lower ones. In this sense, response time is short for most processes, and short but critical system processes get completed very quickly. Since processes can only use one time unit of the round robin in the highest priority queue, starvation can be a problem for longer high priority processes.

16.Others were simple questions on C

PArt-B This will have codes in c and C++ and we will be asked to correct the codes to make it more efficient and write the output in other cases

Part-B This is a psychometric test for 1 hr and Part-A is for 30 mts . this section will have 100 questions, First there will be 50 statements(i.e 25 pairs) and for every pair we will have to select one which suits/fits in your opinion Eg: 1)Making a job in these modern days is by mere luck and has got nothing to do with intelligence level Making a job in these modern days is just by intelligence level alone. you can select any of them but make sure that you maintain the same view to the other questions.they will only how much your answers will correlate among them selves.there will be another question indirectly checking whether you believe in luck/hard work and in this you will have to support the view that you have already given. 2)There will be a list of 50 adjectives and you will have to select 10 adjectives that suits you most. 3)There will be 20 sets each containing 4 words and you will have to give them priority. Give priority 4 to the one that suits u more and 3 to the lesser one and do till 1. for eg: {short tempered,patience,understanding and refinement} you can rank itas: refinement-4(if u prefer that this suits u more) understanding -3

patience -2 shorttempered -1(this is given the least priority to indicate that this suits you the least) 3) there will be 10 tight corners given to youand youwill be aked how do you tackle them. The interview will be mostly on the projects that uhave done and will have simple questions on C and C++.

NEWGEN Profile
NEWGEN PROFILE Newgen Results Corporation, a wholly owned subsidiary of TeleTech Holdings Inc., was founded in 1982 and is head uartered in San Diego, California. Newgen provides dealerships with a complete suite of CRM tools. Our proprietary CRM technology houses vehicle data for 90 million consumers, sends out over 40 million letters, and places 40 million telephone calls annually.

Newgen s CRM tools deliver the right message, to the right people, at the right time to enhance loyalty and stimulate purchase behavior. Newgen combines marketing and customer retention with an in depth knowledge of dealership operations to deliver highly targeted and customized solutions to automotive dealers and manufacturers.

Careers At Newgen Results, talented individuals drive our business and its growth! We want to hire the best and the brightest to join our winning team. Newgen's customized solutions allow your dealers to flawlessly execute a CRM program by leveraging our field force of over 125 trained professional nationwide. This allows you and your dealers to both retain current customers and ac uire new customers while keeping the brand message consistent. Newgen maintains over 90 million consumer records for its dealerships, which provides us with in depth knowledge about your customers. Our products have proven their value in the marketplace. Newgen currently supports over 4,000 auto dealerships nationwide and maintains relationships with leading automotive companies and dealer groups including Audi, BMW, Ford, General Motors, Infiniti, Jaguar, Kia, Mitsubishi, Nissan, Saab, Volkswagen and Volvo.

Available Career Opportunities range from entry-level Teleservice positions to Technical Staff to Field sales positions and are located throughout the U.S. and Canada.

NEWGEN PROFILE Newgen Results Corporation, a wholly owned subsidiary of TeleTech Holdings Inc., was founded in 1982 and is head uartered in San Diego, California. Newgen provides dealerships with a complete suite of CRM tools. Our proprietary CRM technology houses vehicle data for 90 million consumers, sends out over 40 million letters, and places 40 million telephone calls annually. Newgen s CRM tools deliver the right message, to the right people, at the right time to enhance loyalty and stimulate purchase behavior. Newgen combines marketing and customer retention with an in depth knowledge of dealership operations to deliver highly targeted and customized solutions to automotive dealers and manufacturers. Careers At Newgen Results, talented individuals drive our business and its growth! We want to hire the best and the brightest to join our winning team.

Newgen s customized solutions allow your dealers to flawlessly execute a CRM program by leveraging our field force of over 125 trained professional nationwide. This allows you and your dealers to both retain current customers and ac uire new customers while keeping the brand message consistent. Newgen maintains over 90 million consumer records for its dealerships, which provides us with in depth knowledge about your customers. Our products have proven their value in the marketplace. Newgen currently supports over 4,000 auto dealerships nationwide and maintains relationships with leading automotive companies and dealer groups including Audi, BMW, Ford, General Motors, Infiniti, Jaguar, Kia, Mitsubishi, Nissan, Saab, Volkswagen and Volvo.

Available Career Opportunities range from entry-level Teleservice positions to Technical Staff to Field sales positions and are located throughout the U.S. and Canada. For more details visit Newgen Results Corporation

NEWGEN SELECTION PROCEDURE The selection procedure is of 3 rounds.. First is written test Second is psychometric test Third is personal interview Written test consists of 3 sections 1>verbal and aptitude 30 ques in 35 mins 30 marks questions were easy if you have some practice on it you will solve all of them in time 2>quanitative apti-10 ques in 10 mins easy section 3>Technical section-10 ques 20mins 10 marks

20 marks

3-5 ques on c rest on computer awareness(like full form of arp,ssl etc)

Psychometric test it is not a elimination round is just for your HR there were 50 ques and you have to answer them in 30 mins.. Personal interview Questions in C and data structure and some sort of HR.. if you have good knowledge of C you can clear it easily.... some of my interview question were.. 1>multiply a no. by 7 and 8 without using * operator;(my ans n<<3for 8 and n<<3-n for 7) 2>count no. of set bits in 8 it no.(my ans count=0;while(n){count++;n=n&(n-1);} 3>diffrence between char *p and char p[] 4>a matrix contains only 0s and 1s and I have to write a function which tells that whether the shape formed by 1s is straight lin or any other shape.(I have answered it using the concept of slope ,slope must be same for every two points) 5>construct a data structure to store large no.s of more than 50 bits(my ans hash table with link lists Posted by: Ramesh - Wed, Nov 18, 2009 at 2:28 AM This article has been viewed 14 times. Filed Under: NEWGEN Placement Papers Attachments