M.Sc. (CS) First Semester Examination (Year 2015) Discrete Mathematics Structures Subject Code: MSC-101 Paper Code: SRS-141

Size: px
Start display at page:

Download "M.Sc. (CS) First Semester Examination (Year 2015) Discrete Mathematics Structures Subject Code: MSC-101 Paper Code: SRS-141"

Transcription

1 Time : 20 Minutes M.Marks : 10 M.Sc. (CS) First Semester Examination (Year 2015) Discrete Mathematics Structures Subject Code: MSC-101 Paper Code: SRS-141 Section A (Objective Type Questions) Roll No. Enrollment No. Invigilator s Signature Attempt all questions. Each question carries 1/2 marks. Use the symbol ( ) in the box for marking the correct answer. Q.No. 1. Choose the correct answer- 1. The inverse of i in the multiplicative group {1, -1, i, -i}is- a) 1 b) -1 c) i d) -i 2. If G is an undirected planer graph on n vertices with e edges then- a) e < = n b) e < = 2n c) e < = 3n d) None of these 3. The number of circuits that can be created by adding an edge between any two vertices in a tree is- a) Two b) Exactly one c) At least two d) None of these 4. The set difference of set A with null set is- a) A b) Null c) U d) B 5. The expression (a + ac) is equivalent to- a) a b) a + c c) c d) 1 1

2 6. Maximum degree of any vertex in a simple graph with n vertices is- a) (n-1) b) (n+1) c) (2n-1) d) n 7. Which are the two set that are equal- a) A = {1, 2} and B = {1} b) A = {4, 5} and B {1, 4, 5} c) A = {1, 2, 3} and B {3, 1, 2} d) A = {0, 1, 2} and B {0, 1} 8. A function is said to be. If and only if f(a)= f(b) implies that a=b and a, b in the domain f. a) One to many b) Many to many c) One to One d) Many to One 9. p q is logically equivalent to- a) ~ q p b) ~ p q c) ~ p q d) ~ p q 10. Which of following is negation of the statement 2 is even and -3 is negative a) 2 is even and -3 is not negative b) 2 is odd and -3 is not negative c) 2 is even or -3 is not negative d) 2 is odd or -3 is not negative 11. A Partial order relation is reflexive, anti symmetric and a) Transitive b) Symmetries c) Bi-Symmetric d) Asymmetric 2

3 12. Find the number of relations from A = {cat, dog, rat} to B = {male, female} a) 64 b) 6 c) 32 d) Which of the following proposition is tautology? a) (p q) q b) p (q p) c) p (p q) d) Both (b) and (c) 14. Two sets are called disjoint if there. is empty seta) Union b) Difference c) Intersection d) Complement 15. Which of the following function of f: y x y y is not ontoa) f (a, b) = a + b b) f (a, b) = a b) f (a, b) = b d) f (a, b) = a - b 16. The inverse of function f(x) = x a) f 1 (y) = (y 2) 1 2 b) f 1 (y) = (y) 1 3 c) f 1 (y) = (y 2) 1 3 d) f 1 (y) = (y - 2) 17. The cardinality of power set of set {0, 1, 2} is- a) 8 b) 7 c) 6 d) The domain of the function f(x) = 5 x x 2-6 is- a) (-3, -2) (2, 3) b) [-3, -2) [2, 3) c) [-3, -2] [2, 3] d) None of these 19. If R is a relation from set a {11, 12, 13) to set B = {8, 10, 12} defined by y = x -3 then, R 1 is- a) {(8, 13), (11, 10)} b) {(8, 11), (10, 13)} c) {(10, 11), (8, 12)} d) {(0)} 3

4 20. Set having single element is- a) Null set b) Infinite set c) Singleton set d) Empty set

5 M.Sc. (CS) First Semester Examination (Year 2015) Discrete Mathematics Structures Subject Code: MSC-101 Paper Code: SRS-141 Roll No. Time : 2 Hrs. 40 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No.2. Q.No.3. Q.No.4. Q.No.5. Q.No.6. Define with example. 1. Well formed formulas 2. Tautologies 3. Contradiction 4. Contingency Simplify- (a) ~ (~ p q) (~ p q) (p q) (b) ~ (~ P Q) (~ P ^ Q) State and prove De-Morgan s Law. Prove that A B = (A-B) B. Prove that the set of all positive rational number from a group under the composition defined by a*b = ab 2 Prove that if G is an abelian group then for all a, b ε G and integer n, (ab) n = a n b n. Minimize the Boolean function using K-Maps? f (10, 12, 13, 14, 15) What is don t care condition in K-Map? Define with example- 1. Multi graph 2. Pseudo graph 3. Trival graph 4. Null Graph Define with example- 1. Open Walk 2. Closed Walk 3. Path 4. Circuit or Cycle 1

6 Attempt all questions. Each question carries 8 marks. Section C (Long Answer Type Questions) Q.No.7. Write down the preposition denoted by each of the following expression when the variables take the value in domain {0, 1} a) x yp (x, y) b) y x p (x, y) Show the following equivalence without truth tablea) p (q p) ~ p (p q) b) p (q r) (p q) (p r) c) (p q) (r q) ( p r) q) Q.No.8. Q.No.9. Q.No.10. Q.No.11. Prove that relation R on set N x N defined by (a, b), R (c, d) a + d = b + c, for all (a, b), (c, d) N x N is an equivalence relation. Prove that a relation R on set A is symmetric if R = R 1 Explain following properties of groups- 1. Uniqueness of identify 2. Cancellation laws 3. Uniqueness of inverse Explain the polish expression in detail and show their compilation with example? If {L, } is a lattice then for any a, b, c L.prove thata (b c) (a b) V (a c) Evaluate- 1. (a + b). a 1. b 1 2. [a + (a 1. b 1 )]. [a 1 + (a. b)] 3. a. b. c + a 1 + b 1 + c 1 4. (a + b + c) 1 Explain storage representation techniques of graphs with example. Prove that total number of edges in a simple graph with n vertices is n (n 1)

