Scribd
Upload
50 views3 pages

Cst308-Draft Scheme

This document is a draft scheme for the Comprehensive Examination for the Sixth Semester B.Tech Degree at APJ Abdul Kalam Technological University, scheduled for June 2023. It includes instructions for answering 50 multiple-choice questions, each worth one mark, with no negative marking. The document outlines various topics related to computer science and technology, with each question followed by four possible answers.

Uploaded by

Anthony Stark
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views3 pages

Cst308-Draft Scheme

This document is a draft scheme for the Comprehensive Examination for the Sixth Semester B.Tech Degree at APJ Abdul Kalam Technological University, scheduled for June 2023. It includes instructions for answering 50 multiple-choice questions, each worth one mark, with no negative marking. The document outlines various topics related to computer science and technology, with each question followed by four possible answers.

Uploaded by

Anthony Stark
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DRAFT SCHEME1100CST308052302

Total Pages: 3
Reg No.: _______________ Name: _____________________________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SIXTH SEMESTER B.TECH DEGREE (R,S)COMPREHENSIVE EXAMINATION, JUNE 2023
(2019 SCHEME)
Course Code: CST 308
Course name: COMPREHENSIVE COURSE WORK
Max. Marks: 50 Duration: 1Hour

Instructions: (1) Each question carries one mark. No negative marks for wrong answers
(2) Total number of questions: 50
(3) All questions are to be answered. Each question will be followed by 4 possible answers of
which only ONE is correct.
(4) If more than one option is chosen, it will not be considered for valuation.
(5) Calculators are not permitted

1. c) O(n2)

2. d) 1 3 5 5 3 1
3. c) -A/B*C⋀DE

4 a) The pivot could be either the 7 or the 9.

5. c) n( k – 1) + 1

6. c) No right child

7. b) 5

8. b) dequeue

9. b) 2

10. a) queue

11. b) 2

12. c) a and b

13. c) Aging

14. a) High and efficient CPU utilization

15. c) 15 and 14

Page 1 of 3
DRAFT SCHEME1100CST308052302

16. d) 9, 10

17. c) 151

18. b) 9

19. c) C-SCAN

20. b) Internal

21. c) Cost effective connectivity and ease of attaching peripheral devices

22. c) Data Bus

23. b) parallel adder.

24.. d) 2, 3

25. b) 1110

26. c) Adds the values of both LOCA and R0 and stores it in R0

27. a) Slower cache access time

28. a) (j mod v) * k to (j mod v) * k + (k-1)


AA

29. b) Vertical organisation

30. d) Memory to I/O units

31. b) 3

32. a) mn

33. a) Dense index

34. b) 3 NF

35. b) Create

36. d) degree

37. d) 4

38. b) 2 NF

39. a) W-W Conflict

Page 2 of 3
DRAFT SCHEME1100CST308052302

40. b) A schedule that is not conflict serializable

41. b) 0011, 11001100

42. d) Output Alphabet

43. c) Non Deterministic PDA to Deterministic PDA

44. c) ab(a+b)^*bba

45. b) Given grammar is not regular

46. d) 9

47. d) All of the mentioned

48. d) L is a set of 0 n 1 n

49. d) All of the mentioned

50. c) Context sensitive

Page 3 of 3

You might also like