Amdocs Placement Paper 2012

Amdocs Placement Paper 2012Amdocs Placement Paper 2012.

Amdocs Solution Job 2012 Placement  question paper with answers Amdocs 2012  question with solution you can download it in FREE, if Amdocs 2012 test paper in text or pdf for Amdocs 2012 Answer Keys you can download Amdocs for MBA/ B.Tech / M.Tech freshers 2012 page also just Go to menu bar, Click on File->then Save.

Amdocs Solution Campus 2012 exam recruitment question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students Amdocs Placement paper for freshers 2012 paper is available for all the students in FREE and also Amdocs Placement  question paper for B.Tech MCA 2012 fully solved Amdocs 2012 with answer keys and solution.

Amdocs Placement Paper 2012

You can get daily updates on Amdocs Solution freshers Campus 2012 from www.oldquestionpapers.net here you can also check similar links for other related study materials on Amdocs Here Amdocs Placement  question bank 2012.

 

When a function is recursively called, all automatic variables :
(A) are initialized during each execution of the function
(B) are retained from the last execution
(C) are maintained in a stack
(D) are ignored

Enumeration variables can be used in :
(A) search statement like an integer variable
(B) break statement
(C) preprocessor commands
(D) function statement

 int arr[ ]={1, 2, 3, 4}
int count;
incr( ) {return ++count;}
main( )
{
arr[count++]=incr( );
printf(“arr[count]=%d\n”, arr[count]);
}
The value printed by the above program is :
(A) 1 (B) 2 (C) 3 (D) 4

When one-dimensional character array of unspecified length is assigned an initial value :
(A) an arbitrary character is automatically added to the end of the string
(B) ‘o’ is added to the end of the string
(C) length of the string is added to the end of the string
(D) ‘end’ is added to the end of the string

The declaration “unsigned u” indicates :
(A) u is an unsigned character
(B) u is an unsigned integer
(C) u is a character
(D) u is a string

In DBMS, deferred update means :
(A) All the updates are done first but the entries are made in the log file later
(B) All the log files entries are made first but the actual updates are done later
(C) Every update is done first followed by a writing on the log file
(D) Changes in the views are deferred till a query asks for a view

Which statement is false regarding data independence ?
(A) Hierarchical data model suffers from data independence
(B) Network model suffers from data independence
(C) Relational model suffers only from logical data independence
(D) Relational model suffers only from physical data independence

Which of the following tools is not required during system analysis phase of system development life cycle ?
(A) Case tool (B) RAD tool
(C) Reverse engineering (D) None of these

Two phase protocol in a database management system is :
(A) a concurrency mechanism that is not deadlock free
(B) a recovery protocol used for restoring a database after a crash
(C) Any update to the system log done in 2-phases
(D) not effective in Database

Which algorithm has same average, worst case and best case time ?
(A) Binary search (B) Maximum of n number
(C) Quick sort (D) Fibonacci search

 Binary search tree is an example of :
(A) Divide and conquer technique
(B) Greedy algorithm
(C) Back tracking
(D) Dynamic Programming

A 10 BASE-2 network is limited to :
(A) 20 bytes per data field (B) 30 stations per segment
(C) 40 segments (D) 50 feet of cable

The network 198.78.41.0 is a :
(A) Class A Network (B) Class B Network
(C) Class C Network (D) Class D Network

The subnet mask 255.255.255.192
(A) Extends the network portion to 16 bits
(B) Extends the network portion to 26 bits
(C) Extends the network portion to 36 bits
(D) Has no effect on the network portion of an IP address

The LAPB frame structure and the frame structure of SDLC are :
(A) Opposite (B) Identical
(C) Reversed (D) Non-identical

Similar Pages…

See Also……