BAHAUDDIN ZAKARIYA UNIVERSITY Department of Information Technology

Similar documents
M1-R4: Introduction to ICT Resource (JULY 2018)

BSNL TTA Question Paper-Computers Specialization 2007

Internetworking is connecting two or more computer networks with some sort of routing device to exchange traffic back and forth, and guide traffic on

The History and the layers of the OSI Model 30 - October

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

OSI ISO, OSI Reference Model

Prepared by Agha Mohammad Haidari Network Manager ICT Directorate Ministry of Communication & IT

Lecture (02) Network Protocols and Standards

Input output and memory devices

Introduction to Computer Science (I1100) Networks. Chapter 6

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

INFORMATION TECHNOLOGY

Question Bank. Fundamentals Of Computer FYBCA (SEM - I)

COA. Prepared By: Dhaval R. Patel Page 1. Q.1 Define MBR.

COMPUTER NETWORKING. By: Dr. Noor Dayana Abd Halim

POLYMORPHISM 2 PART Abstract Classes Static and Dynamic Casting Common Programming Errors

POLYMORPHISM 2 PART. Shared Interface. Discussions. Abstract Base Classes. Abstract Base Classes and Pure Virtual Methods EXAMPLE

Layer 2 functionality bridging and switching

CSCE 2014 Final Exam Spring Version A

Lesson 1: Network Communications

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Computer Network Architecture

1) What is information system? Describe the basic concepts of information systems.

machine cycle, the CPU: (a) Fetches an instruction, (b) Decodes the instruction, (c) Executes the instruction, and (d) Stores the result.

DC104 DATA STRUCTURE JUNE Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

KIBABII UNIVERSITY COLLEGE DEPARTMENT COMPUTER SCIENCE & IT ANSWER ALL QUESTIONS IN SECTION A AND ANY TWO QUESTIONS IN SECTION B

Last class: Today: Course administration OS definition, some history. Background on Computer Architecture

Objectives. Learn how computers are connected. Become familiar with different types of transmission media

Inheritance, and Polymorphism.

Introduction to Computer Networks INTRODUCTION TO COMPUTER NETWORKS

: COMPUTER HARDWARE AND NETWORKING COURSE CODE : 6043 COURSE CATEGORY PERIODS PER WEEK : 5 PERIODS PER SEMESTER : 75/6 CREDITS : 5 TIME SCHEDULE

MODULE: NETWORKS MODULE CODE: CAN1102C. Duration: 2 Hours 15 Mins. Instructions to Candidates:

Darshan Institute of Engineering & Technology for Diploma Studies

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

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

Angel International School - Manipay 2 nd Term Examination March, 2016 Computing

Chapter 2. Network Classifications (Cont.)

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

2. This Question Booklet contains nine questions. Answer any SIX questions.

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

Course Weekly Outline

Pointers. 1 Background. 1.1 Variables and Memory. 1.2 Motivating Pointers Massachusetts Institute of Technology

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

ES623 Networked Embedded Systems

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

Data Structure (CS301)

EE 610 Part 2: Encapsulation and network utilities

Chapter Seven. Local Area Networks: Part 1. Data Communications and Computer Networks: A Business User s Approach Seventh Edition

Switching to AQA from OCR

DEPARTMENT OF INFORMATION TECHNOLOGY KUMAUN UNIVERSITY, NAINITAL SEMESTER-I ( )

NAPIER UNIVERSITY SCHOOL OF COMPUTING

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

COMPUTER SCIENCE 2002 (Delhi Board)

COMPUTER SCIENCE (330) TUTOR MARKED ASSIGNMENT

Lecture Outline. Lecture 2. OSI model and networking. The OSI model and networking. The OSI model and networking. The OSI model and networking

Data Communication. Introduction of Communication. Data Communication. Elements of Data Communication (Communication Model)

Cpt S 122 Data Structures. Course Review Midterm Exam # 1


Network Models. Behrouz A. Forouzan Data communication and Networking Fourth edition

Data Communication and Network. Introducing Networks

Introducing Cisco Data Center Networking

OCR GCSE Computing Learning Grids H/W

INTRODUCTORY INFORMATION TECHNOLOGY COMMUNICATING OVER NETWORKS. Faramarz Hendessi


