4. TYPICAL CONFIGURATION OF COMPUTER SYSTEM 1 MARK QUESTIONS 1. Define the clock speed of the CPU 2. What is a data bus? 3. What is bus? 4. Expand POST. 5. Where does L1 is located? 2 MARK QUESTIONS 1. What is the purpose of AGP slot? 2. Expand (a) BIOS (b) CMSO (c) ISA 3. Name any two type of Output ports? 4. Name any two type of input slots? 5. Explain serial port and parallel port 6. Explain type of Mother board? 7. Briefly explain SDRAM 3 MARK QUESTIONS 4 Explain the characteristics of Mother board: Explain the different component of motherboard. Explain bus in details Explain the different types of Motherboard. Explain cache memory in details Explain about UPS and SMPS. What is UPS?Explain its types Nogaona 2, BOOLEAN ALGEBRA MARK QUESTIONS State Involution law Prove:-1+X=1 What is maxterm? What is tautology and fallacy? State Involution law What is minterm? What is the another name of Boolean algebra? State Distributive law. WHO DEVELOPED BOOLEAN ALGEBREA. |ARK QUESTIONS. Prove that (X+Y\(X+Y)=X Prove algebraically that X + XY =x What is the canonical form of Boolean expression? Mention the types of Canonical expression on auNe ene 4. Prove algebraically that (X+Y\(X+Z)=X+YZ. 5. Prove that X(X+XY)=X. 5 MARK QUESTIONS 1. Given the boolean function F (A, B, C, D) = (0,4,8,9,10,11,12,13,15) reduce by the Karnaugh map using SOP 5, eee B,C,D)=3(5.6.7,8.9.10,14) Reduce (A, B, C, D)= 1 (0, 4, 6, 7, 8, 12, 14, 15) using K-map. Using maps simplify the following expression in four variables W, X, Y and Z mo + m4 +m8+m9+m10+m11+mi2+m13 + m15 Reduce (A, B, C, D) = £ (0, 1, 2, 3, 4, 5, 9, 10, 14, 15) Reduce F(A.B,C,D)=X(0,1,2,3,8,9,10,11)using K-map. NO ARON3. LOGIC GATES 1 MARK QUESTIONS What is output of two What is truth table? What is the output of the two input AND gate for inputs: A= 0 &B = 1 What is mean by universal gates? What is NOT operator? Write the standard symbol for NAND gate Write the truth table and symbol for OR gate. GIVE AN EXAMPLE FOR DERIVE GATES Give logic symbol for AND gate ARK QUESTIONS put XNOR gate for the input A=0,8 2 oevannwnp 1. Write symbol for NOR gate. 2. Explain XOR gate. 3. What is mean by dual form? Given an example: 4. What is principle of duality? given a example. 5. What is mean by proof by perfect induction? Given an example. 6. Give logic symbol and truth table for NOR gate. 3 MARK QUESTIONS 1. What is meant by proof by perfect induction 7 Give an example 2. Write the symboi of XOR, XNOR and NAND gates. 3. Realize AND, OR & NOT gates suing NOR gate. 4. Write the truth table and standard symbol of AND gate. 5. Realize AND, OR & NOT gates using NAND gate. 4. DATA STRUCTURES. 4 MARK QUESTIONS. 1. What is binary tree? 2. What is tree? 3. What is queue? explain types of queues 4. What are primitive data structure? list all the operation on primitive data structure. 5. What is stack? 6. What is linear data structure? 3 MARK QUESTIONS. 1. Define Traversal: Write an algorithm to traverse an array 2) Write an algorithm for enqueue. 3. Write an algorithm to Insert an element into an one dimensional array 4) Write an algorithm for linear search 6. What is queue datastructure? Mention any two applications of queue datastructures. 5 MARK QUESTIONS. 4. Write an algorithm for PUSH and POP. 2) Write an algorithm to delete an clement from an array. 3. What is stack? List and explain the the operation on stack. 4) Write an algorithm for Binary search 5. What is an array? classification of array? explain memory representation of 6. Memory using single dimensional array. 7. Memery using Two dimensional array (formula for major row and major column) 8. Explain all type of operation on single dimensional arrays 9. Write an algorithm for insertion sort 10 Write the algorithm to delete a data element at the end of a linked list 4 Write an algorithm to insert an element from an array 42. What is stack? Explain operations on stack? Write any 2 application of stack 13. What is queue? explain type of queue? explain operation on queue? write any 2 application of queue. 14, What is linked list? explain type of lined list? operation on linked list. 415. Memory representation of (a) Stack (b) queue (¢) linked list 46. Write an algorithm to sort an array using insertion sort 47. What is primitive datastructures?Explain differant operations on primitive datastructure.6. OOPS CONCEPTS 4 MARK QUESTIONS 1. List one advantage of OOPS. 2. What is data abstraction? 3. What is message passing? 4. List any one advantage of OOPS. 5. What is class? 6. What is object? 7. List some High level language? 5 MARK QUESTIONS Explain the advantage of OOPs . Explain the dis-advantage of OOPS Explain (a) class (b) object (c) message passing (d) data abstraction (e) inheritance () polymorphism. 4. Write the difference between procedural programming and object oriented programming 5. Explain the dis-advantage of OOPs 6. List some applicaiton of OOPs. 7. Give any five characteristics of object oriented programming. ena