Introduction to OOP Introduction to OO: Classes and Objects Comparison between structured programming and OOP Declaring objects Member data and functions Encapsulation Constructor, destructor and finalize() method Chain of constructor Invoking base class constructor Objects and arrays “this” keyword Wrapper classes Objects as parameter INHERITANCE AND POLYMORHISM Super class, sub class, inheritance and member access...
Tag: mcs lincoln university course
Post
How to Improve Intercultural Communication Skills?
Improving Intercultural Communication Skills 1. Studying Other Cultures Effectively adapting your communication efforts to another requires not only about knowledge about the culture but also both ability and the motivation to change your personal habits as needed. Modify your personal habits Research ( Making an effort to learn about another person’s culture is a sign...
Post
How to improve non-verbal communication?
Improving Nonverbal communication Pay attention to signals. Focus on the tone, pitch, stress Use good eye contact Ask questions Use signals to make a good meaning Pay attention to time Consider the context Don’t slouch
Post
Non-verbal communication and its categories
What is Non-Verbal Communication? The communication in which we do not use words is called nonverbal communication. Wordless messages / Non-word communication Non-Verbal Communication can roughly be divided into six categories. 1. Kinesics It is the body movement and gestures regarded as a form of nonverbal communication. Example: Use of head, eyes, posture…. 2. Oculesics...
Post
How to Avoid Communication Barriers (Gateways to Each of the Barriers)
1. Semantic Barriers can be avoided/ minimized: a. Using words familiar to the receiver b. Using words with positive connotation c. Expressing words properly translating message correctly clarifying assumption d. Training and practice e. Clarifying nuances ( slight difference in meaning) 2. Physical or Mechanical Barriers can be avoided: ...
Post
Solving Recurrences using Iteration Method
Iteration Method Expand the relation so that summation dependent on n is obtained Bound the summation Example T(n)=2T(n/2)+1 T(1)=1 Solution: T(n)=2T(n/2)+1 Let there is k iteration. So, for the first iteration, k=1. K=2 represents second iteration and goes on. Let’s find what is T(n/2) For this, put it in original function T(n) i.e Replace n...
Post
Open Source Technology – Syllabus
INTRODUCTION TO OPEN SOURCE • Open source definition and principles• History, Open Source Initiative• Open Source Standards, Methodologies, Philosophy• Free source and open source system• Open source licensing systemo Apache License, BSD license, GNU General Public License, GNU Lesser General Public License, and MIT License• Need and Advantages of Open sources OPEN SOURCE OPERATING SYSTEM:...
Post
Telecommunication Systems – MCS 1st Semester Syllabus ~ Lincoln University College
Introduction to Telecommunication System Evolution of telecommunicationsClassification of Switching SystemTransmission Media CharacteristicsTransmission Lines Data Communications IntroductionOSI ModelData TransmissionData encoding by Line codingAsynchronous and Synchronous TransmissionError DetectionInterfacingData Link LayerRouting in Packet switched NetworksFlow and Congestion ControlLAN, MAN and WAN Multiplexing and Switchig Frequency division multiplex, wavelength division multiplexSpace division multiplexTime division multiplex, North American TDM system,...
Post
Forms of Communication
Verbal Communication: Oral and Written The term verbal implies the use of words which makes language. Verbal communication means communication through spoken and written words. The process of communication involves the use of a common set of symbols between the sender and the receiver. A. Oral Communication Oral communication means communication through speech. A person...
Post
Algorithm, RAM Model, Asymptotic Notation
Algorithm Finite set of computational instructions Set of steps to solve the problem Properties: Input / output : some input from some standard set of input and must produce output Definiteness: each step must be unambiguous Finiteness: algorithm must terminate after finite tome or steps Correctness: correct set of output values must be provided from...