Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation? Q.4 Explain the Direct Memory Access (DMA). Q.5 Explain Multiplexer and its Function with the help of diagram. I Q.1 Explain the flip-flop and its Types. Q.2 What is Gray Code? Explain it. Q.3 Explain the method of Parallel Processing. Q.4 Explain Multiplication Algorithms with Example Q.5 Explain the difference between Hardware control and Micro programmed control. Practical Assignment- First Q.1 Write a Program to subtract two numbers in 8086 microprocessor. Q.2 Explain the Instruction Cycle with Diagram? Practical Assignment- Second Q.1 Explain the multiplication of Two Floating print numbers with flow chart. Q.2 What is Macro? Explain Nested macro with example? Subject- Database Management Systems Maximum Marks: 20
Q. 1 What Do you understand by life System? Explain advantage of database system owner life system. Q. 2 Write short note on- (a) Specialization and Generalization. (b) Aqqreqation (c) Participation. Q. 3 What Do you understand by functional depending? Explain Inference rules for FD's. Q. 4 What Is the Role of schedule in DBMS, Explain different types of schedules with example. Q-1 Explain following. I (a) Database Architecture (b) (c) Data Abstraction. Data Independence Q2- Explain 3NF and BCNF With Example. Q3- What is Indexing! Explain B+ tree index. Q-4 What is Multivalued dependency! How can you distinguish it With Join dependency. Q. 1 Explain E-R model with example. Q. 2 Explain difference between- Project Assignment- First (a) Domain Vorsus Touple Calculus (b) Outer Join Versus Inner joins. Project Assignment- Second Q. 1 Explain unary operators used in relational scheme. Q. 2 Explain following- (a) Dead lock (b) Time stamp ordinary (c) Concurrency control Subject- Data Structure and Algorithm Maximum Marks: 20
1. What are the various types of data structure? Classify them in various categories explaining each in detail. 2. What is doubly link list? How it differ from singly link list. 3. What is tree? Explain tree with its basic technology. Describe binary tree. 4. Describe and differentiate BSF and DFS search techniques. 5. Write a detailed comparative study report of sequential and link storage in terms of memory utilization and processing time. I 1. Give a comparative study of standard data structure: Array, Record, Set and File. 2. Define the Stack & Queue. Explain in brief why circular implementation is better than linear implementation. 3. Define and illustrate the preorder and postorder traversal of binary tree. 4. What is Spanning tree? Explain Kruskal algorithm through example. 5. Explain the following: A) Hash function B) Heap tree C) B-tree Project Assignment- First 1. Write the procedures for inserting and deleting element from a queue in C language. 2. Write down a procedure to sort an array of integers using Quick sort. Project Assignment- Second 1. Write the recursive function for binary search. 2. Write the function in C that reverses a given linked list. Subject- Programming in Visual Basic Maximum Marks: 20
Q.1 What is IDE? Discuss the following components of IDE i, e project window, property window, form window, and code editor window. Q.2 What is user defined data types and control flow statements. Q.3 Define a forms and menus? Q.4 Explain the basic control of visual basic. Q.5 Explain about any five ACTIVE X controls with properties and examples in VB. I Q.1 What is GUI? List the advantages of GUI. Q.2 Explain the error handling and debugging. Q.3 What do you mean by event driven programming? Q.4 Differentiate between radio button and check box with examples. Q.5 Explain about OLE and API. Q.1 Define the following: Practical Assignment- First (i) Arrays (ii) MDI Practical Assignment- Second Q.1 Explain the various control structures with syntax and examples. Q.2 Explain about mouse events and dialog boxes in VB. Subject- Operating System Maximum Marks: 20
. What is an Operating System? Explain its function. Q2. What do you mean by Scheduling? Explain suitable example. Q3. What are deadlocks? Explain in briefly. Q4. What do you mean by File Organization System? Explain with Suitable example. Q5. Explain mutual exclusion in brief. I. Explain concepts of Inter process communication in briefly? Q2. What do you mean by Critical section problem? Explain in brief. Q3. What is demand paging? Explain its Concept with suitable example. Q4. What is multiprocessor System? Explain with Suitable example. Q5. Explain performance Evaluation Techniques. Project Assignment- First. What do you mean by page replacement techniques? Q2. Explain Distributed system Structure? Project Assignment- Second. Write down concept of cryptography? Q2. Explain network structures with example? Subject- Programming in C Maximum Marks: 20 What do you mean by algorithm? Explain with suitable example.
Q2 Q3 Q4 Q5 Q2 Q3 Q4 Q5 Q2 Q2 What do you mean by Tokens? Explain with suitable examples. What do you mean by Control Structure? Explain with suitable example. Explain the working of array of structure with suitable example. What do you mean by Pre-Processor? Explain all preprocessor Directives. I Explain Generation of Programming Language. What do you mean by Primary and Secondary Data types? Explain with suitable examples. What do you mean by Array? Explain working of multiplication of two Matrixes of 3 by 3. Differentiate the Union and Structure with suitable examples. What do you mean by File Handling? Explain with suitable example. Practical Assignment- First Write a program to find result of board or university (With Ladder). Write a program to find swap of any two numbers using as following condition: a) With temporary variable. b) Without temporary variables. c) Without temporary and arithmetic operator. Practical Assignment- Second Write a program to find sum of all element of array. Write a program to find sum of all digit of given any integer number. Subject- Mathematical Foundations of Computer Science Maximum Marks: 20 Q.1 Define the Set theory?
Q.2 Define the algebraic structure? Q.3 Describe the sub field and sub stream? Q.4 Note about the historical aspect of automata? Q.5 What is the context free grammar? I Q.1 Define the De-Morgan s low? Q.2 Definition of kernel of F? Q.3 Explain the solution by method of generating Function? Q.4 Write about the Boolean algebraic expression? Q.5 Describe the turning machines for computing function?