D.JJtl : A4, 803. M~4;t. ~~~ ~,~ ~~~C¼**a~ ~)a~ M * ffl1l$*;=m-, J{-11*~1- ~ ft j * s. ~~ *$~~$* ~ ~ ~,a~maft *m $*;=t,

Similar documents
1. Which of the following circuits can be used to store one bit of data? A) Encoder B) OR gate C) Flip Flop D) Decoder

COLLEGEDUNIA MCA. 3. What would be displayed, if the following program is compiled and run?

( D ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Semaphore (C) Monitor (D) Shared memory

BSNL TTA Question Paper-Computers Specialization 2007

m ~~I Rt'6"'lcl ati1j4#11'" ~ silttli71 h1 ~

Advanced Diploma in Computer Science (907) Computer Systems Architecture

AQA GCSE Computer Science PLC

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

DATA STRUCTURES AND ALGORITHMS

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Programming and Data Structure Solved. MCQs- Part 2

First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions:

Time : 03 Hours Maximum Marks : 75

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION

Computer Architecture and Assembly Language. Spring

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.

Sample Examination. Family Name:... Other Names:... Signature:... Student Number:...

The control of I/O devices is a major concern for OS designers

Trees! Ellen Walker! CPSC 201 Data Structures! Hiram College!

Computer Science Engineering Sample Papers

This is CS50. Harvard University Fall Quiz 0 Answer Key

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

Final Exam. 11 May 2018, 120 minutes, 26 questions, 100 points

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

C Language Part 2 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard

Answers. 1. (A) Attempt any five : 20 Marks

Data Structure Advanced

Building Java Programs. Priority Queues, Huffman Encoding

Kampala August, Agner Fog

Syllabus for Computer Science General Part I

COMP1917 Computing 1 Written Exam Sample Questions

2009 Academic Challenge

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

Data Structures Question Bank Multiple Choice

CS 322 Operating Systems Practice Midterm Questions

Where does the insert method place the new entry in the array? Assume array indexing starts from 0(zero).

CHETTINAD COLLEGE OF ENGINEERING AND TECHNOLOGY COMPUTER ARCHITECURE- III YEAR EEE-6 TH SEMESTER 16 MARKS QUESTION BANK UNIT-1

Computer Networking: A Top Down Approach Featuring the. Computer Networks with Internet Technology, William

UNIVERSITY OF WINDSOR Fall 2007 QUIZ # 2 Solution. Examiner : Ritu Chaturvedi Dated :November 27th, Student Name: Student Number:

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE

Representing and Manipulating Integers Part I

Byte Ordering. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

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

Operating Systems Comprehensive Exam. Spring Student ID # 3/20/2013

A. Year / Module Semester Subject Topic 2016 / V 2 PCD Pointers, Preprocessors, DS

12 Abstract Data Types

Information Science 2

2003 Academic Challenge

University of Baghdad College of Science Department of Computer Science األسم الكامل: High Diploma Qualification Exam Date: 13 Aug Time: 3 hrs.

1. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d.

Computer Organization

COMPUTING SUBJECT KNOWLEDGE AUDIT

Part I: Hardware and communication

ET156 Introduction to C Programming

COS 126 General Computer Science Fall Midterm 1

UNIT:4 MEMORY ORGANIZATION

Draw a diagram of an empty circular queue and describe it to the reader.

Department of Computer Science Admission Test for PhD Program. Part I Time : 30 min Max Marks: 15

Byte Ordering. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University

Operating Systems (Classroom Practice Booklet Solutions)

Computer Science /21/2000

Quiz 0 Review Session. October 13th, 2014

lesson 3 Transforming Data into Information

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

IN COLLABORATION WITH IVTB. Diploma in Information Technology

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

PART A (22 Marks) 2. a) Briefly write about r's complement and (r-1)'s complement. [8] b) Explain any two ways of adding decimal numbers.

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I

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

Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering)

Final Exam. 12 December 2018, 120 minutes, 26 questions, 100 points

Chapter 1. Data Storage Pearson Addison-Wesley. All rights reserved

MC7204 OPERATING SYSTEMS

1. Which of the following Boolean operations produces the output 1 for the fewest number of input patterns?

TCP/IP Protocol Suite and IP Addressing

File Management. Chapter 12

GATE SOLVED PAPER - CS

Linux Operating System

Pharmacy college.. Assist.Prof. Dr. Abdullah A. Abdullah

MICROPROCESSOR MCQs. 1) What does the microprocessor comprise of? a. Register section b. One or more ALU c. Control unit d.

Computer Science E-22 Practice Final Exam