7 M.Sc. (CS) First Semester Examination (Year 2015) Programming with C++ Subject Code: MSC-102 Paper Code: SRS-142 Roll No. Enrollment No. Time : 20 Minutes M.Marks : 10 Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1/2 marks. Use the symbol ( ) in the box for marking the correct answer. Q. No. 1. Choose the correct answer- 1. The address of a variable temp of type float isa) * temp b) & temp c) Float & temp d) Float temps 2. What is the output of the following code char symbol [3] = { a, b, c }; for (int index=0; index <3; index++) cout << symbol [index]; a) a b c b) abc c) abc d) abc 3. The process of building new classes from existing one is called. a) Polymorphism b) Structure c) Inheritance d) Cascading 4. If a class C is derived from class B, which is derived from class A, all through public inheritance, than a class C member function can access. a) Protected and Public data only in C and B. b) Protected and Public data only in C c) Private data in A and B d) Protected data in A and B 5. If the variable count excess 100, a single statement that Prints Too many is - a) if (count < 100) cout << Too many ; b) if (count > 100) cout < > Too many ; c) if (count > 100) cout << Too many ; d) None of these 1

8 6. Usually a pure virtual functiona) Has complete function body b) Will never be called c) Will be called only to delete an object d) Is defined only in derived class 7. To perform stream I/o with disk files in C++, you shoulda) Open and close files as in procedural language b) Use classes derived from ios c) Use C language library functions to read and write data. d) Include the IOS TREAM. H header file 8. Overloading the function operatora) Requires a class with an over loaded operator b) Requires a class with over loaded [ ] operator c) Allows you to create objects that act syntactically like functions d) None of these 9. In C++ the range of signed integer type variable is. a) 0 to 2 16 b) to c) -2 7 to d) 0 to If x=5, y=z then x y equals. (Where is a bit wise X operator) a) b) c) d) None of these 11. If an array is declared as- Int a[4] = {3,0,1,2}, than values assigned to a[0] & a[4] will be. a) 3, 2 b) 0, 2 c) 3, 0 d) 0, This pointera) Implicitly points to an object b) Can be explicitly used in a class c) Can be used to return an object d) All of these 2

9 13. With in a switch statementa) Continue can be used but Break cannot be used b) Continue cannot be used but Break can be used c) Both continue and Break can be used d) Neither continue nor Break can be used 14. Data member which are statica) Cannot be assigned a value b) Can only be used in static functions c) Cannot be defined in a union d) Can be accessed outside the class 15. Which of the following is false for Cin? a) It represents standard input b) It is an object of stream class c) It is a class of which stream is an object d) Using in the data can be read from user s terminal 16. It is possible to declare as a friend a) A member function b) A global function c) A class d) All of these 17. In multiple inheritance a) The base classes must have only default constructors b) Cannot have virtual functions c) Can include virtual classes d) None of these 18. Declaration of a pointer reserves memory space a) For the object b) For the pointer c) Both for the object and the pointer d) None of these 3

10 19. For (; ;) a) Means the test which is done using some expression is always true b) Is not valid c) Will loop forever d) Should be written as for ( ) 20. The operator << when over loaded in a classa) Must be a member function b) Must be a non member function c) Can be both (a) & (b) above d) Cannot be over loaded

11 M.Sc. (CS) First Semester Examination (Year 2015) Programming With C++ Subject Code: MSC-102 Paper Code: SRS-142 Roll No. Time : 2 Hrs.40 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No. 2. What is Procedure Oriented Programming? What is Operator Precedence? Q.No. 3. What is function Prototyping? Explain Inline functions. Q.No. 4. Q.No. 5. Q.No. 6. What is Pointer Variables? Explain What is Over Loading? What is Derived Class and Base Class? What is Virtual Base Class? Explain the Stream Classes. Write a notes on command line arguments in C++ Section C (Long Answer Type Questions) Attempt all questions. Each question carries 8 marks. Q.No. 7. Q.No. 8. What is user defined data types? Explain derived data type. What is tokens and expressions? Explain the scope resolution operator. What is Arrays in C++? Explain the array of strings. What is defining Member Function? Explain with example. 1

12 Q.No. 9. Q.No. 10. Q.No. 11. What is Pointer in C++? Write a short note on C++ dynamic memory allocation operator. Write a note on overloading unary and binary operators. What is Inheritance? Explain with example. Write a note on passing parameter to the base class. What is Manipulators? Explain. Write a note on working with files in C++?

