DBMS model question solution [Bsc. CSIT database management system]

Database
management system
(DBMS)

Model Question Solution bsc csit

csit notes DBMS model question solution

Section A (Long questions)

Attempt any two questions. (2 × 10 = 20)

1. Consider the following database and write SQL as given:

Customer (Cno, Cname, Caddress, Ccontact)

Purchase (Cno,Pid)

Product (Pid, Pname, price, quantity) (5 × 2 = 10)

a. Find the names of all products having price 1000.

b. Find the name of those customers who purchased Dell Laptop.

c. Find the total number of products purchased by customer ‘Ram’

d. Increase price of all products by 5 %

e. Find total price of Apple Mobiles

2. What are the benefits of using normalization? Discuss 1NF, 2NF, and 3NF with suitable example. (2.5 + 7.5 = 10)

3. Define Relational Algebra (RA) and explain its six fundamental operations with suitable example. (2 + 8 = 10)

Section B (Short questions)

Attempt any eight questions. (8 × 5 = 40)

4. What database schema? What are functions of database administrator? (2 +3 = 5)

5. Construct an E-R diagram for online course registration where students register courses online.(5)

6. Discuss referential integrity with example. (5)

7. What is functional dependency? Why do we need inference rules? (2 + 3 = 5)

8. Why do we need concurrency control? Discuss two phase locking protocol. (2 + 3 = 5)

9. Why do we need database recovery? Discuss shadow paging technique for database recovery. (2 + 3 = 5)

10. Differentiate concept of Centralized and Client/Server Architectures for DBMSs with suitable example. (5)

11. Define Transaction and explain its desirable properties. (5)

12. Explain constraints and characteristics of Specialization and Generalization of data model. (5)

DOWNLOAD SOLUTION⏬

OS Model Question Solution [Bsc csit Operating System 4th Semester]

OS Model Question Solution [Bsc csit Operating System 4th Semester]

Long Questions

Attempt any two questions. (2 × 10 = 20)

1 What is sleep and wakeup? Demonstrate problem with suitable code snippet and illustration.

2 When page fault occurs and how it is handled? Demonstrate Second Chance, and LRU page replacement algorithm for memory with three frames and following reference string: 1,3,7,4,5,2,3,6,4,5,7,8, 5,1,4

3 What is Inode? Why it is superior to other file allocation approaches? Consider 20-GB disk with 8-KB block size. How much memory space will be occupied if contiguous, and File allocation table is used for file allocation. Assume that each FAT entry takes 4 byte.

Short Questions

Attempt any eight questions. (8 × 5 = 40)

4 Define the terms shell and system call? How it is handled? Illustrate with suitable example.

5 What are main goals of interactive system scheduling? Discuss priority scheduling along with its pros and cons.

6 How starvation differs from deadlock? Consider the following situation of processes and resources:

• What will happen if process P3 requests 1 resource?

• What will happen if process P4 requests 1 resource?

7 Consider a virtual memory and physical memory of size 128-MB and 32-MB respectively. Assume that page size is 4-KB. What will be the number of bits required for page number, frame number, and offset? Find physical address for the virtual address 20500. (Assume that value at index 5 of page table is 2)

8 Define the term race condition? Justify that race condition leads data loss or incorrect data.

9 Explain directory implementation techniques employed in operating systems briefly.

10 What is the main purpose of disk scheduling algorithms? Which disk scheduling technique is best but impractical? Explain the algorithm with example.

11 How threads differ from processes? Explain thread usages.

12 Write short notes on:

a) Linux Scheduling

b) Fragmentation

DOWNLOAD SOLUTION⏬ 

AI Model Question Solution Bsc csit

AI Model Question Solution Bsc csit

Long Answer Questions

Attempt any Two questions. [2*10=20]

1. What do you mean by heuristic search? Given following state space representation, show how greedy best first and A* search is used to find the goal state. [2+8] [Unit 3]

S is the start state and G is the goal state. The heuristics of the states are h(S)= 12 , h(A)= 8, h(D)= 9, h(B)= 7, h(D)= 6, h(E)= 4, h(C)= 5 , h(F)= 2, h(G)= 0.

2. How resolution algorithm is used as a rule of inference in predicate logic? Convert following sentences into FOPL. [4+6] [Unit 4]

All over smart person’s are stupid

Children’s of all stupid persons are naughty

Roney is Children of Harry

Harry is over smart

Prove that “Roney is naughty” using resolution algorithm.

3. What is Artificial Neural Network? Define its mathematical model. Discuss how back propagation algorithm is used to train ANN? [1+2+6] [Unit 5]

Section B