( B ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Shared memory (C) Semaphore (D) Monitor

Computer Systems. Communication (networks, radio links) Meatware (people, users don t forget them)

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

2 nd Half. Memory management Disk management Network and Security Virtual machine

3137 Data Structures and Algorithms in C++

Silver Oak Engineering College and technology Information Technology Department

& ( D. " mnp ' ( ) n 3. n 2. ( ) C. " n

Module 12: I/O Systems

CS8391-DATA STRUCTURES QUESTION BANK UNIT I

Switching to AQA from OCR

MIDTERM EXAMINATION Spring 2010 CS301- Data Structures

Introduction to Computer Science Midterm 3 Fall, Points

Initial Bootloader. On power-up, when a computer is turned on, the following operations are performed:

Transcription:

.. D.JJtl : A4, 803 I. ~$t~ ~~4fy~~~'**+ ~AftA~,~~*** M~4;t 0 2. -~~$*~(T)LZ~~~~,~~# ~~L~ 0 3. *~##J1:.1~Jfl it.. ~ 0 4. Qi?f41f--(f.$*+ L1Ji=$ 0 s. ~~~~~~~~~~,~~-~~~,$~ 1t~~~~&M~ :Jt.~x.~~.n-it 0 6. $*~]fl it~1f* JtJ'if;hu 0 1. $*~~m ~~~M,~~-~~ ~;$*+~mm ~~~ ~,~ ~~~C¼**a~ ~)a~ M * ffl1l$*;=m-, J{-11*~1- ~ ft j * 0 s. ~~ *$~~$* ~ ~ ~,a~maft *m $*;=t, tit~~~ -tit, O

~~m C ~ffl.:::.?t ~ffl1'1iu1 ) 1. Which of the following is the binary representation of the decimal number (78.5625)? (A) 1001110.1001 (B) 1001110.11 (C) 1001100.1001 (D) 1001110.101. 2. Each of decimal value X=170 and Y~80 are stored in 8bit allocation. The res.ult of operation XEBY should be? (A) 00001010 (B) 11110000 (C) 10100000 (D) 00001111 None of the above.. 3. Which of the following is the number representation of IEEE-754 singleprecision floating-point format (C189000016) (A) (-117.5) (B) (-117.125) (C) {117.125) (D) (-17.125) 4. Which of following is incorrect of the vector graphic method image? (A) The type of image that can be easily rescaled (B) The type of image that's file size smaller than bitmap image. (C) The type of image that can represent the details in a photo. (D) The type of image that consists of geometric shapes. 5. We use 8K times per second sampling audio signal. 128 different levels present each sample. How many bytes are needed to store 2 minutes audio voice. (A) 240KB (B) 60KB (C) 120KB (D) 300KB

6. Which of the following creates an overflow if both of the numbers and the result are in 8-bit two's complement representation? (A) (-37) - 99 (B) 37 + 99 (C) 37-99 (D) (-37) + 99 7. If the computer has 32 data registers (RO to R31), 2000 words in mem~ry: and 16 different instructions. What is the minimum size of an add instruction in bits if a typical instruction use the following format: add RO R2 (A) 14 (B) 13 (C) 28 (D) 29 8. Which of the following is the first stage of the modern operation system be loaded into the memory and run it? (A) Bootstrap program in ROM. (B Bootstrap program in H.D. (C) Boot manager in H.D. (D) Boot manager in floppy disk. 9. Which of the following condition is not correct regarding deadlock or necessary conditions for deadlock? (A) Mutual exclusion. (B) A process may hold allocated resources even though it cannot use it until other resources are available. (C) No resource can be forcibly removed from a process holding it by operation system. (D) Operation must abort all deadlocked processes to avoid deadlock. 10. Which of the following is correct if the memory allocated to a process is a little larger than the process?

(A) Internal fragmentation occurs (B) External fragmentation occurs (C) Both internal and external fragmentation occur (D) Neither internal nor external fragmentation occurs 11. Which of the following is true of memory-mapped 1/0? (A) The devices have a separate address space with memory. (B) The advantage is the devices have to deal with larger address line~ (C) The device has to repeatedly check the status flags (D) The devices and the memory using the same address space. 12. Which of the following compression algorithm, when the symbols occurring more frequently assign shorter codes and those that occurring less frequently assign longer codes? (A) Run-length coding (B) Dictionary coding (C) Arithmetic coding (D) Huffman coding Predictive coding 13. A binary tree has eight nodes. The postorder traversal is FECHGDBA and inorder is EFCABHDG. Which of following is the preorder of the tree? ' (A) BHDGAEFC (B) BHDGAFEC (C) AEFBCDGH (D) EFCADHGB ACEFBDHG 14. Which ofthe following is incorrect of software testing phase? (A) The black-box testing depends only on the external system interface to confirm its correctness. (B) The basis path testing is glass-box testing. (C) The control structure testing is glass-box testing. (D) Boundary-value testing is glass-box testing.

15. Which of the following is the ciphertext of p = 11 and q = 5 and choose e=7. Apply RSA algorithm where plaintext message=12? (A) 23 (B) 12 (C) 64 (D) 11 16. Which of the following is result of running the C programing language 'beiow?.. { #define Ml(a,b) a* (b) #define M2(a,b) (a)+ b #include <stdio.h> void main(void) int nl., n2; nl = 2; n2 = 3; nl = Ml(nl - n2, n2 - nl) * M2(nl + n2, 2 ~ printf("%d\n", nl); n2); (A) (-11) (B) (-7) (C) (-2) (D) 2 17. Which of the following is result of running the C programing language below?

A4 803 void fun1(char *a) { int i, j; char c; for (i = 1, j = strlen(a) C = a[i]; a[i.] = a[j]; a[j] = c; int main(void) { char s10 = "ABCDE"; fun1(s1); pri.ntf("%s",s1); return 0; - 1; i < j; i=i.+1, j=j-1) { (A) (B) (C) (D) ABCDE EDCBA AEDCB DECBA None of the above. 18. Consider the following C programing language? int Fune (int n) { if {n ;: 2) return 1; else return n + Fune {n - 2); What is the result after call Func(lO) (A) 16 (B) 19 (C) 29 (D) 39 None of the above. 19. Which is the concept using by virtual memory when a process is copied into main memory from the secondary memory according to the requirement.? (A) Demand paging (B) Scheduling (C) Segmentation

., A4 803 (D) Virtualization None of the above. 20. In computer system hardware, which of following item is the fastest and most expensive form of storage and comparatively small? (A) Tape Storage (B) Cache (C) Optical Storage (D) Flash memory ~mm c ~ffl[q5t, ~ffla@m:ijhiut o.8 5t) 21. Which of the statement(s) are correct in TCP protocol? (A)TCP is Connection-oriented (B)TCP is process-to-process (C)ln TCP, sending and receiving data is done as sequence of characters (D)TCP is network layer protocol TCP groups a number of bytes together into a packet called segment 22. Which of the statement(s) are correct in RISC architecture? (A) The advance is power efficient than CISC. (B) The Personal Computer is designed following this architecture. (C) The architecture is aimed at increasing the time of execution of instructions. (D) The processor has a more complicated design than CISC,i The architecture was the first to implement pipe-lining. 23. Which of the statement(s) are correct in Computer Networks? (A) The length of an 1Pv6 address is 128 bits. (B) 1Pv6 does not use Broadcast type of address (C) Telnet can be used for file transfer, too. (D) Two colons (::) are used to denote continuous hexadecimal fields of zeros. Transferring a file by FTP uses UCP connections. 24. Which of the statement(s) are correct in complexity of algorithm O(n 2 )? (A) merge sort (B) linear search (C) binary search (D) bubble sort

- selection sort 25. Which of the following a Turing machine consists of? (A) (B) (C) Keyboard Head (read/write) Controller (D) Calculator Tape. 26. What is the length of the character after encoding by Huffman coding with the given frequencies? A(20, 8(8), C(9), D(2), E(14 (A) (B) (C) (D) A: lbits B: 3bits C: 2bits D: 4bits E: 2bit 27. Choose the following items that are correct regarding ADT (Abstract Data Type)? (A) Array contains elements of different type. (B) Binary search cannot be implemented using linked lists. (C) Stack underflow is removing items from an empty stack. (D) The suitable structure for Breadth-First Traversal on a graph is the tree. A queue is a FIFO (First In First Out) list. 28. Consider the following C programing language? int a,b; int *x,*y; a= 1; b = 2; X = &a; y = &b; X = y; *x = 3; *y == 4; printf ("%d %d %d cvd" a b *x *y) 10 I I J J J What is the value after running? (A) a= 1 (B) b = 4 (C) X = 3

(D) y = 3 {E) y = 4 29. Which of following item(s) is correct about Computer Networks? (A) SMTP uses the TCP port 25. (B) (C) An email client has to know the MAC address of its initial SMTP server. SMTP defines message encryption. (D) SMTPS is based on the SMTP connections secured by SSL. Simple mau transfer protocol (SMTP) uses TCP as the transport layer ' protocol for electronic mail transfer. 30. Which of following item(s) is incorrect about CPU Processing? (A) The processes that are stored in main memory and are ready and waiting to execute ~ill be keep on a list called ready queue. (B) In priority scheduling algorithm the process with highest priority allocate CPU. (C) A process can move to a different classified ready queue in multilevel feedback scheduling algorithm. (D) User level thread can be scheduled by the kernel. The interval time from a process submit and complete time is called turnaround time.