Skip to main content

CS504 Current Finalterm Paper Spring 2014 Shared By Bibi

NOOR_E_EMAAN (BIBI ZANIAB)
MY TODAY PAPER CS504 (29-8-2014)
1: STL is a library of reuseable component provieded by............... Compilers.
2: Behavioral class pattern uses...............relationship to distrribute behavior between class .
3: which of the following is not member of subject class in the implementation of observer pattern.........
4: in dentation larger than............... Makes deeply nested code difficult to read and increase the change that the line must be split.
5: Boolean expression are evaluated through.............
6: .............language allows short circuiting .
7: About 2|3rd of the overall software cost incurs during.................phase execution .
8: During the program most of the time is spent on............
9: It is pretty hard to write error free,efficient ,and ........software.
10: Bit field are highty........dependent.
11: High level view of system is presented using.......
12 : In order to show the prence defect, a ...............break the system.
13: ...........gives the customer confidenece that the application has required features.
14: Unit testing process is done by .............stakeholders the software.
15: A"Manger object"can be removed from object model by ...........
16 : The object oriented approach.......
17: which technique along with testing should we use for increasing in a project? 2 marks
18: which design pattern provides a unified interface to a set of interface in sub_system? 2 marks
19: when we shift an application from one enviorment to other,the look of applicaton is different for both enviorment,what is the reason ot it? 2 marks
20: In the content of three_tire architecture "Interface" of application repersent which layer?3marks
21: what is the most desirable characteristic that a programer want to have for the software the devlops and why?Give reason? 3marks
22 : what are thee main element must be part of any test case?3 marks
23: write advantage and disadvantage of software inspection?3 marks

Comments

Popular posts from this blog

CS614 Quiz No.4 Shared by Princess (solved), Spring 2014

  “What means What”. The phrase refers to: Select correct option:  Meta data  External data Transformed data Internal representations Question # 2 of 10 Which of the following is NOT one of the activities of “Maintenance and Growth” phase in Kimball’s DWH development approach? Select correct option: Education Technical Education Program Support  Interface Deployment                 Question # 3 of 10 Horizontally wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records Dataset has attribute skews Dataset has partitioning skews                 Question # 4 of 10 Which of the following is NOT one of the top-10 mistakes that should be avoided during DWH development? Select correct option: Not interacting directly with end user Not being an accommodating person Isolating IT support people from business users Training the users with dummy data and considering it success             

CS502 Quiz No.4 File 3

There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges.   Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles .         (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True                 (Correct)   False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge   Cycle               (Correct)   Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True                 (Correct)   False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E)             (Corre

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Select correct option: int &x ;        ok int *x ; int x ; None of the given options he depth of a complete bina