Q1. You are developing a new application that optimizes the processing of a manufacturing plant’s operations. You need to implement a data structure that works as a “buffer” for overflow capacity. When the manufacturing capacity is available, the items in the buffer need to be processed in the order in which they were added to the buffer. Which data structure should you use to implement such buffer? 

A. array 

B. linked list 

C. stack 

D. queue 

View Answer

Q2. You are C# developer who is developing a Windows application. You need to provide derived classes the ability to share common functionality with base classes but still define their own unique behavior. Which object oriented programming concept should you use to accomplish this functionality? 

A. encapsulation 

B. abstraction 

C. polymorphism 

D. inheritance 

View Answer

Q3. Which of the following is not true about linked lists? 

A. A linked list does not allow random access to its items. 

B. A link to the head node can help you locate all the nodes in a linked list. 

C. The items in a linked list must be stored in contiguous memory locations. 

D. Linked lists are extremely fast in performing insert and delete operations. 

View Answer

Q4. You are developing a C# program that makes use of a singly linked list. You need to traverse all nodes of the list. Which of the following items will you need to accomplish this requirement? 

A. link to the head node 

B. link to the tail node 

C. data in the head node 

D. data in the tail node 

View Answer

Q5. Which of the following presses is responsible for providing the ASP.NET functionality? 

A. inetinfo.exe 

B. iexplorer.exe 

C. aspnet_isapi.dll 

D. aspnet_wp.exe 

View Answer

Q6. You are designing a database for your company and are reviewing the normalization for the database tables. 

You review the following Customer table: 

Which of the following statements is true? 

A. The highest normal form of the Customer table is the first normal form. 

B. The highest normal form of the Customer table is the second normal form. 

C. The highest normal form of the Customer table is the third normal form. 

D. The Customer table is not normalized. 

View Answer

Q7. You are reviewing a C# program. The program contains the following class: 

public struct Rectangle { public double Length {get; set;} public double Width { get; set; } } 

The program executes the following code as part of the Main method: 

Rectangle r1, r2; 

r1 = new Rectangle { Length = 10.0, Width = 20.0 }; 

r2 = r1; 

r2.Length = 30; 

Console.WriteLine(r1.Length); 

What will be the output when this code is executed? 

A. 10 

B. 20 

C. 30 

D. 40 

View Answer

Q8. You are developing a sorting algorithm that uses partitioning and comparison to arrange an array of numbers in the correct order. You write a method that partitions the array so that the items less than pivot go to the left side, whereas the items greater than pivot go to the right side. The partitioning method has the following signature: 

static int Partition (int[] numbers, int left, 

int right, int pivotIndex) Which of the following algorithms should you use to sort the array using the Partition method? 

A. static int[] QuickSort(int[] numbers, 

int left, int right) 

{ 

if (right > left) 

{ 

int pivotIndex = left + (right - left) / 2; 

pivotIndex = Partition( 

numbers, left, right, pivotIndex); 

QuickSort( 

numbers, left, pivotIndex - 1); 

QuickSort( 

numbers, pivotIndex + 1, right); 

} 

return numbers; 

} 

B. static int[] QuickSort(int[] numbers, 

int left, int right) 

{ 

if (right > left) 

{ 

int pivotIndex = left + (right - left) / 2; 

pivotIndex = Partition( 

numbers, left, right, pivotIndex); 

QuickSort( 

numbers, left, pivotIndex); 

QuickSort( 

numbers, pivotIndex + 1, right); 

} 

return numbers; 

} 

C. static int[] QuickSort(int[] numbers, 

int left, int right) 

{ 

if (right > left) 

{ 

int pivotIndex = left + (right - left) / 2; 

pivotIndex = Partition( 

numbers, left, right, pivotIndex); 

QuickSort( 

numbers, left, pivotIndex - 1); 

QuickSort( 

numbers, pivotIndex, right); 

} return numbers; } 

D. static int[] QuickSort(int[] numbers, 

int left, int right) 

{ 

if (right > left) 

{ 

int pivotIndex = left + (right - left) / 2; 

pivotIndex = Partition( 

numbers, left, right, pivotIndex); 

QuickSort( 

numbers, left, pivotIndex + 1); 

QuickSort( 

numbers, pivotIndex + 1, right); 

} 

return numbers; 

} 

View Answer

Q9. You have completed developing several major features of a new software application. You plan to provide an early look at the product to important customers to gather some early feedback. Your application still misses features and you haven’t yet optimized the application for performance and security. Which kind of testing should you perform with a limited number of important customers? 

A. white-box testing 

B. black-box testing 

C. alpha testing 

D. beta testing 

View Answer

Q10. You are studying various sorting algorithms to understand, analyze, and compare the various sorting techniques. Which of the following techniques should you utilize when using the BubbleSort algorithm? 

A. comparison 

B. comparison and swap 

C. comparison and partition 

D. partition and swap 

View Answer