Skip to main content

CS504 Current Finalterm Paper Spring 2014 Shared By Muskan

Date 28/8/2014
Q41:How the magic members create problem in members?
Q42:Give the piece of code which contain infeasible path
If(a==1)//1
C=c-1;//2
If(a!=b)//3
C=c+1;
Rewrite the code infeasible path removed.
Q43:ADSL Company is providing different internet packages for users. These packages are not only economical but provide high speed internet. What is their underlying architectural style?
Q44:Cyclomatic complexity V(G) for graph G is
V(G)= E-N+2
What E and N stand for
Q45:Can a tester write test case without having an in depth knowledge about the system and requirement from user.give solid comment
Q46:Mention any two guidelines which you think are necessary to write “comments”?
Q47:Assume that we are going to develop an application for a new user email and SMS alert. Which design pattern will be the best suited?
Q48:Do you think that only testing a sufficient for making a program defect free?
Give justification in support your answer.
Q49:What is meant by non reproducible bugs?
Give an example.
Q50:Difference b/w Black box testing and white box testing.
Q51: Code given tha usy Modularize krna tha.


Comments

Post a Comment

Please give us your feedback & help us to improve this site.

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             
1 comment
Read more

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
Post a Comment
Read more

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
Post a Comment
Read more