CS301 Current Midterm paper Shared by Uzma, Spring 2014

Done with CS301

MCQ's were quite easy.

SUBJECTIVE:

1.Write a function having arguments with integer data type refrence veriable marks
and float data type refrence veriable CGPA,function will do nothing. 2 marks

2.ek question tha jis mn poocha gaya tha k binry tree main x node find karny k Iiye all
nodes ko comparison karna zaroori hy? 3 marks

3.write a C++ code that prints odd numbers from 1 to 99 by recursive function 5
marks

4.10,80,12,70,90,60;13,16,95,97 in ka AVL tree bnana tha. 5 marks

5.what is diffrence blw sibling and brother node \? 2 marks

6.ek or 3 marks ka conceptual question tha..bhooI gae wording.

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

CS614 Quiz No.4 Shared by MT Khan (Solved)

Question # 1 of 10 ( Start time: 09:04:39 PM ) Total Marks: 1 A typical cycle of implementing the change in DWH comprises of the sequence: Select correct option: Production -> QA -> Development Development-> QA -> Production(CORRECT) Development -> Production -> QA Production -> Development -> QA Question # 2 of 10 ( Start time: 09:05:16 PM ) Total Marks: 1 Vertically wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records(CORRECT) Dataset has attribute skews Dataset has partitioning skews Question # 3 of 10 ( Start time: 09:05:43 PM ) Total Marks: 1 In ___________ phase of kimballs approach, we identify the components needed now and in future. Select correct option: Requirement definition Architectural design Product development Analytical application development Question # 4 of 10 ( Start time: 09:06:56 PM ) Total Marks: 1 Technical architecture design supports the communicat

Virtual University Forum

Search This Blog