1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology

Code No: R Set No. 1

Introduction to Computer Science Midterm 3 Fall, Points

What Operating Systems Do An operating system is a program hardware that manages the computer provides a basis for application programs acts as an int

CS 311 Data Structures and Algorithms, Spring 2009 Midterm Exam Solutions. The Midterm Exam was given in class on Wednesday, March 18, 2009.

19 Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd

NETWORKING COMPONENTS

Course Snapshot. The Next Few Classes. Parallel versus Distributed Systems. Distributed Systems. We have covered all the fundamental OS components:

Question Bank BCA-T111: Computer Fundamentals 1. What is Computer? Why is it also known as a data processor? 2. What is data processing?

Network Devices,Frame Relay and X.25

Digital Communication Networks

Revised Syllabus and Course of Reading for Computer Studies (B.A/B.Sc. Examination)

KULLEĠĠ SAN BENEDITTU Secondary School, Kirkop

E-Commerce. Infrastructure I: Computer Networks

Switching to AQA from Edexcel

CHAPTER 6 Memory. CMPS375 Class Notes Page 1/ 16 by Kuo-pao Yang

Applied Information and Communication Technology Assessment Unit A2 13

LECTURE # 8. Bad Technology Flow control, error control, addressing is multiple Session and Presentation(EMPTY), Network and DL(Full)

DIPLOMA IN HARDWARE NETWORKING CURRICULUM FUNDAMENTALS OF COMPUTER APPLICATION. Generations of Computer. Block Diagram of a Computer.

CS 311 Data Structures and Algorithms, Fall 2009 Midterm Exam Solutions. The Midterm Exam was give in class on Wednesday, October 21, 2009.

A. Department Information: Business and Economics Management Information Systems Course ID: MIS 090

ITEC 3800 Data Communication and Network. Introducing Networks

7. System Design: Addressing Design Goals

Frames, Packets and Topologies

Chapter 4 NETWORK HARDWARE

St. Catherine s High School

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

8. Functions (II) Control Structures: Arguments passed by value and by reference int x=5, y=3, z; z = addition ( x, y );

Chapter Topics Part 1. Network Definitions. Behind the Scenes: Networking and Security

What is Polymorphism? Quotes from Deitel & Deitel s. Why polymorphism? How? How? Polymorphism Part 1

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

What is the Race Condition? And what is its solution? What is a critical section? And what is the critical section problem?

Memory memories memory

Homework #3 CS2255 Fall 2012

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

Transcription:

2017 Comprehensive Sample Paper Page 1 of 15 BAHAUDDIN ZAKARIYA UNIVERSITY Department of Information Technology Instructions Comprehensive Examination MIT (2014-2016) Date: This exam has 7 sections on 15 pages Please count the pages You have 2 hours to complete this exam Pass Marks: 50 1 Check that you have all 15 pages (including this cover page) 2 Write your name, student number on this page 3 Please turn off your mobile phone/pager Section Your points Max points Section Your points Max points I 15 V 15 II 15 VI 15 III 15 VII 10 IV 15 Subtotal Subtotal Your total points Student Roll# Student Name Signature External Examiner Name and Signature : ----------------------------------

2017 Comprehensive Sample Paper Page 2 of 15 Section-I Programming Fundamental Q1 Missing semicolon ; at the end of C++ statement is a Logical error b Syntax error c Runtime error d None of the given options Q2 What will be the output of the following code? int i=0, j = 0; for( i=0; j < 2; i+=2) for(j=0; j < 2; j +=2) cout << i= << i << j= << j << endl; a i=0 j =0 b i= 0 j= 2 c i=0 j=0 i=2 j=2 d i=0 j=2 i=2 j=2 Q3 What will be the correct syntax to assign an array named arr of 5 elements to a pointer ptr? a *ptr = arr ; b ptr = arr ; c *ptr = arr[5] ; d ptr = arr[5] ; Q4 In case of parameters passing by reference a The values of those variables are passed to the function so that it can manipulate them b The location of variable in memory is passed to the function so that it can use the same memory area for its processing c The function declaration should contain ampersand in its type declaration d All of above Q5 Which one of the followings is an example of a pure virtual function? a virtual void function1() = 0; b virtual int function1() { } c abstract void function1() = 0; d abstract int function1() { }