13 M.Sc. (CS) First Semester Examination (Year 2015) Computer Organization & Architecture Subject Code: MSC-103 Paper Code: SRS-143 Roll No. Enrollment No. Time : 20 Minutes M.Marks : 10 Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1/2 marks. Use the symbol ( ) in the box for marking the correct answer. Q. No. 1. Choose the correct answer- 1. Which of these sets of logic gates are designated as universal gates? a) N, NAND b) X, N, NAND c), NOT, AND d) N, NAND, XN 2. What will be Excess-3 code for decimal 584? a) b) c) d) A J-K Flip-Flop is in a no-change condition whena) J=1, K=1 b) J=1, K=0 c) J=0, K=1 d) J=0, K=0 4. Which of the following is the most widely used alphanumeric? a) Gray b) ASCII c) Parity d) EBCDIC 5. Convert hexadecimal value C1 to binary. a) b) c) d) The sum of equals. a) b) c) d) What is a major disadvantage of RAM? a) Its access speed is too slow b) Its matrix size is too big c) It is volatile d) High power consumption 1

14 8. What is the computer main memory? a) Hard drive and RAM b) CD-ROM and hard drive c) RAM and ROM d) CMOS and hard drive 9. Which of the following expressions is in the sum-of-products (SOP) form? a) AB+CD b) AB (CD) c) (A+B) (C+D) d) (A) B (CD) 10. A register in the microprocessor that keeps track of the answer or results of any arithmetic or logic operation is thea) Stack pointer b) Program counter c) Instruction pointer d) Accumulator 11. The devices that provide the means for a computer to communicate with the user or other computers are referred to asa) CPU b) ALU c) I/O d) None of these 12. How many unique symbols are used in the decimal number system? a) One b) Nine c) Ten d) Unlimited 13. Give the decimal of binary a) (6) 10 b) (9) 10 c) (18) 10 d) (20) Which unit is known as nerve center of computer? a) ALU b) CU c) Memory d) Registers 15. A three byte instruction requires for its execution. a) Four fetch cycles b) Three fetch cycles c) Two fetch cycles d) Only one fetch cycle 16. Floating point representation is used to store. a) Boolean values b) Whole numbers c) Real integers d) Integers 2

15 17. Convert decimal 64 to binary. a) b) c) d) A 64 bit word consist ofa) 4 bytes b) 8 bytes c) 10 bytes d) 12 bytes 19. DMA is particularly suited for data transfer betweena) Disk drive and CPU b) Disk drive and RAM c) Disk drive and ROM d) Disk drive and I/O 20. For the SOP expression ABC + ABC + ABC how many 1s are in the truth table s output column? a) 1 b) 2 c) 3 d)

16 M.Sc. (CS) First Semester Examination (Year 2015) Computer Organization & Architecture Subject Code: MSC-103 Paper Code: SRS-143 Roll No. Time : 2 Hrs.40 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No. 2. Q.No. 3. Q.No. 4. Q.No. 5. Q.No. 6. Explain Exclusive (X) and Exclusive N (XN) with truth table. Draw the circuit diagram of Half adder and Full adder with truth table. Convert (49.31) 10 into Hexadecimal number. Explain importance of floating point representation with example. Explain the types of registers with their function. Explain memory reference instruction. Explain the organization of computer using I/O processor. Explain the types of computer instruction. What is Interrupt? Explain different types. Explain the program controlled Data Transfer. Section C (Long Answer Type Questions) Attempt all questions. Each question carries 8 marks. Q.No. 7. What is Flip-Flop? Discuss the most common types of Flip-flops. a) Simplify F=Ʃ m (2, 3, 5, 9, 10, 11, 14, 15) using K-Map method. b) Explain Multiplexer and De- Multiplexer. 1

17 Q.No. 8. a) Add (15) 10 and (27) 10 in BCD code. b) Explain Excess-3 (XS 3 ) code. a) Explain packed BCD and unpacked BCD with suitable examples. b) Convert (128) 10 into Binary, Octal and Hexadecimal. Q.No. 9. a) What is Instruction Cycle? Draw flow chart for a simple instruction cycle. b) Explain different types of memory that are used by computer. What are basic operations performed by any computer system? Draw a block diagram to illustrate the basic organization of a computer system and explain the function of each unit. Q.No. 10. a) What are the general purpose and special purpose register? Discuss their functions. b) What is the purpose of stack pointer and program counter? Explain it. What are various types of addressing modes? Discuss each addressing mode with suitable examples. Q.No. 11. What is DMA? Using block diagram, explain how data is transferred using DMA controller. What are different methods of transferring data between CPU and I/O devices?

18 M.Sc.(CS) First Semester Examination (Year 2015) Windows and PC Software Subject Code: MSC-104 Paper Code: SRS-144 Roll No. Enrollment No. Time : 20 Minutes M.Marks : 10 Section A (Objective Type Questions) Invigilator s Signature Attempt all questions. Each question carries 1/2 marks. Use the symbol ( ) in the box for marking the correct answer. Q. No. 1. Choose the correct answer- 1. The batch file uses the extensiona).bat b).doc c).prg d).dos 2. MS-DOS was developed ina) 1991 b) 1984 c) 1971 d) Which command is used to clear the screen? a) CLs b) Clear c) CL screen d) All of these 4. Which command displays the directory list including files in tree structure? a) Dir/s/f b) Tree/f c) Tree/s/f d) Dir/f 5. A graphical user interface displaysa) Graphics b) Text c) Both (a) and (b) d) None of these 6. During the boot process, the looks for the system file. a) CD b) BIOS c) CPU d) DVD 1

