Saturday 16 September 2017
Thursday 14 September 2017
HSST CS QP 144/2013 - Part 5
Question41:-In the spiral model 'risk analysis' is performed
A:-in every loop
B:-in the first and second loop
C:-before using spiral model
D:-in the first loop
Correct Answer:- Option-A
Question42:-The technique of improving the priority of process waiting in queue for CPU allocation is called _________________
A:-Starvation
B:-Ageing
C:-Revocation
D:-Relocation
Correct Answer:- Option-B
Question43:-PSW is saved in stack when there is a
A:-interrupt recognized
B:-execution of CALL instruction
C:-execution of RST instruction
D:-all of these
Correct Answer:- Option-A
Question44:-The default subnet mask for a Class C network is
A:-127.0.0.1
B:-255.0.0.0
C:-255.255.0.0
D:-255.255.255.0
Correct Answer:- Option-D
Question45:-Which one of the following is NOT an advantage of Distributed System?
A:-Reliability
B:-Incremental growth
C:-Resource sharing
D:-None of the above
Correct Answer:- Option-A
Question46:-Cache memory is based
A:-on the property of locality of reference
B:-on the fact that references generally tend to cluster
C:-on the heuristic 90-10 rule
D:-all of the above
Correct Answer:- Option-A
Question47:-The language component of DBMS which can be embedded in a program is
A:-the database administrator (DBA)
B:-the data manipulation language (DML)
C:-the data definition language (DDL)
D:-a query language
Correct Answer:- Option-B
Question48:-A computer system that permits multiple users to run programs at same time is _______
A:-Real time system
B:-Time sharing system
C:-Multiprogramming system
D:-Multi tasking system
Correct Answer:- Option-D
Question49:-What is the ouput of the following code segment?
void test()
{
char c;
cin.get(c);
if (c!='\n'){
test();
cout.put(c);
}}
A:-It will print an empty line
B:-The string entered is printed as it is
C:-It will go into an infinite loop
D:-The string entered is printed in reverse order
Correct Answer:- Option-D
Question50:-Which of the following statement is the negation of the statement, "10 is even and -5 is negative"
A:-10 is even and -5 is not negative
B:-10 is odd and -5 is not negative
C:-10 is even or -5 is not negative
D:-10 is odd or -5 is not negative
Correct Answer:- Option-D
A:-in every loop
B:-in the first and second loop
C:-before using spiral model
D:-in the first loop
Correct Answer:- Option-A
Question42:-The technique of improving the priority of process waiting in queue for CPU allocation is called _________________
A:-Starvation
B:-Ageing
C:-Revocation
D:-Relocation
Correct Answer:- Option-B
Question43:-PSW is saved in stack when there is a
A:-interrupt recognized
B:-execution of CALL instruction
C:-execution of RST instruction
D:-all of these
Correct Answer:- Option-A
Question44:-The default subnet mask for a Class C network is
A:-127.0.0.1
B:-255.0.0.0
C:-255.255.0.0
D:-255.255.255.0
Correct Answer:- Option-D
Question45:-Which one of the following is NOT an advantage of Distributed System?
A:-Reliability
B:-Incremental growth
C:-Resource sharing
D:-None of the above
Correct Answer:- Option-A
Question46:-Cache memory is based
A:-on the property of locality of reference
B:-on the fact that references generally tend to cluster
C:-on the heuristic 90-10 rule
D:-all of the above
Correct Answer:- Option-A
Question47:-The language component of DBMS which can be embedded in a program is
A:-the database administrator (DBA)
B:-the data manipulation language (DML)
C:-the data definition language (DDL)
D:-a query language
Correct Answer:- Option-B
Question48:-A computer system that permits multiple users to run programs at same time is _______
A:-Real time system
B:-Time sharing system
C:-Multiprogramming system
D:-Multi tasking system
Correct Answer:- Option-D
Question49:-What is the ouput of the following code segment?
void test()
{
char c;
cin.get(c);
if (c!='\n'){
test();
cout.put(c);
}}
A:-It will print an empty line
B:-The string entered is printed as it is
C:-It will go into an infinite loop
D:-The string entered is printed in reverse order
Correct Answer:- Option-D
Question50:-Which of the following statement is the negation of the statement, "10 is even and -5 is negative"
A:-10 is even and -5 is not negative
B:-10 is odd and -5 is not negative
C:-10 is even or -5 is not negative
D:-10 is odd or -5 is not negative
Correct Answer:- Option-D
HSST CS QP 144/2013 - Part 4
Question31:-DNS is a
A:-Distributed hierarchical naming system
B:-Vertical naming system
C:-Horizontal naming system
D:-Client Server system
Correct Answer:- Option-C
Question32:-E-commerce is not suitable for
A:-Online job searching
B:-Sale/Purchase of expensive jewellery and antiques
C:-Sale/Purchase of branded clothes
D:-Sale/Purchase of mobile phones
Correct Answer:- Option-A
Question33:-Several factors exist that affect the efficiency of lookup operations in a hash table. Which among the following is NOT one of those factors ?
A:-Size of elements stored in the hash table.
B:-Number of elements stored in the hash table.
C:-Quality of the hash function.
D:-Number of buckets in the hash table.
Correct Answer:- Option-A
Question34:-A DBMS query language is designed to
A:-specify the structure of a database
B:-support end users with English-like commands
C:-support the development of complex applications software
D:-all of the above
Correct Answer:- Option-D
Question35:-Let r be a resource. There are 3 user processes each requiring 2 units of R. Then the minimum number of units of R such that no deadlocks will occur is
A:-4
B:-3
C:-5
D:-6
Correct Answer:- Option-A
Question36:-Assume a cache memory with associative mapping. If the main memory is of 8K bytes and the cache memory is of 2K words, then each word of cache memory is
A:-21 bits
B:-11 bits
C:-16 bits
D:-20 bits
Correct Answer:- Option-C
Question37:-Which of the following is true ?
A:-Stream cipher technique is an encryption technique
B:-Block cipher technique is an encryption technique
C:-Both (A) and (B)
D:-Neither of (A) and (B)
Correct Answer:- Option-C
Question38:-Given a linked list with n elements. Then the time taken to insert an element after an element pointed to by some pointer is
A:-O(n log2 n)
B:-O(1)
C:-O(log2 n)
D:-O(n)
Correct Answer:- Option-B
Question39:-Let h be a hashing function and is used to hash n keys into a table of size m (given n<=m). Then the expected number of collisions involving a particular key x is
A:-less than 1
B:-less than m
C:-less than n
D:-less than n/2
Correct Answer:- Option-A
Question40:-If L is a lattice, then for every a and b in L which among the following is correct?
A:-a ν (b Λ c) =a
B:-a ν (b ν c) = (a ν b) ν c
C:-a ν b = a Λ b
D:-a ν (b ν c) = b
Correct Answer:- Option-B
A:-Distributed hierarchical naming system
B:-Vertical naming system
C:-Horizontal naming system
D:-Client Server system
Correct Answer:- Option-C
Question32:-E-commerce is not suitable for
A:-Online job searching
B:-Sale/Purchase of expensive jewellery and antiques
C:-Sale/Purchase of branded clothes
D:-Sale/Purchase of mobile phones
Correct Answer:- Option-A
Question33:-Several factors exist that affect the efficiency of lookup operations in a hash table. Which among the following is NOT one of those factors ?
A:-Size of elements stored in the hash table.
B:-Number of elements stored in the hash table.
C:-Quality of the hash function.
D:-Number of buckets in the hash table.
Correct Answer:- Option-A
Question34:-A DBMS query language is designed to
A:-specify the structure of a database
B:-support end users with English-like commands
C:-support the development of complex applications software
D:-all of the above
Correct Answer:- Option-D
Question35:-Let r be a resource. There are 3 user processes each requiring 2 units of R. Then the minimum number of units of R such that no deadlocks will occur is
A:-4
B:-3
C:-5
D:-6
Correct Answer:- Option-A
Question36:-Assume a cache memory with associative mapping. If the main memory is of 8K bytes and the cache memory is of 2K words, then each word of cache memory is
A:-21 bits
B:-11 bits
C:-16 bits
D:-20 bits
Correct Answer:- Option-C
Question37:-Which of the following is true ?
A:-Stream cipher technique is an encryption technique
B:-Block cipher technique is an encryption technique
C:-Both (A) and (B)
D:-Neither of (A) and (B)
Correct Answer:- Option-C
Question38:-Given a linked list with n elements. Then the time taken to insert an element after an element pointed to by some pointer is
A:-O(n log2 n)
B:-O(1)
C:-O(log2 n)
D:-O(n)
Correct Answer:- Option-B
Question39:-Let h be a hashing function and is used to hash n keys into a table of size m (given n<=m). Then the expected number of collisions involving a particular key x is
A:-less than 1
B:-less than m
C:-less than n
D:-less than n/2
Correct Answer:- Option-A
Question40:-If L is a lattice, then for every a and b in L which among the following is correct?
A:-a ν (b Λ c) =a
B:-a ν (b ν c) = (a ν b) ν c
C:-a ν b = a Λ b
D:-a ν (b ν c) = b
Correct Answer:- Option-B
HSST CS QP 144/2013 - Part 3
Question21:-The expansion of nested macro calls follows _________ rule
A:-LILO
B:-LIFO
C:-FIFO
D:-priority
Correct Answer:- Option-B
Question22:-Von Neumann architecture is
A:-SISD
B:-SIMD
C:-MIMD
D:-MISD
Correct Answer:- Option-A
Question23:-The device that is used to forward data packets from one network to another is called a _________
A:-Bridge
B:-Hub
C:-Switch
D:-Gateway
Correct Answer:- Option-C
Question24:-Which among the following is the most general phrase structured grammar ?
A:-Context - Sensitive
B:-Context - Free
C:-Regular
D:-None of the above
Correct Answer:- Option-A
Question25:-When the following instructions have been executed, what will be the contents of register AL ?
MOV BL, 8C
MOV AL, 7E
ADD AL, BL
A:-0A and carry flag is reset
B:-0A and carry flag is set
C:-6A and carry flag is reset
D:-6A and carry flag is set
Correct Answer:- Option-B
Question26:-The first modern computer was called __________
A:-UNIVAC-I
B:-FLOW-MATIC
C:-ENIAC
D:-INTEL
Correct Answer:- Option-C
Question27:-In which of the language paradigms is the addition of two values expressed as (+ 10 20)?
A:-procedural
B:-functional
C:-logic
D:-object-oriented
Correct Answer:- Option-C
Question28:-What is the purpose of this bit of code
void init()
{
...
}
A:-A place to declare variables
B:-A required method in an applet
C:-A class that initializes the applet
D:-Interacting with the user
Correct Answer:- Option-B
Question29:-In Relational Algebra the query that finds customers who have a balance of over 800 is
A:-∏customer_name(σ balance >800(Deposit))
B:-σcustomer_name(∏balance>800(Deposit))
C:-∏customer_name(σbalance>800(Borrow))
D:-σcustomer_name(∏balance>500(Borrow))
Correct Answer:- Option-A
Question30:-Secret-key encryption is also known as
A:-Secret-encryption
B:-Asymmetric encryption
C:-Symmetric encryption
D:-Private encryption
Correct Answer:- Option-D
A:-LILO
B:-LIFO
C:-FIFO
D:-priority
Correct Answer:- Option-B
Question22:-Von Neumann architecture is
A:-SISD
B:-SIMD
C:-MIMD
D:-MISD
Correct Answer:- Option-A
Question23:-The device that is used to forward data packets from one network to another is called a _________
A:-Bridge
B:-Hub
C:-Switch
D:-Gateway
Correct Answer:- Option-C
Question24:-Which among the following is the most general phrase structured grammar ?
A:-Context - Sensitive
B:-Context - Free
C:-Regular
D:-None of the above
Correct Answer:- Option-A
Question25:-When the following instructions have been executed, what will be the contents of register AL ?
MOV BL, 8C
MOV AL, 7E
ADD AL, BL
A:-0A and carry flag is reset
B:-0A and carry flag is set
C:-6A and carry flag is reset
D:-6A and carry flag is set
Correct Answer:- Option-B
Question26:-The first modern computer was called __________
A:-UNIVAC-I
B:-FLOW-MATIC
C:-ENIAC
D:-INTEL
Correct Answer:- Option-C
Question27:-In which of the language paradigms is the addition of two values expressed as (+ 10 20)?
A:-procedural
B:-functional
C:-logic
D:-object-oriented
Correct Answer:- Option-C
Question28:-What is the purpose of this bit of code
void init()
{
...
}
A:-A place to declare variables
B:-A required method in an applet
C:-A class that initializes the applet
D:-Interacting with the user
Correct Answer:- Option-B
Question29:-In Relational Algebra the query that finds customers who have a balance of over 800 is
A:-∏customer_name(σ balance >800(Deposit))
B:-σcustomer_name(∏balance>800(Deposit))
C:-∏customer_name(σbalance>800(Borrow))
D:-σcustomer_name(∏balance>500(Borrow))
Correct Answer:- Option-A
Question30:-Secret-key encryption is also known as
A:-Secret-encryption
B:-Asymmetric encryption
C:-Symmetric encryption
D:-Private encryption
Correct Answer:- Option-D
HSST CS QP 144/2013 - Part 2
Question11:-DML is used for
A:-Addition of new structures in the database system
B:-Manipulation and processing of database
C:-Definition of physical structure of database system
D:-Description of logical structure of database
Correct Answer:- Option-B
Question12:-Suppose that N = {1, 2, 3, ...} be ordered by divisibility, which one of the following subset is totally ordered?
A:-(2, 6, 24)
B:-(4, 15, 30)
C:-(3,5,15)
D:-(2,9,16)
Correct Answer:- Option-A
Question13:-Which among the following searching technique takes O(1) time to locate a data ?
A:-Binary Search
B:-Tree Search
C:-Hashing
D:-Linear Search
Correct Answer:- Option-C
Question14:-The cause for poor response time is
A:-High I/O rates
B:-High paging rates
C:-Process busy
D:-Any of the above
Correct Answer:- Option-D
Question15:-Which among the following statements is false ?
A:-The data dictionary contains the name and description of each data element
B:-Data elements in the database can be modified by changing the data dictionary
C:-The data dictionary is a tool used exclusively by the database administrator
D:-Database administrator normally maintains the data dictionary
Correct Answer:- Option-B
Question16:-The infix expression for the postfix expression x 12 + z 17 y + 42 * / + is :-
A:-x + 12 + z / 17 + y * 42
B:-x + 12 + z / (17 + y)*42
C:-(x + 12 + z)/(17 + y * 42)
D:-x + 12 + z / ((17 + y) * 42)
Correct Answer:- Option-D
Question17:-The basic types of programmable arrays are made of ________________
A:-AND gates
B:-AND gates and OR gates
C:-OR gates
D:-NAND and NOR gates
Correct Answer:- Option-B
Question18:-A COCOMO model is
A:-Complete Cost Estimation Model
B:-Constructive Cost Estimation Model
C:-Common Cost Estimation Model
D:-Comprehensive Cost Estimation Model
Correct Answer:- Option-B
Question19:-The interval between the time of submission and completion of a job is called as ___________
A:-Turnaround time
B:-Waiting time
C:-Response time
D:-Throughput
Correct Answer:- Option-A
Question20:-An assembler is
A:-data dependent
B:-programming language dependent
C:-machine dependent
D:-syntax dependent
Correct Answer:- Option-C
A:-Addition of new structures in the database system
B:-Manipulation and processing of database
C:-Definition of physical structure of database system
D:-Description of logical structure of database
Correct Answer:- Option-B
Question12:-Suppose that N = {1, 2, 3, ...} be ordered by divisibility, which one of the following subset is totally ordered?
A:-(2, 6, 24)
B:-(4, 15, 30)
C:-(3,5,15)
D:-(2,9,16)
Correct Answer:- Option-A
Question13:-Which among the following searching technique takes O(1) time to locate a data ?
A:-Binary Search
B:-Tree Search
C:-Hashing
D:-Linear Search
Correct Answer:- Option-C
Question14:-The cause for poor response time is
A:-High I/O rates
B:-High paging rates
C:-Process busy
D:-Any of the above
Correct Answer:- Option-D
Question15:-Which among the following statements is false ?
A:-The data dictionary contains the name and description of each data element
B:-Data elements in the database can be modified by changing the data dictionary
C:-The data dictionary is a tool used exclusively by the database administrator
D:-Database administrator normally maintains the data dictionary
Correct Answer:- Option-B
Question16:-The infix expression for the postfix expression x 12 + z 17 y + 42 * / + is :-
A:-x + 12 + z / 17 + y * 42
B:-x + 12 + z / (17 + y)*42
C:-(x + 12 + z)/(17 + y * 42)
D:-x + 12 + z / ((17 + y) * 42)
Correct Answer:- Option-D
Question17:-The basic types of programmable arrays are made of ________________
A:-AND gates
B:-AND gates and OR gates
C:-OR gates
D:-NAND and NOR gates
Correct Answer:- Option-B
Question18:-A COCOMO model is
A:-Complete Cost Estimation Model
B:-Constructive Cost Estimation Model
C:-Common Cost Estimation Model
D:-Comprehensive Cost Estimation Model
Correct Answer:- Option-B
Question19:-The interval between the time of submission and completion of a job is called as ___________
A:-Turnaround time
B:-Waiting time
C:-Response time
D:-Throughput
Correct Answer:- Option-A
Question20:-An assembler is
A:-data dependent
B:-programming language dependent
C:-machine dependent
D:-syntax dependent
Correct Answer:- Option-C
HSST CS QP 144/2013 - Part 1
Question1:-In a BST, the traversal type which would print the values in the nodes in sorted order is :-
A:-Preorder
B:-Inorder
C:-Postorder
D:-None of the above
Correct Answer:- Option-B
Question2:-The contrapositive of the statement, "You win the game if you know the rules but are not overconfident" is :
A:-If you lose the game then you don't know the rules or you are overconfident.
B:-If you know the rules and are overconfident then you win the game.
C:-A necessary condition that you know the rules or you are not overconfident is that you win the game.
D:-If you don’t know the rules or are overconfident you lose the game.
Correct Answer:- Option-A
Question3:-If L1 be the class of languages accepted by finite state machines and L2 be the class of languages represented by regular expressions then,
A:-L1 ∩ L2 = Φ
B:-L2 ⊆ L1
C:-L1 ⊂ L2
D:-L1 = L2
Correct Answer:- Option-D
Question4:-In which one of the following models can requirements be redefined
A:-Spiral Model
B:-Prototyping Model
C:-Waterfall Model
D:-Evolutionary Model
Correct Answer:- Option-B
Question5:-The method adopted by the memory management module of an OS of a computer to periodically collect all the free memory space to form contiguous block of free space is called
A:-Dynamic Memory Allocation
B:-Garbage Collection
C:-Concatenation
D:-Collision
Correct Answer:- Option-B
Question6:-Among the following statements about binary trees which one is NOT true ?
A:-Every non-empty tree has exactly one root node.
B:-Every non-root node has exactly one parent.
C:-Every binary tree has at least one node.
D:-Every node has at most two children.
Correct Answer:- Option-C
Question7:-DRAM is used as main memory in a computer system because it
A:-needs refreshing circuitary
B:-consumes less power
C:-has higher speed
D:-has lower cell density
Correct Answer:- Option-C
Question8:-8251 is a
A:-UART
B:-USART
C:-Programmable interval timer/counter
D:-Programmable Interrupt Controller
Correct Answer:- Option-B
Question9:-A public key encryption system
A:-Allows only the correct receiver to decode the data
B:-Does not encode the data before transmitting it
C:-Allows only the correct sender to decode the data
D:-Allows only one to decode the transmission
Correct Answer:- Option-A
Question10:-Environment variables can be accessed by
A:-System programs
B:-C programs
C:-Shell scripts
D:-All of these
Correct Answer:- Option-D
A:-Preorder
B:-Inorder
C:-Postorder
D:-None of the above
Correct Answer:- Option-B
Question2:-The contrapositive of the statement, "You win the game if you know the rules but are not overconfident" is :
A:-If you lose the game then you don't know the rules or you are overconfident.
B:-If you know the rules and are overconfident then you win the game.
C:-A necessary condition that you know the rules or you are not overconfident is that you win the game.
D:-If you don’t know the rules or are overconfident you lose the game.
Correct Answer:- Option-A
Question3:-If L1 be the class of languages accepted by finite state machines and L2 be the class of languages represented by regular expressions then,
A:-L1 ∩ L2 = Φ
B:-L2 ⊆ L1
C:-L1 ⊂ L2
D:-L1 = L2
Correct Answer:- Option-D
Question4:-In which one of the following models can requirements be redefined
A:-Spiral Model
B:-Prototyping Model
C:-Waterfall Model
D:-Evolutionary Model
Correct Answer:- Option-B
Question5:-The method adopted by the memory management module of an OS of a computer to periodically collect all the free memory space to form contiguous block of free space is called
A:-Dynamic Memory Allocation
B:-Garbage Collection
C:-Concatenation
D:-Collision
Correct Answer:- Option-B
Question6:-Among the following statements about binary trees which one is NOT true ?
A:-Every non-empty tree has exactly one root node.
B:-Every non-root node has exactly one parent.
C:-Every binary tree has at least one node.
D:-Every node has at most two children.
Correct Answer:- Option-C
Question7:-DRAM is used as main memory in a computer system because it
A:-needs refreshing circuitary
B:-consumes less power
C:-has higher speed
D:-has lower cell density
Correct Answer:- Option-C
Question8:-8251 is a
A:-UART
B:-USART
C:-Programmable interval timer/counter
D:-Programmable Interrupt Controller
Correct Answer:- Option-B
Question9:-A public key encryption system
A:-Allows only the correct receiver to decode the data
B:-Does not encode the data before transmitting it
C:-Allows only the correct sender to decode the data
D:-Allows only one to decode the transmission
Correct Answer:- Option-A
Question10:-Environment variables can be accessed by
A:-System programs
B:-C programs
C:-Shell scripts
D:-All of these
Correct Answer:- Option-D
Wednesday 13 September 2017
Computer Networks Questions
1. Ping is a command used for
a) Checking MAC address
b) Checking Networking functionality and validity of IP address
c) Checking cabling performance
d) Checking cable connectivity only
2. DSL is an example of a____________ connection.
A. network
B. wireless
C. slow
D. broadband
3. Internet is
A. a local computer network
B. a world wide network of computers
C. an interconnected network of computers
D. a world wide interconnected network of computers which use a common
protocol to communicate with one another.
4. By an intranet we mean
A. a LAN of an organization
B. a Wide Area Network connecting all branches of an organization
C. a corporate computer network
D. a network connecting all computers of an organization and using the internet
protocol
5. Which layer is closer to the user?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
6. What is the port number of DNS?
(A) 21
(B) 23
(C) 43
(D) 53
7. You have one IP: 192.168.10.29. In which layer this IP works?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
8. What is the port number of Telnet ?
(A) 21
(B) 23
(C) 43
(D) 53
9. Flow control in TCP/IP is handled using:
(A) Urgent pointer
(B) Acknowledgement number
(C) Checksum
(D) Variable-size sliding window
10. Which among the following is a protocol 'of Wireless LAN?
(A) 802.2
(B)802.3
(C) 802.5
(D) 802.11
11. Which is the protocol among the following that is used for translating from physical address
to Internet address?
(A) ICMP
(B) ARP
(C) IGRP
(D)RARP
12. Which property among the ones given below is not possessed by the HTTP protocol?
(A) Non-cached (B) Lightweight
(C) Stateless (D) Application level
13. The port number assigned to FTP protocol is:
(A) 23
(B) 22
(C) 69
(D) 21
14. The protocol used in TCPIIP for dynamic address assignment is :
(A) ARP (B) RARP
(C) DHCP (D) ICMP
15. Normal Switch operates on which layer of OSI model?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
16. What is the upper layer name of OSI layer?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer.
17. ARP sends the request in broadcast, response is unicast Error control is down in which layer?
(A) Layer 4
(B) Layer 5
(C) Layer 1
(D) Layer 3
a) Checking MAC address
b) Checking Networking functionality and validity of IP address
c) Checking cabling performance
d) Checking cable connectivity only
2. DSL is an example of a____________ connection.
A. network
B. wireless
C. slow
D. broadband
3. Internet is
A. a local computer network
B. a world wide network of computers
C. an interconnected network of computers
D. a world wide interconnected network of computers which use a common
protocol to communicate with one another.
4. By an intranet we mean
A. a LAN of an organization
B. a Wide Area Network connecting all branches of an organization
C. a corporate computer network
D. a network connecting all computers of an organization and using the internet
protocol
5. Which layer is closer to the user?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
6. What is the port number of DNS?
(A) 21
(B) 23
(C) 43
(D) 53
7. You have one IP: 192.168.10.29. In which layer this IP works?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
8. What is the port number of Telnet ?
(A) 21
(B) 23
(C) 43
(D) 53
9. Flow control in TCP/IP is handled using:
(A) Urgent pointer
(B) Acknowledgement number
(C) Checksum
(D) Variable-size sliding window
10. Which among the following is a protocol 'of Wireless LAN?
(A) 802.2
(B)802.3
(C) 802.5
(D) 802.11
11. Which is the protocol among the following that is used for translating from physical address
to Internet address?
(A) ICMP
(B) ARP
(C) IGRP
(D)RARP
12. Which property among the ones given below is not possessed by the HTTP protocol?
(A) Non-cached (B) Lightweight
(C) Stateless (D) Application level
13. The port number assigned to FTP protocol is:
(A) 23
(B) 22
(C) 69
(D) 21
14. The protocol used in TCPIIP for dynamic address assignment is :
(A) ARP (B) RARP
(C) DHCP (D) ICMP
15. Normal Switch operates on which layer of OSI model?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer
16. What is the upper layer name of OSI layer?
(A) Network layer.
(B) Physical Layer
(C) Data Link Layer
(D) Application Layer.
17. ARP sends the request in broadcast, response is unicast Error control is down in which layer?
(A) Layer 4
(B) Layer 5
(C) Layer 1
(D) Layer 3
Tuesday 12 September 2017
Monday 11 September 2017
Sunday 10 September 2017
Detailed Syllabus of Kerala PSC HSST Computer Science
1. Discrete Structures
Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion principle, Equivalence and
Partial Orderings. Elementary Counting Techniques.
Computability : Models of computation - Finite Automata, Pushdown Automata, Non –determinism and NFA, DPDA and PDA s and Languages accepted by these structures.
Grammars - types of grammars - type 0 , type I, type 2 and type 3. The relationship between types of grammars,Languages, Non-computability, Non-computable problems.
Groups : Finite fields and Error correcting / detecting codes.
Propositional logic. Predicate logic. Well-formed formulae (WFF). Satisfiability and Tautology.
2. Computer Arithmetic
Logic families : TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops- types, race condition and comparison, Design of combinational and sequential circuits.
Representation of Integers : Octal. Hex. Decimal and Binary 2's complement and 1's complement arithmetic. Floating point representation.
3 . Programming in C and C++
Programming in C : Elements of C - Tokens, identifiers, data types in C, Control constructs in C, Sequence, selection and iteration. Structured data types in C - arrays, structs, unions, strings and pointers.
Object-Oriented programming Concepts : Class - object, instantiation, Inheritance –polymorphism and overloading, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance
C++ - programming : Elements of C++ - Tokens, Identifiers, Variables and constants. Data types, Operators. Control statements, Functions, parameter passing, Class and objects, Constructors and destructors, Overloading, Inheritance, Templates, Exception handling.
4. Relational Database Design and Query Languages
E-R diagrams, Transformation of E-R models to relational design, Normalization - INF, 2NF, 3NF, BCNF and 4NF.
SQL : Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (CDL) Commands. Database objects like- Views, indexes, sequences, synonyms, data dictionary, Embedded SQL, QBE Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems – Concepts, Composite objects, Integration with RDBMS applications.
5 . Data Structures and Algorithms
Data, Information. Definition of data structure, Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted list and multi-lists, B-trees and B+ trees.
Graphs : Definition, walks, paths, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree, Spanning trees, Eccentricity of a vertex radius and diameter of a graph, Hamiltonian and Eulerian graphs. Planar graphs. Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search.
Asymptotic notations - big oh. omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion. Quick sort.
Design of Algorithms (Divide and Conquer. Greedy method. Dynamic programming. Back tracking. Branch and Bound).
6 . Data Communication and Computer Networks
Data Communication : Analog and Digital transmission. Asynchronous and Synchronous transmission. Transmission media. Multiplexing and Concentration, Switching techniques. Polling. Channel capacity. Transmission media - twisted pair, coaxial cables, fibre-optic cables, wireless transmission- radio, microwave and infrared waves. Light wave transmission. Telephones - local loop, trunks, multiplexing, switching, narrow band ISDN, broadband ISDN. ATM, High speed LANs. Cellular Radio, Communication satellites, geosynchronous and low-orbit.
Reference Models : The OSI model, TCP/IP model. Topologies, Networking Devices.Protocols for - (i) Data link layer (ii) Network layer, and (iii) Transport layer, TCP/IP protocols, Networks security, Network administration. Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN). Wireless Networks, Inter Networks.
Internetworking : Switch/Hub. Bridge. Router. Gateways. Concentrated virtual circuits. Tunnelling, Fragmentation. Firewalls.
Routing : Virtual circuits and datagrams. Routing Algorithms. Congestion control.
Network Security : Cryptography - public key, secret key, Domain Name System (DNS) – Electronic Mail and World Wide Web {WWW). The DNS, Resource Records. Name servers. E-mail architecture and E-mail Servers.
7 . System software and Compilers .
Assembly language fundamentals (8085 and 8088 based assembly language programming). Assemblers - 2-pass and single-pass. Macros and macro processors.
Loading, linking, relocation, program relocatability. Linkage editing.
Text editors, Programming Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrapping. Phases of compilation. Lexical analysis. LEX. Context free grammars. Parsing and parse trees. Representation of parse trees and rightmost and leftmost derivations, Bottom up parsers - shift-reduce. operator precedence and LR. YACC.
Top down parsers - left recursion and its removal. Recursive descent parser. Predictive parser.
Intermediate codes - Quadruples, Triples. Indirect Triples. Intermediate code generation, Code generation, Code optimization.
8 . Operating Systems
Main functions of operating systems. Multiprogramming, multiprocessing and multitasking.
Memory management : Virtual memory, paging, fragmentation.
Concurrent processing : Mutual exclusion. Critical regions, lock and unlock.
Scheduling : CPU scheduling. I/O Scheduling. Resource scheduling. Deadlock and scheduling algorithms. Banker's algorithm for deadlock handling.
The Unix system : File system, process management. Bourne shell, shell variables, command line programming.
Systems Calls : Creat, open, close, read, write. Iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering
System Development Life Cycle (SDLC) : Steps, Water fall model. Prototypes, Spiral model.
Software Metrics : Software Project Management.
Software Design : System design. detailed design. function oriented design, object-oriented design, user interface design. Design level metrics.
Coding and Testing : Testing level metrics. Software quality and reliability. Clean room approach, software engineering
10 . Computer Graphics
Display systems. Input devices, 2D Geometry - .Algorithms for drawing primitives, clipping and windowing, windows, view ports, Graphic operations for transformations , 3D Graphics. Animation, Graphics standard. Applications. Storage Devices, Input Tools. Authoring Tools, Application, Files.
11. Programming Language Theory
Programming language concepts, paradigms, models.
Data. Data types, Operators, Expressions. Assignment. Flow of Control - Control structures, I/O structures. I/O statements, User-Defined and built-in functions. Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
Principles, functions, lists, types and polymorphism, higher order functions, lazy evaluation, equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in Prolog, implementation of Prolog, example programs in Prolog.
12. Current Trends and Technologies
The topics of current interest in Computer Science and Computer Applications shall be covered.
The experts shall use their judgement from time to time to include the topics of popular interest which are expected to be known by an ardent follower of the field. Currently, they include :
Parallel computing
Parallel virtual Machine (PVM) and message passing interface (MPI) libraries and calls. Advanced architectures. Today's fastest computers.
Mobile Computing
Mobile connectivity - Cells. Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases - protocols, scope, tools and technology.
E-Technologies
Electronic Commerce : Framework, Media convergence of Applications, Consumer Applications, Organisation applications.
Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards. Risks in Electronic Payment System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy) issues. EDI and Electronic Commerce. Standardisation and EDI. EDI Software Implementation. EDI Envelope for Message Transport, internet-based EDI.
Data Warehousing : Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
Data Mining : Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data. Principles of parallelism, co routines, communication and execution, Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPl paradigm for simple problems like matrix multiplication.
Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion principle, Equivalence and
Partial Orderings. Elementary Counting Techniques.
Computability : Models of computation - Finite Automata, Pushdown Automata, Non –determinism and NFA, DPDA and PDA s and Languages accepted by these structures.
Grammars - types of grammars - type 0 , type I, type 2 and type 3. The relationship between types of grammars,Languages, Non-computability, Non-computable problems.
Groups : Finite fields and Error correcting / detecting codes.
Propositional logic. Predicate logic. Well-formed formulae (WFF). Satisfiability and Tautology.
2. Computer Arithmetic
Logic families : TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops- types, race condition and comparison, Design of combinational and sequential circuits.
Representation of Integers : Octal. Hex. Decimal and Binary 2's complement and 1's complement arithmetic. Floating point representation.
3 . Programming in C and C++
Programming in C : Elements of C - Tokens, identifiers, data types in C, Control constructs in C, Sequence, selection and iteration. Structured data types in C - arrays, structs, unions, strings and pointers.
Object-Oriented programming Concepts : Class - object, instantiation, Inheritance –polymorphism and overloading, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance
C++ - programming : Elements of C++ - Tokens, Identifiers, Variables and constants. Data types, Operators. Control statements, Functions, parameter passing, Class and objects, Constructors and destructors, Overloading, Inheritance, Templates, Exception handling.
4. Relational Database Design and Query Languages
E-R diagrams, Transformation of E-R models to relational design, Normalization - INF, 2NF, 3NF, BCNF and 4NF.
SQL : Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (CDL) Commands. Database objects like- Views, indexes, sequences, synonyms, data dictionary, Embedded SQL, QBE Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems – Concepts, Composite objects, Integration with RDBMS applications.
5 . Data Structures and Algorithms
Data, Information. Definition of data structure, Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted list and multi-lists, B-trees and B+ trees.
Graphs : Definition, walks, paths, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree, Spanning trees, Eccentricity of a vertex radius and diameter of a graph, Hamiltonian and Eulerian graphs. Planar graphs. Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search.
Asymptotic notations - big oh. omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion. Quick sort.
Design of Algorithms (Divide and Conquer. Greedy method. Dynamic programming. Back tracking. Branch and Bound).
6 . Data Communication and Computer Networks
Data Communication : Analog and Digital transmission. Asynchronous and Synchronous transmission. Transmission media. Multiplexing and Concentration, Switching techniques. Polling. Channel capacity. Transmission media - twisted pair, coaxial cables, fibre-optic cables, wireless transmission- radio, microwave and infrared waves. Light wave transmission. Telephones - local loop, trunks, multiplexing, switching, narrow band ISDN, broadband ISDN. ATM, High speed LANs. Cellular Radio, Communication satellites, geosynchronous and low-orbit.
Reference Models : The OSI model, TCP/IP model. Topologies, Networking Devices.Protocols for - (i) Data link layer (ii) Network layer, and (iii) Transport layer, TCP/IP protocols, Networks security, Network administration. Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN). Wireless Networks, Inter Networks.
Internetworking : Switch/Hub. Bridge. Router. Gateways. Concentrated virtual circuits. Tunnelling, Fragmentation. Firewalls.
Routing : Virtual circuits and datagrams. Routing Algorithms. Congestion control.
Network Security : Cryptography - public key, secret key, Domain Name System (DNS) – Electronic Mail and World Wide Web {WWW). The DNS, Resource Records. Name servers. E-mail architecture and E-mail Servers.
7 . System software and Compilers .
Assembly language fundamentals (8085 and 8088 based assembly language programming). Assemblers - 2-pass and single-pass. Macros and macro processors.
Loading, linking, relocation, program relocatability. Linkage editing.
Text editors, Programming Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrapping. Phases of compilation. Lexical analysis. LEX. Context free grammars. Parsing and parse trees. Representation of parse trees and rightmost and leftmost derivations, Bottom up parsers - shift-reduce. operator precedence and LR. YACC.
Top down parsers - left recursion and its removal. Recursive descent parser. Predictive parser.
Intermediate codes - Quadruples, Triples. Indirect Triples. Intermediate code generation, Code generation, Code optimization.
8 . Operating Systems
Main functions of operating systems. Multiprogramming, multiprocessing and multitasking.
Memory management : Virtual memory, paging, fragmentation.
Concurrent processing : Mutual exclusion. Critical regions, lock and unlock.
Scheduling : CPU scheduling. I/O Scheduling. Resource scheduling. Deadlock and scheduling algorithms. Banker's algorithm for deadlock handling.
The Unix system : File system, process management. Bourne shell, shell variables, command line programming.
Systems Calls : Creat, open, close, read, write. Iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering
System Development Life Cycle (SDLC) : Steps, Water fall model. Prototypes, Spiral model.
Software Metrics : Software Project Management.
Software Design : System design. detailed design. function oriented design, object-oriented design, user interface design. Design level metrics.
Coding and Testing : Testing level metrics. Software quality and reliability. Clean room approach, software engineering
10 . Computer Graphics
Display systems. Input devices, 2D Geometry - .Algorithms for drawing primitives, clipping and windowing, windows, view ports, Graphic operations for transformations , 3D Graphics. Animation, Graphics standard. Applications. Storage Devices, Input Tools. Authoring Tools, Application, Files.
11. Programming Language Theory
Programming language concepts, paradigms, models.
Data. Data types, Operators, Expressions. Assignment. Flow of Control - Control structures, I/O structures. I/O statements, User-Defined and built-in functions. Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
Principles, functions, lists, types and polymorphism, higher order functions, lazy evaluation, equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in Prolog, implementation of Prolog, example programs in Prolog.
12. Current Trends and Technologies
The topics of current interest in Computer Science and Computer Applications shall be covered.
The experts shall use their judgement from time to time to include the topics of popular interest which are expected to be known by an ardent follower of the field. Currently, they include :
Parallel computing
Parallel virtual Machine (PVM) and message passing interface (MPI) libraries and calls. Advanced architectures. Today's fastest computers.
Mobile Computing
Mobile connectivity - Cells. Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases - protocols, scope, tools and technology.
E-Technologies
Electronic Commerce : Framework, Media convergence of Applications, Consumer Applications, Organisation applications.
Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards. Risks in Electronic Payment System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy) issues. EDI and Electronic Commerce. Standardisation and EDI. EDI Software Implementation. EDI Envelope for Message Transport, internet-based EDI.
Data Warehousing : Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
Data Mining : Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data. Principles of parallelism, co routines, communication and execution, Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPl paradigm for simple problems like matrix multiplication.
HSST Computer Science Syllabus
Main Topics:-
(1) Discrete Structures
(2) Computer Arithmetic
(3) Programming in C and C++
(4) Relational Database Design and Query Languages
(5) Data Structures and Algorithms
(6) Data Communication and Computer Networks
(7) Systems Software and Compilers
(8) Operating Systems
(9) Software Engineering
(10) Computer Graphics
(11) Programming Language Theory
(12) Current Trends and Technologies
(1) Discrete Structures
(2) Computer Arithmetic
(3) Programming in C and C++
(4) Relational Database Design and Query Languages
(5) Data Structures and Algorithms
(6) Data Communication and Computer Networks
(7) Systems Software and Compilers
(8) Operating Systems
(9) Software Engineering
(10) Computer Graphics
(11) Programming Language Theory
(12) Current Trends and Technologies
Kerala PSC HSST Computer Science Exam Notification
Name of Post: HIGHER SECONDARY SCHOOL TEACHER (Junior) - COMPUTER SCIENCE / COMPUTER APPLICATION
Department: KERALA HIGHER SECONDARY EDUCATIONCategory Number: 341/2017
Last Date: 4th October 2017
Scale of Pay : 32,300- 68,700/-
No. of Vacancies : Anticipated
Website: www.keralapsc.gov.in
Subscribe to:
Posts (Atom)