Q.19 A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies is in
Asked in HPSC to Final Answer Key of the Master Question Booklet of Screening Test - Assistant Professor (College Cadre) - Computer Science (Advt. No. 45/) in Higher Education Department, Haryana 2024
Answer under review: our editors are checking this question. Try the other HPSC Prelims previous year questions questions meanwhile.
More HPSC Prelims previous year questions questions
- Q.20 Consider the following statements : (i) The distance vector routing algorithm may cause “count to infinity” problem. (ii) Flooding is a static routing algorithm. (iii) The link state routing algorithm is also known as Bellman-Ford routing algorithm. How many of the statements given above are correct ?
- Q.21 In which coding approach, a programmer first writes the test scripts, and then writes the code to pass the tests ?
- Q.22 Which of the following statements is FALSE in view of the process of constructing a composite NFA N(st) for the regular expression st using Thompson’s construction algorithm ?
- Q.23 Which of the following processes is faster for threaded trees compared with their unthreaded counterparts ?
- Q.24 In a well-tuned pipeline machine with five-stages, after how many clock cycles one-one instruction rolls out every clock cycle assuming that all the stages take the same amount of time ?
- Q.25 In C++ programming, by default, access to all data members and member functions of a struct is
- Q.26 Which of the following can be viewed as an attempt to construct a parse tree for the input starting from the root and creating the nodes of the parse tree in preorder ?
- Q.27 In Java, access to a private member of a class is granted only to