19 7. A named area on a disk that is used to store related subfolders and files is calleda) Desktop b) Folder c) Menu d) Window 8. If the displayed system time and date is wrong, you can reset it usinga) Write b) Calendar c) Write file d) Control panel 9. The extension name of file in MS-Word isa).xls b).doc c).dbf d).dll 10. The keys format is selected to make the text bold. a) Ctrl + B b) Ctrl + X c) Ctrl + P d) None of these 11. Which of the following is not a paragraph formatting option? a) Alignment b) Margin c) Bold face d) Tab stop 12. What is the smallest and largest font size available in font size tool on formatting toolbar? a) 8 and 72 b) 8 and 68 c) 6 and 72 d) 6 and Excel worksheet consists of columns. a) 356 b) 258 c) 256 d) This is a mathematical functiona) SUM ( ) b) LEN ( ) c) RIGHT ( ) d) PEL ( ) 15. Short-cut keys for new workbook creationa) Ctrl + O b) Ctrl + N c) Alt + N d) None of these 16. To change fonts and size of a cella) Format Cell b) Insert Cell c) View Cell d) None of these 2

20 17. Which one of the following option is available in slide show menu? a) Record narration b) Spelling c) Change case d) Slide layout 18. Extension of a power point file isa).ppt b).txt c).jpg d).slide 19. How can you stop a slide show? a) Press the right arrow b) Press escape c) Press the left arrow d) Press the down arrow 20. Which file format can be added to a power point show? a).gif b).jpg c).wav d) All of these

21 M.Sc. (CS) First Semester Examination (Year 2015) Windows and PC Software Subject Code: MSC-104 Paper Code: SRS-144 Roll No. Time : 2 Hrs.40 Mts. M.Marks : 60 Section B (Short Answer Type Questions) Attempt all questions. Each question carries 4 marks. Q.No. 2. Q.No. 3. Q.No. 4. Q.No. 5. Q.No. 6. State any five DOS external commands with example. What is Booting Process? How will you create folders in windows? Discuss the various features of windows operating system. What are the different features used in formatting a paragraph in MS-Word? What are the different objects that can be placed in Header and Footer? How many worksheets are there in a workbook by default? Is there any maximum limit? What are the advantages of electronic worksheet? Explain slide master and explain its utility. What are templates? Where are they used? Section C (Long Answer Type Questions) Attempt all questions. Each question carries 8 marks. Q.No. 7. How to create and execute a batch file in MS-DOS? Give example. Explain the following MS-DOS commands with suitable examplei) DEL ii) FMAT iii) COPY iv) REN 1

22 Q.No. 8. Write applications of Control Panel. Discuss the hardware requirement for running windows in a PC. Q.No. 9. How to create table in MS-Word document and how to add and delete rows and columns? What are the steps involved in recording a macro? Q.No. 10. How to perform following operations in Data Cell. i) Insert ii) Delete iii) Copy iv) Move Define the logical functions used in MS-Excel. Q.No. 11. Explain slide sorter in MS-Power Point. Explain the features of MS-Power Point in detail

END-TERM EXAMINATION

END-TERM EXAMINATION (Please Write your Exam Roll No. immediately) END-TERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA-103 Subject: Digital Electronics Time: 3 Hours Maximum

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science

More information

Code No: 07A3EC03 Set No. 1

Code No: 07A3EC03 Set No. 1 Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems

More information

1. Draw general diagram of computer showing different logical components (3)

1. Draw general diagram of computer showing different logical components (3) Tutorial 1 1. Draw general diagram of computer showing different logical components (3) 2. List at least three input devices (1.5) 3. List any three output devices (1.5) 4. Fill the blank cells of the

More information

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR SECOND SEMESTER FINAL EXAMINATION, 2013/2014 SESSION ITC2223 COMPUTER ORGANIZATION & ARCHITECTURE DSEW-E-F 1/13 18 FEBRUARY

More information

CS/IT DIGITAL LOGIC DESIGN

CS/IT DIGITAL LOGIC DESIGN CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems

More information

B.Sc II Year Computer Science (Optional)

B.Sc II Year Computer Science (Optional) Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor

More information

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)

More information

Angel International School - Manipay 2 nd Term Examination March, 2018 Ict

Angel International School - Manipay 2 nd Term Examination March, 2018 Ict c Grade 10 Angel International School - Manipay 2 nd Term Examination March, 2018 Ict Duration: 03:00 Hours Index No:- Part I 1) A computer that is optimized to provide services to other computers over

More information

Summary of Course Coverage

Summary of Course Coverage CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities

More information

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is ----- Write the first 9 decimal digits in base 3. (c) What is meant by don

More information

Question Total Possible Test Score Total 100

Question Total Possible Test Score Total 100 Computer Engineering 2210 Final Name 11 problems, 100 points. Closed books, closed notes, no calculators. You would be wise to read all problems before beginning, note point values and difficulty of problems,

More information

B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning

B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning 1 B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning Time allowed : Three Hours Maximum Marks : 50 Answer all ten questions (20 words each). Each question carries equal marks. Answer all

More information

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002 Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002 2 Practicals per week External marks :80 Internal Marks : 40 Total Marks :120 University

More information

QUESTION BANK FOR TEST

QUESTION BANK FOR TEST CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice

More information

HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment

HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment Assignment 1. What is multiplexer? With logic circuit and function table explain the working of 4 to 1 line multiplexer. 2. Implement following Boolean function using 8: 1 multiplexer. F(A,B,C,D) = (2,3,5,7,8,9,12,13,14,15)

More information

Computer Organization and Levels of Abstraction