2017 Comprehensive Sample Paper Page 3 of 15 Section-II Data Structure & Algorithms 1 Convert infix expression into its equivalent postfix expression a ABD+*E/FGHK/+*- b ABD*+E/FGHK/*+- c ABD+*E/FGHK-+*/ d ABD+*E/FGHK/*-+ 2 Worst Case Complexity of a quick sort is: a O(n) b O(2n) 2 c O( n ) 3 d O( n ) e Non of these 3 In the linked list implementation of the queue class, where does the push member function place the new entry on the linked list? a At the head b At the tail c After all other entries those are greater than the new entry d After all other entries those are smaller than the new entry 4 Linked lists are best suited a for relatively permanent collections of data b for the size of the structure and the data in the structure are constantly changing c for both of above situation d for none of above situation 5 Binary search requires data to be in what order? a Increasing b Decreasing c Random d Sorted

2017 Comprehensive Sample Paper Page 4 of 15 Section-III Operating Systems 1- A process said to be in state if it was waiting for an event that will never occur a Safe b Unsafe c Starvation d Dead lock 2- A thread is a process a Heavy Weight b Mutliprocess c Inter Thread d Light weight 3- To remove an installed application you will use? a Add/ Remove programs b My documents c My Computer d Del 4- File format defines a Storage structure b Security scheme c Access authority d Data hiding 5- Process Control Block manages a Disks b Processors c I/O devices d Tasks

2017 Comprehensive Sample Paper Page 5 of 15 Section-IV Introduction to IT 1 The language that the computer can understand and execute is called a Machine language b Application software c System program d All of the above 2 Which of the following is used as a primary storage device? a Magnetic drum b PROM c Floppy disk d All of these 3 Which of the following memories needs refresh? a SRAM b DRAM c ROM d All of above 4 Which of the following devices can be used to directly input printed text? a OCR b OMR c MICR d All of above 5 The output quality of a printer is measured by a Dot per cm b Dots per inch c Dots printed per unit time d All of above

2017 Comprehensive Sample Paper Page 6 of 15 Section-V Database Systems 1) Which one is not advantage of TFP a) Economical b) Low cost c) Consistent d) Standardized e) All of above f) None of these 2) Which one is dominant advantage of Database a) Simple b) Redundancy c) Sharing d) Concurrency e) All of above f) None of these 3) Which one is not an advantage of Database a) Standards b) Controlled Redundancy c) Sharing d) Concurrency e) All of above f) None of these 4) Which one is not a disadvantage of Database a) Standards b) Controlled Redundancy c) Sharing d) Concurrency e) All of above f) None of these 5) It is true that database a) process some applications slow b) is always distributed c) provides integrity sometimes d) has no constraints on data

2017 Comprehensive Sample Paper Page 7 of 15 Section-VI Computer Communication & Networks 1 Which are the components of a data communication system? (Choose Three) A) Message B) Protocol C) Switch D) Router E) Transmission Medium 2 Which of the following OSI (Open Systems Interconnect) layers is responsible for formatting and code conversations? A) The Transport Layer B) The Data Link Layer C) The Application Layer D) The Presentation Layer 3 What is attenuation? A) Opposition to the flow of current B) Measurement of electrical signals relative to time C) Degradation of a signal as it travels along the medium D) Amount or volume of traffic that is flowing on the medium 4 Which of the following OSI layer offers reliable, connection-oriented data communication services? A) Application B) Presentation C) Session D) Transport E) Network 5 Which network topology uses a multi-point connection? A) Star topology B) Mesh topology C) Bus topology D) Ring topology

2017 Comprehensive Sample Paper Page 8 of 15 Section-VII Human Computer Interaction 1 The different contexts that change the interpretation of commands are called _ a modes b nodes c environment d links 2 The feeling of disorientation when you do not have sufficient means to know where you are and where you have been has been called a ambivalence b frustration c lost in hyperspace d none of these 3 Shrinking a window is called as a Iconifying b Compression c Expansion d Recrusion 4 A consequence of the direct manipulation paradigm is that there is no longer a clear distinction between a drapper s collection b upper & lower c domain d input & output 5 The phrase human error is taken to mean a operator error b user c design error d bad interfaces