Short Answer Questions

Attempt any Eight questions. [8*5=40]

4. Describe how Turing Test is used to define AI as acting humanly? [ Unit 1 ]

5. Differentiate between model based and simple reflex agent with an example. [Unit 2]

6. What is Natural Language Processing? Discuss the steps of natural language processing. [1+4] [Unit 6]

7. How belief networks are constructed? Consider the probability of having cloudy is 50%. The probability that it will rain given the conditions it will be cloudy and if it is winter is 30%. The probability of being winter is 50%. The probability that it will be shiny is 70%. Now construct a belief network for this example. [2+3] [Unit 4]

8. What is expert system? Explain the major components of Expert System? [1+4] [Unit 6]

9. How mini-max algorithm is used in game search. For the following state space, show

how mini-max algorithm finds path for the two players. [2.5+2.5][ Unit 3 ]

win draw win win lose lose draw

10. How knowledge is represented using semantic networks? Illustrate with an example. [5]

[Unit 4]

11. What is supervised learning? Discuss how Naïve Bayes model works? [Unit 5]

12. Construct PEAS framework for following intelligent agents. [ Unit 2]

a. Internet Shopping Assistant

b. English Language Tutor

DOWNLOAD SOLUTION⏬

CN Model Question Solution Bsc CSIT

CN Model Question Solution Bsc CSIT

Group A (Long Answer Question Section)

Attempt any TWO questions. (2x10=20)

1. Suppose you are assigned to design a LAN for an office having 3 departments. Each department will have 50 computers locating in 10 rooms each equipped with 5 computers. Make your own justification while selecting connecting devices and accessories.

2. Highlight on the importance of routing algorithm. Explain Distance Vector Routing algorithm and compare it with link state routing.

3. Explain various congestion control approaches.

Group B (Short Answer Question Section)

Attempt any EIGHT questions. (8x5=40)

4. Is 192.16.144.64/27 a host, network or broadcast address? In which layer of OSI model do HUB, Switch and Router operate on.9+99999999999999

5. Describe the working procedure of Token bus and Token ring.

6. Why do you think network traffic analysis is carried out? How does IPv6 overcome the disadvantages of IPv4?

7. Find Hamming Code for data 01100111.

8. Differentiate between frame relay and ATM.

9. What is the function of proxy server? Explain about electronic mail.

10. Demonstrate the use of socket programming for creating network application using UDP and TCP with necessary diagrams.

11. Explain DNS with reference to its hierarchy and records.

12. Write Short Notes (Any Two):

a) Firewall

b) Packet Switching

c) NGN

DOWNLOAD SOLUTION⏬

TOC Model Question Solution Bsc csit

TOC Model Question Solution Bsc csit

Theory Of Computation

Bsc csit 

1. Define the extended transition function of DFA. Draw a DFA accepting language L= {1n | n=2,3,4…….}. Show acceptance of strings 1110011 and 1110 using extended transition function. [2+4+4]

2. What is deterministic pushdown automaton? Configure a pushdown automaton accepting the language, L= {wCwR | w € (a,b)*}. Show instantaneous description of strings abbCbba and baCba. [2+4+4]

3. How a Turing Machine works? Construct a Turing Machine accepting the language, L= { (n )n }. Also show the transition diagram of the machine. Illustrate whether a string (( )) is accepted by the Turing Machine or not. [2+6+2]

Section B

Short Answer Questions

Attempt any Eight questions. [8*5=40]

4. When a grammar is said to be in CNF? Convert following grammar to CNF; [ 1+4]

S→ 1A | 0B | є

A→ 1AA | 0S | 0

B→ 0BB | 1 |A

C→CA | CS

5. Define epsilon NFA. Configure equivalent epsilon NFA for the regular expression

(ab U a)*. [1+4]

6. Differentiate Kleen Closure from Positive Closure. For Σ ={0,1}, compute Σ* and Σ2. [3+2]

7. Write the regular expression over {0, 1} for strings [2.5+2.5]

a. not ending with 0.

b. of length at least 3 that ends with 00.

8. What is undecidable problem? Define Post’s Correspondence Problem with an example. [1+4]

9. How pumping lemma can be used to prove that any language is not a regular language? Show that language, L={0r 1r|n ≥0} is not a regular language. [4+1]

10. Discuss how Turing Machine with multiple tracks differs from a Turing Machine with multiple tapes. [5]

11. How context free grammars are defined? Write a context free grammar over {0,1}, where the strings start and end with the same symbol. [2+3]

12. What is halting problem? How can you argue that halting problem is undecidable? [1+4]

DOWNLOAD SOLUTION⏬