Computer Organization and Levels of Abstraction Computer Organization and Levels of Abstraction Announcements PS8 Due today PS9 Due July 22 Sound Lab tonight bring machines and headphones! Binary Search Today Review of binary floating point notation

More information

www.vidyarthiplus.com Question Paper Code : 31298 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2013. Third Semester Computer Science and Engineering CS 2202/CS 34/EC 1206 A/10144 CS 303/080230012--DIGITAL

More information

Computer Organization and Levels of Abstraction

Computer Organization and Levels of Abstraction Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean

More information

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method SET - 1 1. a) Convert the decimal number 250.5 to base 3, base 4 b) Write and prove de-morgan laws c) Implement two input EX-OR gate from 2 to 1 multiplexer (3M) d) Write the demerits of PROM (3M) e) What

More information

Computer Logical Organization Tutorial

Computer Logical Organization Tutorial Computer Logical Organization Tutorial COMPUTER LOGICAL ORGANIZATION TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Computer Logical Organization Tutorial Computer

More information

Injntu.com Injntu.com Injntu.com R16

Injntu.com Injntu.com Injntu.com R16 1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder

More information

Digital Logic Design Exercises. Assignment 1

Digital Logic Design Exercises. Assignment 1 Assignment 1 For Exercises 1-5, match the following numbers with their definition A Number Natural number C Integer number D Negative number E Rational number 1 A unit of an abstract mathematical system

More information

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE VOLUME I Chapter 1 : Introduction to computers and Number Systems 1.1 Introduction to Computers 1.1.1 History of Computers 1.1.2 Data, Information and program

More information

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April SET - 1 II B. Tech II Semester, Supplementary Examinations, April - 2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions

More information

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 2015-2016 (ODD

More information

SECTION-A

SECTION-A M.Sc(CS) ( First Semester) Examination,2013 Digital Electronics Paper: Fifth ------------------------------------------------------------------------------------- SECTION-A I) An electronics circuit/ device

More information

AFN-1255 PCA131 P.G.D.C.A. DIPLOMA EXAMINATION, MAY 2011 First Semester Computer Applications FUNDAMENTALS OF DIGITAL COMPUTER (Non-CBCS 2004 onwards) Time : 3 Hours Maximum : 100 Marks Part A (15 1 =

More information

Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.

Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system. Assignment No. 1 1. State advantages of digital system over analog system. 2. Convert following numbers a. (138.56) 10 = (?) 2 = (?) 8 = (?) 16 b. (1110011.011) 2 = (?) 10 = (?) 8 = (?) 16 c. (3004.06)

More information

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY Question 1. a) State the two absorption laws. Verify any one of them using truth table. b) Reduce the following expression : F(A,B,C)= (0,1,2,3,4,5,6,7) Also find

More information

DIGITAL ELECTRONICS. P41l 3 HOURS

DIGITAL ELECTRONICS. P41l 3 HOURS UNIVERSITY OF SWAZILAND FACUL TY OF SCIENCE AND ENGINEERING DEPARTMENT OF PHYSICS MAIN EXAMINATION 2015/16 TITLE OF PAPER: COURSE NUMBER: TIME ALLOWED: INSTRUCTIONS: DIGITAL ELECTRONICS P41l 3 HOURS ANSWER

More information

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)/SEM-2/CS-201/ BASIC COMPUTATION & PRINCIPLES OF COMPUTER PROGRAMMING

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)/SEM-2/CS-201/ BASIC COMPUTATION & PRINCIPLES OF COMPUTER PROGRAMMING Name :. Roll No. :..... Invigilator s Signature :.. CS/B.TECH (NEW)/SEM-2/CS-201/2012 2012 BASIC COMPUTATION & PRINCIPLES OF COMPUTER PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in

More information

COIMBATORE EDUCATIONAL DISTRICT

COIMBATORE EDUCATIONAL DISTRICT COIMBATORE EDUCATIONAL DISTRICT REVISION EXAMINATION JANUARY 2015 STD-12 COMPUTER SCIENCE ANSEWR KEY PART-I Choose the Correct Answer QNo Answer QNo Answer 1 B Absolute Cell Addressing 39 C Void 2 D

More information

This tutorial gives a complete understanding on Computer Logical Organization starting from basic computer overview till its advanced architecture.

This tutorial gives a complete understanding on Computer Logical Organization starting from basic computer overview till its advanced architecture. About the Tutorial Computer Logical Organization refers to the level of abstraction above the digital logic level, but below the operating system level. At this level, the major components are functional

More information

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object CHAPTER 1 Introduction to Computers and Programming 1 1.1 Why Program? 1 1.2 Computer Systems: Hardware and Software 2 1.3 Programs and Programming Languages 8 1.4 What is a Program Made of? 14 1.5 Input,

More information

CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM

CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM Name: Student ID: Signature: Section (circle one): George Steve Your signature acknowledges your understanding of and agreement

More information

Logic Design: Part 2

Logic Design: Part 2 Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary

More information

SRE VIDYASAAGAR HIGHER SECONDARY SCHOOL

SRE VIDYASAAGAR HIGHER SECONDARY SCHOOL SRE VIDYASAAGAR HIGHER SECONDARY SCHOOL Sub : Computer Science Full Portion Exam Max. Mark : 150 Class : XII - EM Time : 3.00 Hrs PART - I I. Choose the correct answer. 75 x 1 = 75 1. In Save As dialog

