(A) OLTP
(B) OLAP
(C) Data warehousing
(D) Database
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
__ modeling technique is more appropriate for data warehousing.
(A) Dimensional
(B) Physical
(C) Entity Relationship
(D) None
Naturally Evolving Architecture occurred when an organization had a __ approach to handling the whole process of hardware and software architecture?
(A) Good
(B) Relaxed
(C) Not Relaxed
(D) None
The difference between Prims algorithm and Dijkstra s algorithm is that Dijkstra s algorithm uses a different key?
(A) True
(B) False
(C) NA
(D) NA
The greedy part of the Huffman encoding algorithm is to first find two nodes with smallest frequency?
(A) True
(B) False
(C) NA
(D) NA
Using ASCII standard the string abacdaacac will be encoded with 320 bits?
(A) True
(B) False
(C) NA
(D) NA
The input to the data warehouse can come from OLTP or transactional systems or other third party databases?
(A) True
(B) False
(C) NA
(D) NA
Relational databases allow you to navigate the data in __ direction that is appropriate using the primary, foreign key structure.
(A) Forward
(B) One
(C) Backward
(D) Any