More information

ACADEMIC YEAR PLANNING - F.Y.J.C. ( ) F.Y.J.C. COMPUTER SCIENCE (Theory)

ACADEMIC YEAR PLANNING - F.Y.J.C. ( ) F.Y.J.C. COMPUTER SCIENCE (Theory) ACADEMIC YEAR PLANNING - F.Y.J.C. (2015-16) F.Y.J.C. COMPUTER SCIENCE (Theory) JULY Number Systems & Binary Arithmetic : Binary number, decimal, octal, hexadecimal numbers, BCD,conversion from one number

More information

Short Notes of CS201

Short Notes of CS201 #includes: Short Notes of CS201 The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with < and > if the file is a system

More information

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SUBJECT: CSE 2.1.6 DIGITAL LOGIC DESIGN CLASS: 2/4 B.Tech., I SEMESTER, A.Y.2017-18 INSTRUCTOR: Sri A.M.K.KANNA

More information

(ii) Simplify and implement the following SOP function using NOR gates:

(ii) Simplify and implement the following SOP function using NOR gates: DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EE6301 DIGITAL LOGIC CIRCUITS UNIT I NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES PART A 1. How can an OR gate be

More information

COMPUTER SCIENCE Paper 1

COMPUTER SCIENCE Paper 1 COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

CS201 - Introduction to Programming Glossary By

CS201 - Introduction to Programming Glossary By CS201 - Introduction to Programming Glossary By #include : The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with

More information

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course COURSE STRUCTURE (W.E.F. 2011 Batch Students) (Total Unit 7.5) Course Theory Unit Course Sessional Unit Code Code DCP 4001 Data Structures 1.0 DCP 4002 Data Structures Lab. 0.5 DEC 4003 Electronics Circuits

More information

R07

R07 www..com www..com SET - 1 II B. Tech I Semester Supplementary Examinations May 2013 SWITCHING THEORY AND LOGIC DESIGN (Com. to EEE, EIE, BME, ECC) Time: 3 hours Max. Marks: 80 Answer any FIVE Questions

More information

Syllabus for Computer Science General Part I

Syllabus for Computer Science General Part I Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions

More information

1. Mark the correct statement(s)

1. Mark the correct statement(s) 1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another

More information

GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04

GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04 GARDEN CITY UNIVERSITY Bachelor of Computer Applications SEMESTER- I Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04 Unit 1 Programming Basics 1.1 Introduction to Programming

More information

Chapter1 Overview of computers

Chapter1 Overview of computers 1 Chapter1 Overview of computers 1. What is a computer? 2. Which is the earliest computing machine? 3. Who invented the pascaline? 4. What is Charles babbage known as? 5. What is the machine proposed by

More information

Semester I.

Semester I. Semester I Code No. Name of the Paper Marks (Theory + CCE) FC Hindi 35+15 FC English 35+15 FC Development of Entrepreneurship 35+15 FC Udiyamita vikas 35+15 BCA 101 Computer Fundamentals 35+15 BCA 102

More information

3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0

3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0 1. The number of level in a digital signal is: a) one b) two c) four d) ten 2. A pure sine wave is : a) a digital signal b) analog signal c) can be digital or analog signal d) neither digital nor analog

More information

Bits and Bytes. Why bits? Representing information as bits Binary/Hexadecimal Byte representations» numbers» characters and strings» Instructions

Bits and Bytes. Why bits? Representing information as bits Binary/Hexadecimal Byte representations» numbers» characters and strings» Instructions Bits and Bytes Topics Why bits? Representing information as bits Binary/Hexadecimal Byte representations» numbers» characters and strings» Instructions Bit-level manipulations Boolean algebra Expressing

More information

SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI

SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI SHRI ANGALAMMAN COLLEGE OF ENGINEERING AND TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI 621 105 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC1201 DIGITAL

More information

CS201 Latest Solved MCQs

CS201 Latest Solved MCQs Quiz Start Time: 09:34 PM Time Left 82 sec(s) Question # 1 of 10 ( Start time: 09:34:54 PM ) Total Marks: 1 While developing a program; should we think about the user interface? //handouts main reusability

More information

Philadelphia University Student Name: Student Number:

Philadelphia University Student Name: Student Number: Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2018/2019 Dept. of Computer Engineering Course Title: Logic Circuits Date: 03/01/2019

More information

EE292: Fundamentals of ECE

EE292: Fundamentals of ECE EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 22 121115 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Binary Number Representation Binary Arithmetic Combinatorial Logic

More information

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034 No. of Printed Pages : 4 Roll No.... rd 3 Sem. / ECE Subject : Digital Electronics - I SECTION-A Note: Very Short Answer type questions. Attempt any 15 parts. (15x2=30) Q.1 a) Define analog signal. b)

More information

IB Computer Science Topic.2-

IB Computer Science Topic.2- Topic.2- Computer Organization Designed by: Allan Lawson Sources: Online Materials, thanks for all Topic 2.1.1 Computer Architecture Outline the architecture of a central processing unit (CPU) and the

More information

Course Title III Allied Practical** IV Environmental Studies #

Course Title III Allied Practical** IV Environmental Studies # Part Ins. hrs / week Dur.Hr s. CIA Marks Total Marks Credit Page 1 of 5 BHARATHIAR UNIVERSITY,COIMBATORE-641 046 B.Sc. PHYSICS DEGREE COURSE SCHEME OF EXAMINATIONS (CBCS PATTERN) (For the students admitted

More information

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CONTENTS Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CHAPTER 1: NUMBER SYSTEM 1.1 Digital Electronics... 1 1.1.1 Introduction... 1 1.1.2 Advantages of Digital Systems...

More information

COMPUTER APPLICATION

COMPUTER APPLICATION Total No. of Printed Pages 16 HS/XII/A.Sc.Com/CAP/14 2 0 1 4 COMPUTER APPLICATION ( Science / Arts / Commerce ) ( Theory ) Full Marks : 70 Time : 3 hours The figures in the margin indicate full marks for

More information

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY (DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures

More information

Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)

More information

Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team

Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team Question No: 1 ( Marks: 2 ) Write a declaration statement for an array of 10

More information

COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I

COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS YEAR / SEM: III / V UNIT I NUMBER SYSTEM & BOOLEAN ALGEBRA

More information

Scheme G. Sample Test Paper-I

Scheme G. Sample Test Paper-I Sample Test Paper-I Marks : 25 Times:1 Hour 1. All questions are compulsory. 2. Illustrate your answers with neat sketches wherever necessary. 3. Figures to the right indicate full marks. 4. Assume suitable

More information

For Teacher's Use Only Q No Total Q No Q No

For Teacher's Use Only Q No Total Q No Q No Student Info Student ID: Center: Exam Date: FINALTERM EXAMINATION Spring 2010 CS201- Introduction to Programming Time: 90 min Marks: 58 For Teacher's Use Only Q No. 1 2 3 4 5 6 7 8 Total Marks Q No. 9

More information

Why Don t Computers Use Base 10? Lecture 2 Bits and Bytes. Binary Representations. Byte-Oriented Memory Organization. Base 10 Number Representation

Why Don t Computers Use Base 10? Lecture 2 Bits and Bytes. Binary Representations. Byte-Oriented Memory Organization. Base 10 Number Representation Lecture 2 Bits and Bytes Topics Why bits? Representing information as bits Binary/Hexadecimal Byte representations» numbers» characters and strings» Instructions Bit-level manipulations Boolean algebra

More information

Hours / 100 Marks Seat No.

Hours / 100 Marks Seat No. 17333 13141 3 Hours / 100 Seat No. Instructions (1) All Questions are Compulsory. (2) Answer each next main Question on a new page. (3) Illustrate your answers with neat sketches wherever necessary. (4)

More information

Why Don t Computers Use Base 10? Lecture 2 Bits and Bytes. Binary Representations. Byte-Oriented Memory Organization. Base 10 Number Representation

Why Don t Computers Use Base 10? Lecture 2 Bits and Bytes. Binary Representations. Byte-Oriented Memory Organization. Base 10 Number Representation Lecture 2 Bits and Bytes Topics! Why bits?! Representing information as bits " Binary/Hexadecimal " Byte representations» numbers» characters and strings» Instructions! Bit-level manipulations " Boolean

More information

SUBJECT COMPUTER SCIENCE PAGE 1

SUBJECT COMPUTER SCIENCE PAGE 1 BACHELOR OF SCIENCE (B.Sc.) (THREE YEAR DEGREE COURSE) SUBJECT COMPUTER SCIENCE PAGE 1 COURSE STRUCTURE FIRST YEAR PAPER 101: Computer Fundamental 50 MARKS PAPER 102: Programming IN C 50 MARKS PAPER 103:

More information

10.1. Unit 10. Signed Representation Systems Binary Arithmetic

10.1. Unit 10. Signed Representation Systems Binary Arithmetic 0. Unit 0 Signed Representation Systems Binary Arithmetic 0.2 BINARY REPRESENTATION SYSTEMS REVIEW 0.3 Interpreting Binary Strings Given a string of s and 0 s, you need to know the representation system

More information

Page 1. Where Have We Been? Chapter 2 Representing and Manipulating Information. Why Don t Computers Use Base 10?

Page 1. Where Have We Been? Chapter 2 Representing and Manipulating Information. Why Don t Computers Use Base 10? Where Have We Been? Class Introduction Great Realities of Computing Int s are not Integers, Float s are not Reals You must know assembly Memory Matters Performance! Asymptotic Complexity It s more than

More information

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan UNIT I - NUMBER SYSTEMS AND LOGIC GATES Introduction to decimal- Binary- Octal- Hexadecimal number systems-inter conversions-bcd code- Excess

More information

COPYRIGHTED MATERIAL INDEX

COPYRIGHTED MATERIAL INDEX INDEX Absorption law, 31, 38 Acyclic graph, 35 tree, 36 Addition operators, in VHDL (VHSIC hardware description language), 192 Algebraic division, 105 AND gate, 48 49 Antisymmetric, 34 Applicable input

More information

WYSE Academic Challenge Computer Science Test (State) 2013 Solution Set

WYSE Academic Challenge Computer Science Test (State) 2013 Solution Set WYSE Academic Challenge Computer Science Test (State) 2013 Solution Set 1. Correct Answer: E 2's complement systems are often used in computing because negating a number involves simple operations in the

More information

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit.

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit. 14CS IT302 November,2016 II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for CSE & IT Discrete Mathematical Structures (4X12=48 Marks) 1. Answer all questions (1X12=12 Marks) a (Pv~P) is

More information

1... is not part of the status bar. a. page number b. line c. column d. section *e. drop cap. 2. Convert to base 2

1... is not part of the status bar. a. page number b. line c. column d. section *e. drop cap. 2. Convert to base 2 1... is not part of the status bar a. page number b. line c. column d. section *e. drop cap 2. Convert 10610 to base 2 a. 01010112 b. 1101012 c. 1010102 d. 011010102 *e. 010110102 3. Hierarchical model,

More information

S Y B Voc Software Development Syllabus

S Y B Voc Software Development Syllabus S Y B Voc Software Development Syllabus Course Level Job Roles Course Name: Pattern: Examination Pattern: Eligibility: Medium of Instruction: NSQF Level-VI 1. Jr. Software Developer 2. Trainer Software

More information

Rizvi College of Arts, Science & Commerce Bandra (W), Mumbai Teaching Plan Academic Year

Rizvi College of Arts, Science & Commerce Bandra (W), Mumbai Teaching Plan Academic Year Academic Year 17-18 Subject: Communication Skills Faculty: SHABANA ANSARI Class : F.Y.B.Sc. (IT) SEM-1 JUNE The Seven Cs of Effective Communication: Completeness, Conciseness, Consideration, Concreteness,

More information

Hours / 100 Marks Seat No.

Hours / 100 Marks Seat No. 17320 21718 3 Hours / 100 Seat No. Instructions (1) All Questions are Compulsory. (2) Answer each next main Question on a new page. (3) Figures to the right indicate full marks. (4) Assume suitable data,

More information

PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: Unit-1: Introduction

PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: Unit-1: Introduction PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: - Introduction to personal computer Concept of hardware & software, program, data processing, classification of PC software, Computer Applications. - Overview of

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY & COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CS6201- DIGITAL PRINCIPLE AND SYSTEM DESIGN

More information

DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER.

DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER. DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER 2015 2016 onwards DIGITAL ELECTRONICS CURRICULUM DEVELOPMENT CENTRE Curriculum Development

More information

COMPUTER SCIENCE SECTION A

COMPUTER SCIENCE SECTION A Total No. of Printed Pages 16 X/15/CSc 2 0 1 5 COMPUTER SCIENCE ( CANDIDATES WITH PRACTICAL/INTERNAL ASSESSMENT ) Full Marks : 80 Pass Marks : 24 ( CANDIDATES WITHOUT PRACTICAL/INTERNAL ASSESSMENT ) Full

More information

COMPUTER SCIENCE PAPER 1

COMPUTER SCIENCE PAPER 1 COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.)

More information

Computer Organization and Programming

Computer Organization and Programming Sep 2006 Prof. Antônio Augusto Fröhlich (http://www.lisha.ufsc.br) 8 Computer Organization and Programming Prof. Dr. Antônio Augusto Fröhlich guto@lisha.ufsc.br http://www.lisha.ufsc.br/~guto Sep 2006

More information

User. Application program. Interfaces. Operating system. Hardware

User. Application program. Interfaces. Operating system. Hardware Operating Systems Introduction to Operating Systems and Computer Hardware Introduction and Overview The operating system is a set of system software routines that interface between an application program

More information

2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]

2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7] Code No: A109211202 R09 Set No. 2 1. (a) Explain the purpose of the following registers: i. IR ii. PC iii. MDR iv. MAR. (b) Explain with an example the steps in subtraction of two n-digit unsigned numbers.

More information

Digital logic fundamentals. Question Bank. Unit I

Digital logic fundamentals. Question Bank. Unit I Digital logic fundamentals Question Bank Subject Name : Digital Logic Fundamentals Subject code: CA102T Staff Name: R.Roseline Unit I 1. What is Number system? 2. Define binary logic. 3. Show how negative

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam

More information

ST. MARY S COLLEGE FORM 4

ST. MARY S COLLEGE FORM 4 Term 1 Week 1 Week 2 FUNDAMENTALS OF HARDWARE AND SOFTWARE 1. The generalpurpose computer system 2. Functions of the major hardware components of a computer system 3. Functions and uses of primary storage

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3 UNIT - I PART A (2 Marks) 1. Using Demorgan s theorem convert the following Boolean expression to an equivalent expression that has only OR and complement operations. Show the function can be implemented

More information

2. MACHINE REPRESENTATION OF TYPICAL ARITHMETIC DATA FORMATS (NATURAL AND INTEGER NUMBERS).

2. MACHINE REPRESENTATION OF TYPICAL ARITHMETIC DATA FORMATS (NATURAL AND INTEGER NUMBERS). 2. MACHINE REPRESENTATION OF TYPICAL ARITHMETIC DATA FORMATS (NATURAL AND INTEGER NUMBERS). 2.. Natural Binary Code (NBC). The positional code with base 2 (B=2), introduced in Exercise, is used to encode

More information

CS201- Introduction to Programming Latest Solved Mcqs from Midterm Papers May 07,2011. MIDTERM EXAMINATION Spring 2010

CS201- Introduction to Programming Latest Solved Mcqs from Midterm Papers May 07,2011. MIDTERM EXAMINATION Spring 2010 CS201- Introduction to Programming Latest Solved Mcqs from Midterm Papers May 07,2011 Lectures 1-22 Moaaz Siddiq Asad Ali Latest Mcqs MIDTERM EXAMINATION Spring 2010 Question No: 1 ( Marks: 1 ) - Please

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Academic Year 2018 19 III SEMESTER CS8351-DIGITAL PRINCIPLES AND SYSTEM DESIGN Regulation

More information